Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r087-tall-171620521500108.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is CANInsertWithFailure-PT-100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r087-tall-171620521500108
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 61M
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 60M May 18 16:42 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-LTLFireability-00
FORMULA_NAME CANInsertWithFailure-PT-100-LTLFireability-01
FORMULA_NAME CANInsertWithFailure-PT-100-LTLFireability-02
FORMULA_NAME CANInsertWithFailure-PT-100-LTLFireability-03
FORMULA_NAME CANInsertWithFailure-PT-100-LTLFireability-04
FORMULA_NAME CANInsertWithFailure-PT-100-LTLFireability-05
FORMULA_NAME CANInsertWithFailure-PT-100-LTLFireability-06
FORMULA_NAME CANInsertWithFailure-PT-100-LTLFireability-07
FORMULA_NAME CANInsertWithFailure-PT-100-LTLFireability-08
FORMULA_NAME CANInsertWithFailure-PT-100-LTLFireability-09
FORMULA_NAME CANInsertWithFailure-PT-100-LTLFireability-10
FORMULA_NAME CANInsertWithFailure-PT-100-LTLFireability-11
FORMULA_NAME CANInsertWithFailure-PT-100-LTLFireability-12
FORMULA_NAME CANInsertWithFailure-PT-100-LTLFireability-13
FORMULA_NAME CANInsertWithFailure-PT-100-LTLFireability-14
FORMULA_NAME CANInsertWithFailure-PT-100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716242047257

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-100
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-20 21:54:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 21:54:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 21:54:10] [INFO ] Load time of PNML (sax parser for PT used): 1352 ms
[2024-05-20 21:54:10] [INFO ] Transformed 21204 places.
[2024-05-20 21:54:10] [INFO ] Transformed 60600 transitions.
[2024-05-20 21:54:10] [INFO ] Parsed PT model containing 21204 places and 60600 transitions and 162000 arcs in 1861 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 41 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA CANInsertWithFailure-PT-100-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 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 9485 ms. Remains 21203 /21204 variables (removed 1) and now considering 60600/60600 (removed 0) transitions.
// Phase 1: matrix 60600 rows 21203 cols
[2024-05-20 21:54:46] [INFO ] Computed 102 invariants in 25413 ms
[2024-05-20 21:54:48] [INFO ] Implicit Places using invariants in 27388 ms returned []
Implicit Place search using SMT only with invariants took 27423 ms to find 0 implicit places.
[2024-05-20 21:54:48] [INFO ] Invariant cache hit.
[2024-05-20 21:54:50] [INFO ] Dead Transitions using invariants and state equation in 1779 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 38703 ms. Remains : 21203/21204 places, 60600/60600 transitions.
Support contains 48 out of 21203 places after structural reductions.
[2024-05-20 21:54:52] [INFO ] Flatten gal took : 1597 ms
[2024-05-20 21:54:53] [INFO ] Flatten gal took : 1225 ms
[2024-05-20 21:54:56] [INFO ] Input system was already deterministic with 60600 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 953 ms. (steps per millisecond=10 ) properties (out of 36) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) 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 31) 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 31) seen :0
Running SMT prover for 31 properties.
[2024-05-20 21:54:58] [INFO ] Invariant cache hit.
[2024-05-20 21:55:08] [INFO ] [Real]Absence check using 100 positive place invariants in 244 ms returned sat
[2024-05-20 21:55:09] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 561 ms returned sat
[2024-05-20 21:55:23] [INFO ] After 6054ms SMT Verify possible using state equation in real domain returned unsat :0 sat :28 real:2
[2024-05-20 21:55:23] [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:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-20 21:55:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 21:55:23] [INFO ] After 25293ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 31 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 40 out of 21203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 688 transitions
Trivial Post-agglo rules discarded 688 transitions
Performed 688 trivial Post agglomeration. Transition count delta: 688
Iterating post reduction 0 with 688 rules applied. Total rules applied 688 place count 21203 transition count 59912
Reduce places removed 688 places and 0 transitions.
Iterating post reduction 1 with 688 rules applied. Total rules applied 1376 place count 20515 transition count 59912
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1376 place count 20515 transition count 59909
Deduced a syphon composed of 3 places in 25 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1382 place count 20512 transition count 59909
Performed 9882 Post agglomeration using F-continuation condition.Transition count delta: 9882
Deduced a syphon composed of 9882 places in 27 ms
Reduce places removed 9882 places and 0 transitions.
Iterating global reduction 2 with 19764 rules applied. Total rules applied 21146 place count 10630 transition count 50027
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 21156 place count 10630 transition count 50017
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 21166 place count 10620 transition count 50017
Partial Free-agglomeration rule applied 10091 times.
Drop transitions removed 10091 transitions
Iterating global reduction 3 with 10091 rules applied. Total rules applied 31257 place count 10620 transition count 50017
Partial Free-agglomeration rule applied 300 times.
Drop transitions removed 300 transitions
Iterating global reduction 3 with 300 rules applied. Total rules applied 31557 place count 10620 transition count 50017
Applied a total of 31557 rules in 36386 ms. Remains 10620 /21203 variables (removed 10583) and now considering 50017/60600 (removed 10583) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36388 ms. Remains : 10620/21203 places, 50017/60600 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 783 ms. (steps per millisecond=12 ) properties (out of 31) seen :10
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) seen :0
Running SMT prover for 21 properties.
[2024-05-20 21:56:00] [INFO ] Flow matrix only has 50005 transitions (discarded 12 similar events)
// Phase 1: matrix 50005 rows 10620 cols
[2024-05-20 21:56:12] [INFO ] Computed 102 invariants in 11458 ms
[2024-05-20 21:56:16] [INFO ] [Real]Absence check using 100 positive place invariants in 95 ms returned sat
[2024-05-20 21:56:16] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 191 ms returned sat
[2024-05-20 21:56:37] [INFO ] After 18663ms SMT Verify possible using state equation in real domain returned unsat :0 sat :19 real:1
[2024-05-20 21:56:37] [INFO ] State equation strengthened by 49645 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:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-20 21:56:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 21:56:37] [INFO ] After 25543ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 21 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 26 out of 10620 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10620/10620 places, 50017/50017 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 8 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 10613 transition count 50010
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 17 place count 10613 transition count 50010
Applied a total of 17 rules in 23070 ms. Remains 10613 /10620 variables (removed 7) and now considering 50010/50017 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23070 ms. Remains : 10613/10620 places, 50010/50017 transitions.
FORMULA CANInsertWithFailure-PT-100-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(p1 U p2))))'
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 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 9899 Post agglomeration using F-continuation condition.Transition count delta: 9899
Deduced a syphon composed of 9899 places in 24 ms
Reduce places removed 9899 places and 0 transitions.
Iterating global reduction 2 with 19798 rules applied. Total rules applied 21196 place count 10605 transition count 50002
Applied a total of 21196 rules in 16797 ms. Remains 10605 /21203 variables (removed 10598) and now considering 50002/60600 (removed 10598) transitions.
[2024-05-20 21:57:18] [INFO ] Flow matrix only has 40301 transitions (discarded 9701 similar events)
// Phase 1: matrix 40301 rows 10605 cols
[2024-05-20 21:57:29] [INFO ] Computed 102 invariants in 11323 ms
[2024-05-20 21:57:30] [INFO ] Implicit Places using invariants in 12255 ms returned []
Implicit Place search using SMT only with invariants took 12261 ms to find 0 implicit places.
[2024-05-20 21:57:30] [INFO ] Flow matrix only has 40301 transitions (discarded 9701 similar events)
[2024-05-20 21:57:30] [INFO ] Invariant cache hit.
[2024-05-20 21:57:31] [INFO ] Dead Transitions using invariants and state equation in 1010 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 30071 ms. Remains : 10605/21203 places, 50002/60600 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s3440 1) (GEQ s551 1) (GEQ s8595 1)), p2:(OR (GEQ s3440 1) (AND (GEQ s551 1) (GEQ s8595 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 500 steps with 0 reset in 67 ms.
FORMULA CANInsertWithFailure-PT-100-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-100-LTLFireability-00 finished in 30455 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
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 7824 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
// Phase 1: matrix 60600 rows 21203 cols
[2024-05-20 21:58:06] [INFO ] Computed 102 invariants in 27051 ms
[2024-05-20 21:58:08] [INFO ] Implicit Places using invariants in 28766 ms returned []
Implicit Place search using SMT only with invariants took 28772 ms to find 0 implicit places.
[2024-05-20 21:58:08] [INFO ] Invariant cache hit.
[2024-05-20 21:58:10] [INFO ] Dead Transitions using invariants and state equation in 1730 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38329 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s4180 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 66565 steps with 26 reset in 2029 ms.
FORMULA CANInsertWithFailure-PT-100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-100-LTLFireability-01 finished in 40574 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((X(F(p1))||p0))))))'
Support contains 5 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 7492 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
[2024-05-20 21:58:19] [INFO ] Invariant cache hit.
[2024-05-20 21:58:21] [INFO ] Implicit Places using invariants in 1758 ms returned []
Implicit Place search using SMT only with invariants took 1759 ms to find 0 implicit places.
[2024-05-20 21:58:21] [INFO ] Invariant cache hit.
[2024-05-20 21:58:23] [INFO ] Dead Transitions using invariants and state equation in 1789 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11044 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s1267 1) (LT s6927 1)), p1:(OR (LT s10263 1) (LT s1337 1) (LT s8521 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 41 reset in 3030 ms.
Product exploration explored 100000 steps with 41 reset in 2947 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 p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-20 21:58:30] [INFO ] Invariant cache hit.
[2024-05-20 21:58:33] [INFO ] [Real]Absence check using 100 positive place invariants in 209 ms returned sat
[2024-05-20 21:58:34] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 523 ms returned sat
[2024-05-20 21:58:55] [INFO ] After 25020ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 21203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 22 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
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 21200 place count 10604 transition count 49999
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 21202 place count 10602 transition count 49999
Partial Free-agglomeration rule applied 10099 times.
Drop transitions removed 10099 transitions
Iterating global reduction 3 with 10099 rules applied. Total rules applied 31301 place count 10602 transition count 49999
Applied a total of 31301 rules in 24884 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 24886 ms. Remains : 10602/21203 places, 49999/60600 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 430 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 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 97115 steps, run timeout after 3002 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97115 steps, saw 93003 distinct states, run finished after 3005 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 21:59:24] [INFO ] Flow matrix only has 49997 transitions (discarded 2 similar events)
// Phase 1: matrix 49997 rows 10602 cols
[2024-05-20 21:59:34] [INFO ] Computed 102 invariants in 9749 ms
[2024-05-20 21:59:35] [INFO ] [Real]Absence check using 100 positive place invariants in 102 ms returned sat
[2024-05-20 21:59:35] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 186 ms returned sat
[2024-05-20 21:59:59] [INFO ] After 25012ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 3 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 5462 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 5462 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 5358 ms. Remains 10602 /10602 variables (removed 0) and now considering 49999/49999 (removed 0) transitions.
[2024-05-20 22:00:09] [INFO ] Flow matrix only has 49997 transitions (discarded 2 similar events)
[2024-05-20 22:00:09] [INFO ] Invariant cache hit.
[2024-05-20 22:00:10] [INFO ] Implicit Places using invariants in 901 ms returned []
Implicit Place search using SMT only with invariants took 902 ms to find 0 implicit places.
[2024-05-20 22:00:10] [INFO ] Flow matrix only has 49997 transitions (discarded 2 similar events)
[2024-05-20 22:00:10] [INFO ] Invariant cache hit.
[2024-05-20 22:00:11] [INFO ] Dead Transitions using invariants and state equation in 885 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7156 ms. Remains : 10602/10602 places, 49999/49999 transitions.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 5 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 4951 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
// Phase 1: matrix 60600 rows 21203 cols
[2024-05-20 22:00:40] [INFO ] Computed 102 invariants in 23632 ms
[2024-05-20 22:00:42] [INFO ] Implicit Places using invariants in 25284 ms returned []
Implicit Place search using SMT only with invariants took 25285 ms to find 0 implicit places.
[2024-05-20 22:00:42] [INFO ] Invariant cache hit.
[2024-05-20 22:00:44] [INFO ] Dead Transitions using invariants and state equation in 1626 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31866 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 p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 417 ms. (steps per millisecond=23 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 102162 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102162 steps, saw 100773 distinct states, run finished after 3003 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-20 22:00:48] [INFO ] Invariant cache hit.
[2024-05-20 22:00:50] [INFO ] [Real]Absence check using 100 positive place invariants in 192 ms returned sat
[2024-05-20 22:00:51] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 522 ms returned sat
[2024-05-20 22:01:13] [INFO ] After 21233ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 22:01:13] [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:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-20 22:01:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 22:01:13] [INFO ] After 25229ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 21203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 698 transitions
Trivial Post-agglo rules discarded 698 transitions
Performed 698 trivial Post agglomeration. Transition count delta: 698
Iterating post reduction 0 with 698 rules applied. Total rules applied 698 place count 21203 transition count 59902
Reduce places removed 698 places and 0 transitions.
Iterating post reduction 1 with 698 rules applied. Total rules applied 1396 place count 20505 transition count 59902
Performed 9900 Post agglomeration using F-continuation condition.Transition count delta: 9900
Deduced a syphon composed of 9900 places in 21 ms
Reduce places removed 9900 places and 0 transitions.
Iterating global reduction 2 with 19800 rules applied. Total rules applied 21196 place count 10605 transition count 50002
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 21199 place count 10605 transition count 49999
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 21202 place count 10602 transition count 49999
Partial Free-agglomeration rule applied 10098 times.
Drop transitions removed 10098 transitions
Iterating global reduction 3 with 10098 rules applied. Total rules applied 31300 place count 10602 transition count 49999
Applied a total of 31300 rules in 27586 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 27587 ms. Remains : 10602/21203 places, 49999/60600 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 507 ms. (steps per millisecond=19 ) 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 :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-20 22:01:41] [INFO ] Flow matrix only has 49996 transitions (discarded 3 similar events)
// Phase 1: matrix 49996 rows 10602 cols
[2024-05-20 22:01:51] [INFO ] Computed 102 invariants in 10110 ms
[2024-05-20 22:01:52] [INFO ] [Real]Absence check using 100 positive place invariants in 97 ms returned sat
[2024-05-20 22:01:53] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 187 ms returned sat
[2024-05-20 22:02:16] [INFO ] After 25014ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 10602 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10602/10602 places, 49999/49999 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10602 transition count 49999
Applied a total of 1 rules in 11193 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 11193 ms. Remains : 10602/10602 places, 49999/49999 transitions.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 311 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 40 reset in 3134 ms.
Product exploration explored 100000 steps with 39 reset in 2990 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 5 out of 21203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Performed 498 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 498 rules applied. Total rules applied 498 place count 21203 transition count 60600
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 102 Pre rules applied. Total rules applied 498 place count 21203 transition count 60600
Deduced a syphon composed of 600 places in 18 ms
Iterating global reduction 1 with 102 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 17 ms
Iterating global reduction 1 with 200 rules applied. Total rules applied 1000 place count 21003 transition count 60400
Performed 9998 Post agglomeration using F-continuation condition.Transition count delta: -19600
Deduced a syphon composed of 10398 places in 23 ms
Iterating global reduction 1 with 9998 rules applied. Total rules applied 10998 place count 21003 transition count 80000
Discarding 396 places :
Symmetric choice reduction at 1 with 396 rule applications. Total rules 11394 place count 20607 transition count 79604
Deduced a syphon composed of 10002 places in 12 ms
Iterating global reduction 1 with 396 rules applied. Total rules applied 11790 place count 20607 transition count 79604
Deduced a syphon composed of 10002 places in 11 ms
Applied a total of 11790 rules in 43649 ms. Remains 20607 /21203 variables (removed 596) and now considering 79604/60600 (removed -19004) transitions.
[2024-05-20 22:03:18] [INFO ] Flow matrix only has 69902 transitions (discarded 9702 similar events)
// Phase 1: matrix 69902 rows 20607 cols
[2024-05-20 22:03:44] [INFO ] Computed 102 invariants in 25025 ms
[2024-05-20 22:03:45] [INFO ] Dead Transitions using invariants and state equation in 26615 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20607/21203 places, 79604/60600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70267 ms. Remains : 20607/21203 places, 79604/60600 transitions.
Built C files in :
/tmp/ltsmin13167778770333921063
[2024-05-20 22:03:46] [INFO ] Built C files in 497ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13167778770333921063
Running compilation step : cd /tmp/ltsmin13167778770333921063;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13167778770333921063;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13167778770333921063;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 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 6650 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
// Phase 1: matrix 60600 rows 21203 cols
[2024-05-20 22:04:17] [INFO ] Computed 102 invariants in 21892 ms
[2024-05-20 22:04:19] [INFO ] Implicit Places using invariants in 23527 ms returned []
Implicit Place search using SMT only with invariants took 23528 ms to find 0 implicit places.
[2024-05-20 22:04:19] [INFO ] Invariant cache hit.
[2024-05-20 22:04:21] [INFO ] Dead Transitions using invariants and state equation in 1687 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31871 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Built C files in :
/tmp/ltsmin11362612293847552111
[2024-05-20 22:04:21] [INFO ] Built C files in 380ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11362612293847552111
Running compilation step : cd /tmp/ltsmin11362612293847552111;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11362612293847552111;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11362612293847552111;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-20 22:04:26] [INFO ] Flatten gal took : 1059 ms
[2024-05-20 22:04:27] [INFO ] Flatten gal took : 1121 ms
[2024-05-20 22:04:27] [INFO ] Time to serialize gal into /tmp/LTL9581656079882775332.gal : 190 ms
[2024-05-20 22:04:28] [INFO ] Time to serialize properties into /tmp/LTL17037268708936801411.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9581656079882775332.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8775432398790752244.hoa' '-atoms' '/tmp/LTL17037268708936801411.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17037268708936801411.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8775432398790752244.hoa
Detected timeout of ITS tools.
[2024-05-20 22:04:44] [INFO ] Flatten gal took : 1162 ms
[2024-05-20 22:04:45] [INFO ] Flatten gal took : 1032 ms
[2024-05-20 22:04:46] [INFO ] Time to serialize gal into /tmp/LTL5691269017428809842.gal : 184 ms
[2024-05-20 22:04:46] [INFO ] Time to serialize properties into /tmp/LTL10403575722518094521.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5691269017428809842.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10403575722518094521.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G(("((Node90IsInserted<1)||(Node27requestsent90<1))")||(X(F("(((Node44requestsent75<1)||(Node95IsInserted<1))||(Node35request...175
Formula 0 simplified : XXXF(!"((Node90IsInserted<1)||(Node27requestsent90<1))" & XG!"(((Node44requestsent75<1)||(Node95IsInserted<1))||(Node35requestsent95...161
Detected timeout of ITS tools.
[2024-05-20 22:05:02] [INFO ] Flatten gal took : 1026 ms
[2024-05-20 22:05:02] [INFO ] Applying decomposition
[2024-05-20 22:05:03] [INFO ] Flatten gal took : 1059 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph880847895658608782.txt' '-o' '/tmp/graph880847895658608782.bin' '-w' '/tmp/graph880847895658608782.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph880847895658608782.bin' '-l' '-1' '-v' '-w' '/tmp/graph880847895658608782.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:05:06] [INFO ] Decomposing Gal with order
[2024-05-20 22:05:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:05:15] [INFO ] Removed a total of 30052 redundant transitions.
[2024-05-20 22:05:16] [INFO ] Flatten gal took : 5151 ms
[2024-05-20 22:05:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 39713 labels/synchronizations in 7188 ms.
[2024-05-20 22:05:24] [INFO ] Time to serialize gal into /tmp/LTL11454173668363369699.gal : 267 ms
[2024-05-20 22:05:24] [INFO ] Time to serialize properties into /tmp/LTL6811712473140695288.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11454173668363369699.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6811712473140695288.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G(("((i34.u358.Node90IsInserted<1)||(i28.u111.Node27requestsent90<1))")||(X(F("(((i45.u179.Node44requestsent75<1)||(i74.u378....220
Formula 0 simplified : XXXF(!"((i34.u358.Node90IsInserted<1)||(i28.u111.Node27requestsent90<1))" & XG!"(((i45.u179.Node44requestsent75<1)||(i74.u378.Node95...206
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3187097048329406901
[2024-05-20 22:05:39] [INFO ] Built C files in 364ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3187097048329406901
Running compilation step : cd /tmp/ltsmin3187097048329406901;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3187097048329406901;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3187097048329406901;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-100-LTLFireability-02 finished in 450392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p0)||G(p1))) U X((p2||(p3 U p4)))))'
Support contains 8 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 6839 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
[2024-05-20 22:05:49] [INFO ] Invariant cache hit.
[2024-05-20 22:05:51] [INFO ] Implicit Places using invariants in 1724 ms returned []
Implicit Place search using SMT only with invariants took 1725 ms to find 0 implicit places.
[2024-05-20 22:05:51] [INFO ] Invariant cache hit.
[2024-05-20 22:05:53] [INFO ] Dead Transitions using invariants and state equation in 1742 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10309 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Stuttering acceptance computed with spot in 644 ms :[(AND (NOT p2) (NOT p4)), (AND (NOT p0) (NOT p2) (NOT p4)), (AND (NOT p2) (NOT p4)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p4)), true, (NOT p4), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p4)), (AND (NOT p0) (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p4)), (AND (NOT p1) p0), (AND p0 (NOT p1) (NOT p4))]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p4) (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p4) p3), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p4)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p4) (NOT p3)), acceptance={0} source=2 dest: 6}, { cond=(AND (NOT p2) (NOT p4) (NOT p3)), acceptance={0} source=2 dest: 7}, { cond=(AND (NOT p1) (NOT p2) (NOT p4) p3), acceptance={0} source=2 dest: 8}, { cond=(AND (NOT p2) (NOT p4) p3), acceptance={0} source=2 dest: 9}, { cond=(AND p1 (NOT p2) (NOT p4) (NOT p3)), acceptance={0} source=2 dest: 10}, { cond=(AND p1 (NOT p2) (NOT p4) p3), acceptance={0} source=2 dest: 11}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p4) (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p4) p3), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2) (NOT p4) (NOT p3)), acceptance={} source=3 dest: 12}, { cond=(AND p1 (NOT p0) (NOT p2) (NOT p4) p3), acceptance={} source=3 dest: 13}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p4) p3), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=true, acceptance={} source=7 dest: 7}, { cond=p1, acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p0) (NOT p4) (NOT p3)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p0) (NOT p4) p3), acceptance={} source=8 dest: 5}], [{ cond=(AND (NOT p1) (NOT p4) (NOT p3)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p4) (NOT p3)), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p1) (NOT p4) p3), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p4) p3), acceptance={} source=9 dest: 9}, { cond=(AND p1 (NOT p4) (NOT p3)), acceptance={} source=9 dest: 10}, { cond=(AND p1 (NOT p4) p3), acceptance={} source=9 dest: 11}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=10 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=10 dest: 12}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p4) (NOT p3)), acceptance={} source=11 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p4) p3), acceptance={} source=11 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p4) (NOT p3)), acceptance={} source=11 dest: 12}, { cond=(AND p1 (NOT p0) (NOT p4) p3), acceptance={} source=11 dest: 13}], [{ cond=(AND (NOT p1) p0), acceptance={} source=12 dest: 4}, { cond=(AND p1 p0), acceptance={} source=12 dest: 12}], [{ cond=(AND (NOT p1) p0 (NOT p4) (NOT p3)), acceptance={} source=13 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p4) p3), acceptance={} source=13 dest: 5}, { cond=(AND p1 p0 (NOT p4) (NOT p3)), acceptance={} source=13 dest: 12}, { cond=(AND p1 p0 (NOT p4) p3), acceptance={} source=13 dest: 13}]], initial=0, aps=[p1:(GEQ s1812 1), p0:(OR (GEQ s1812 1) (AND (GEQ s77 1) (GEQ s2799 1))), p2:(AND (GEQ s236 1) (GEQ s511 1)), p4:(GEQ s15978 1), p3:(AND (GEQ s707 1) (GEQ ...], 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, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA CANInsertWithFailure-PT-100-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-100-LTLFireability-03 finished in 11076 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(p0 U (p1||X(G((p2 U p3))))))))'
Support contains 6 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 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.
Iterating post reduction 1 with 697 rules applied. Total rules applied 1394 place count 20506 transition count 59903
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1394 place count 20506 transition count 59902
Deduced a syphon composed of 1 places in 59 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1396 place count 20505 transition count 59902
Performed 9897 Post agglomeration using F-continuation condition.Transition count delta: 9897
Deduced a syphon composed of 9897 places in 22 ms
Reduce places removed 9897 places and 0 transitions.
Iterating global reduction 2 with 19794 rules applied. Total rules applied 21190 place count 10608 transition count 50005
Applied a total of 21190 rules in 19487 ms. Remains 10608 /21203 variables (removed 10595) and now considering 50005/60600 (removed 10595) transitions.
[2024-05-20 22:06:13] [INFO ] Flow matrix only has 40305 transitions (discarded 9700 similar events)
// Phase 1: matrix 40305 rows 10608 cols
[2024-05-20 22:06:24] [INFO ] Computed 102 invariants in 10586 ms
[2024-05-20 22:06:25] [INFO ] Implicit Places using invariants in 11616 ms returned []
Implicit Place search using SMT only with invariants took 11617 ms to find 0 implicit places.
[2024-05-20 22:06:25] [INFO ] Flow matrix only has 40305 transitions (discarded 9700 similar events)
[2024-05-20 22:06:25] [INFO ] Invariant cache hit.
[2024-05-20 22:06:26] [INFO ] Dead Transitions using invariants and state equation in 1024 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10608/21203 places, 50005/60600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32133 ms. Remains : 10608/21203 places, 50005/60600 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s96 1)), p1:(GEQ s5191 1), p3:(AND (GEQ s361 1) (GEQ s8167 1)), p2:(GEQ s7877 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 514 steps with 0 reset in 29 ms.
FORMULA CANInsertWithFailure-PT-100-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-100-LTLFireability-04 finished in 32341 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(F(p0)&&X(p1)))))'
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 7513 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
// Phase 1: matrix 60600 rows 21203 cols
[2024-05-20 22:07:00] [INFO ] Computed 102 invariants in 26560 ms
[2024-05-20 22:07:02] [INFO ] Implicit Places using invariants in 28199 ms returned []
Implicit Place search using SMT only with invariants took 28200 ms to find 0 implicit places.
[2024-05-20 22:07:02] [INFO ] Invariant cache hit.
[2024-05-20 22:07:03] [INFO ] Dead Transitions using invariants and state equation in 1698 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37424 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LT s6468 1), p1:(GEQ s19164 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 41 reset in 3061 ms.
Product exploration explored 100000 steps with 41 reset in 2915 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 p0 (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 84 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), false, false]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-20 22:07:10] [INFO ] Invariant cache hit.
[2024-05-20 22:07:13] [INFO ] [Real]Absence check using 100 positive place invariants in 204 ms returned sat
[2024-05-20 22:07:14] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 523 ms returned sat
[2024-05-20 22:07:35] [INFO ] After 20697ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-20 22:07:36] [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:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-20 22:07:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 22:07:36] [INFO ] After 25198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 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 9898 Post agglomeration using F-continuation condition.Transition count delta: 9898
Deduced a syphon composed of 9898 places in 21 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
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21197 place count 10605 transition count 50001
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21198 place count 10604 transition count 50001
Partial Free-agglomeration rule applied 10101 times.
Drop transitions removed 10101 transitions
Iterating global reduction 3 with 10101 rules applied. Total rules applied 31299 place count 10604 transition count 50001
Applied a total of 31299 rules in 33644 ms. Remains 10604 /21203 variables (removed 10599) and now considering 50001/60600 (removed 10599) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33645 ms. Remains : 10604/21203 places, 50001/60600 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 468 ms. (steps per millisecond=21 ) properties (out of 3) 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 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 96000 steps, run timeout after 3002 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 96000 steps, saw 92829 distinct states, run finished after 3003 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 50001 rows 10604 cols
[2024-05-20 22:08:23] [INFO ] Computed 102 invariants in 9746 ms
[2024-05-20 22:08:24] [INFO ] [Real]Absence check using 100 positive place invariants in 98 ms returned sat
[2024-05-20 22:08:24] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 183 ms returned sat
[2024-05-20 22:08:48] [INFO ] After 23016ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-20 22:08:48] [INFO ] State equation strengthened by 49696 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:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-20 22:08:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 22:08:48] [INFO ] After 25601ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 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 7188 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 7188 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 7199 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
[2024-05-20 22:09:03] [INFO ] Invariant cache hit.
[2024-05-20 22:09:04] [INFO ] Implicit Places using invariants in 1015 ms returned []
Implicit Place search using SMT only with invariants took 1016 ms to find 0 implicit places.
[2024-05-20 22:09:04] [INFO ] Invariant cache hit.
[2024-05-20 22:09:05] [INFO ] Dead Transitions using invariants and state equation in 1004 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9231 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F p1), (F (AND p1 p0))]
Knowledge based reduction with 7 factoid took 155 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), false, false]
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 22 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 18005 ms. Remains 10605 /21203 variables (removed 10598) and now considering 50002/60600 (removed 10598) transitions.
[2024-05-20 22:09:23] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
// Phase 1: matrix 40302 rows 10605 cols
[2024-05-20 22:09:34] [INFO ] Computed 102 invariants in 10360 ms
[2024-05-20 22:09:34] [INFO ] Implicit Places using invariants in 11288 ms returned []
Implicit Place search using SMT only with invariants took 11290 ms to find 0 implicit places.
[2024-05-20 22:09:35] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2024-05-20 22:09:35] [INFO ] Invariant cache hit.
[2024-05-20 22:09:35] [INFO ] Dead Transitions using invariants and state equation in 887 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 30196 ms. Remains : 10605/21203 places, 50002/60600 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 p1) p0), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 193 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), false, false]
Incomplete random walk after 10000 steps, including 20 resets, run finished after 479 ms. (steps per millisecond=20 ) 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 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 29 ms. (steps per millisecond=344 ) 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 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 68021 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68021 steps, saw 64846 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-20 22:09:40] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2024-05-20 22:09:40] [INFO ] Invariant cache hit.
[2024-05-20 22:09:41] [INFO ] [Real]Absence check using 100 positive place invariants in 92 ms returned sat
[2024-05-20 22:09:41] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 188 ms returned sat
[2024-05-20 22:10:05] [INFO ] After 22740ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2024-05-20 22:10:05] [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:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-20 22:10:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 22:10:05] [INFO ] After 25272ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
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 18922 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 18924 ms. Remains : 10604/10605 places, 50001/50002 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 527 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 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 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 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 94952 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 94952 steps, saw 92636 distinct states, run finished after 3002 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 50001 rows 10604 cols
[2024-05-20 22:10:38] [INFO ] Computed 102 invariants in 10584 ms
[2024-05-20 22:10:40] [INFO ] [Real]Absence check using 100 positive place invariants in 96 ms returned sat
[2024-05-20 22:10:40] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 182 ms returned sat
[2024-05-20 22:11:03] [INFO ] After 22723ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2024-05-20 22:11:04] [INFO ] State equation strengthened by 49696 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:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-20 22:11:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 22:11:04] [INFO ] After 25440ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 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 7366 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 7366 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 7377 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
[2024-05-20 22:11:18] [INFO ] Invariant cache hit.
[2024-05-20 22:11:19] [INFO ] Implicit Places using invariants in 946 ms returned []
Implicit Place search using SMT only with invariants took 947 ms to find 0 implicit places.
[2024-05-20 22:11:19] [INFO ] Invariant cache hit.
[2024-05-20 22:11:20] [INFO ] Dead Transitions using invariants and state equation in 924 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9255 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 109 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 199 reset in 3602 ms.
Product exploration explored 100000 steps with 198 reset in 3662 ms.
Built C files in :
/tmp/ltsmin6015748060290156929
[2024-05-20 22:11:28] [INFO ] Too many transitions (50002) to apply POR reductions. Disabling POR matrices.
[2024-05-20 22:11:29] [INFO ] Built C files in 281ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6015748060290156929
Running compilation step : cd /tmp/ltsmin6015748060290156929;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6015748060290156929;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6015748060290156929;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
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 5639 ms. Remains 10605 /10605 variables (removed 0) and now considering 50002/50002 (removed 0) transitions.
[2024-05-20 22:11:37] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
// Phase 1: matrix 40302 rows 10605 cols
[2024-05-20 22:11:48] [INFO ] Computed 102 invariants in 10377 ms
[2024-05-20 22:11:49] [INFO ] Implicit Places using invariants in 11272 ms returned []
Implicit Place search using SMT only with invariants took 11273 ms to find 0 implicit places.
[2024-05-20 22:11:49] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2024-05-20 22:11:49] [INFO ] Invariant cache hit.
[2024-05-20 22:11:49] [INFO ] Dead Transitions using invariants and state equation in 903 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17820 ms. Remains : 10605/10605 places, 50002/50002 transitions.
Built C files in :
/tmp/ltsmin5071948901509744761
[2024-05-20 22:11:49] [INFO ] Too many transitions (50002) to apply POR reductions. Disabling POR matrices.
[2024-05-20 22:11:50] [INFO ] Built C files in 276ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5071948901509744761
Running compilation step : cd /tmp/ltsmin5071948901509744761;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5071948901509744761;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5071948901509744761;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-20 22:11:54] [INFO ] Flatten gal took : 830 ms
[2024-05-20 22:11:55] [INFO ] Flatten gal took : 827 ms
[2024-05-20 22:11:55] [INFO ] Time to serialize gal into /tmp/LTL10427376639352258786.gal : 144 ms
[2024-05-20 22:11:55] [INFO ] Time to serialize properties into /tmp/LTL1953886404269400787.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10427376639352258786.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3927280540619776561.hoa' '-atoms' '/tmp/LTL1953886404269400787.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1953886404269400787.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3927280540619776561.hoa
Detected timeout of ITS tools.
[2024-05-20 22:12:12] [INFO ] Flatten gal took : 760 ms
[2024-05-20 22:12:12] [INFO ] Flatten gal took : 795 ms
[2024-05-20 22:12:13] [INFO ] Time to serialize gal into /tmp/LTL1747707866983488179.gal : 145 ms
[2024-05-20 22:12:13] [INFO ] Time to serialize properties into /tmp/LTL13802869373766215137.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1747707866983488179.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13802869373766215137.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(Node25GiveAnswer58<1)")))||((F("(Node25GiveAnswer58<1)"))&&(X("(Node89GiveAnswer69>=1)"))))))
Formula 0 simplified : G(FG!"(Node25GiveAnswer58<1)" & (G!"(Node25GiveAnswer58<1)" | X!"(Node89GiveAnswer69>=1)"))
Detected timeout of ITS tools.
[2024-05-20 22:12:29] [INFO ] Flatten gal took : 885 ms
[2024-05-20 22:12:29] [INFO ] Applying decomposition
[2024-05-20 22:12:29] [INFO ] Flatten gal took : 878 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16532512300846011825.txt' '-o' '/tmp/graph16532512300846011825.bin' '-w' '/tmp/graph16532512300846011825.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16532512300846011825.bin' '-l' '-1' '-v' '-w' '/tmp/graph16532512300846011825.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:12:31] [INFO ] Decomposing Gal with order
[2024-05-20 22:12:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:12:39] [INFO ] Removed a total of 39764 redundant transitions.
[2024-05-20 22:12:40] [INFO ] Flatten gal took : 7098 ms
[2024-05-20 22:12:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 29501 labels/synchronizations in 15128 ms.
[2024-05-20 22:12:56] [INFO ] Time to serialize gal into /tmp/LTL10425036992504047075.gal : 162 ms
[2024-05-20 22:12:56] [INFO ] Time to serialize properties into /tmp/LTL13625058192671475009.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10425036992504047075.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13625058192671475009.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(u59.Node25GiveAnswer58<1)")))||((F("(u59.Node25GiveAnswer58<1)"))&&(X("(u70.Node89GiveAnswer69>=1)"))))))
Formula 0 simplified : G(FG!"(u59.Node25GiveAnswer58<1)" & (G!"(u59.Node25GiveAnswer58<1)" | X!"(u70.Node89GiveAnswer69>=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1157239278683806165
[2024-05-20 22:13:11] [INFO ] Built C files in 267ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1157239278683806165
Running compilation step : cd /tmp/ltsmin1157239278683806165;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1157239278683806165;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1157239278683806165;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-100-LTLFireability-05 finished in 408621 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 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 23 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 18358 ms. Remains 10604 /21203 variables (removed 10599) and now considering 50001/60600 (removed 10599) transitions.
[2024-05-20 22:13:33] [INFO ] Flow matrix only has 40299 transitions (discarded 9702 similar events)
// Phase 1: matrix 40299 rows 10604 cols
[2024-05-20 22:13:43] [INFO ] Computed 102 invariants in 10662 ms
[2024-05-20 22:13:44] [INFO ] Implicit Places using invariants in 11583 ms returned []
Implicit Place search using SMT only with invariants took 11590 ms to find 0 implicit places.
[2024-05-20 22:13:44] [INFO ] Flow matrix only has 40299 transitions (discarded 9702 similar events)
[2024-05-20 22:13:44] [INFO ] Invariant cache hit.
[2024-05-20 22:13:45] [INFO ] Dead Transitions using invariants and state equation in 901 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 30853 ms. Remains : 10604/21203 places, 50001/60600 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s185 1) (GEQ s10534 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 436 steps with 0 reset in 18 ms.
FORMULA CANInsertWithFailure-PT-100-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-100-LTLFireability-06 finished in 30974 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F((!p1 U (p2||G(!p1)))))))'
Support contains 5 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 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.
Iterating post reduction 1 with 697 rules applied. Total rules applied 1394 place count 20506 transition count 59903
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1394 place count 20506 transition count 59902
Deduced a syphon composed of 1 places in 16 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1396 place count 20505 transition count 59902
Performed 9899 Post agglomeration using F-continuation condition.Transition count delta: 9899
Deduced a syphon composed of 9899 places in 23 ms
Reduce places removed 9899 places and 0 transitions.
Iterating global reduction 2 with 19798 rules applied. Total rules applied 21194 place count 10606 transition count 50003
Applied a total of 21194 rules in 19267 ms. Remains 10606 /21203 variables (removed 10597) and now considering 50003/60600 (removed 10597) transitions.
[2024-05-20 22:14:05] [INFO ] Flow matrix only has 40301 transitions (discarded 9702 similar events)
// Phase 1: matrix 40301 rows 10606 cols
[2024-05-20 22:14:15] [INFO ] Computed 102 invariants in 10301 ms
[2024-05-20 22:14:16] [INFO ] Implicit Places using invariants in 11227 ms returned []
Implicit Place search using SMT only with invariants took 11232 ms to find 0 implicit places.
[2024-05-20 22:14:16] [INFO ] Flow matrix only has 40301 transitions (discarded 9702 similar events)
[2024-05-20 22:14:16] [INFO ] Invariant cache hit.
[2024-05-20 22:14:17] [INFO ] Dead Transitions using invariants and state equation in 889 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10606/21203 places, 50003/60600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31391 ms. Remains : 10606/21203 places, 50003/60600 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND (NOT p2) p1)]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s937 1), p2:(AND (NOT (AND (GEQ s366 1) (GEQ s5565 1))) (NOT (AND (GEQ s336 1) (GEQ s577 1)))), p1:(AND (GEQ s336 1) (GEQ s577 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 204 reset in 3712 ms.
Product exploration explored 100000 steps with 207 reset in 3747 ms.
Computed a total of 302 stabilizing places and 501 stable transitions
Computed a total of 302 stabilizing places and 501 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 100 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 20 resets, run finished after 465 ms. (steps per millisecond=21 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-20 22:14:25] [INFO ] Flow matrix only has 40301 transitions (discarded 9702 similar events)
[2024-05-20 22:14:25] [INFO ] Invariant cache hit.
[2024-05-20 22:14:27] [INFO ] [Real]Absence check using 100 positive place invariants in 97 ms returned sat
[2024-05-20 22:14:27] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 185 ms returned sat
[2024-05-20 22:14:50] [INFO ] After 25011ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 10606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10606/10606 places, 50003/50003 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 10606 transition count 50000
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 10603 transition count 50000
Partial Free-agglomeration rule applied 10100 times.
Drop transitions removed 10100 transitions
Iterating global reduction 1 with 10100 rules applied. Total rules applied 10106 place count 10603 transition count 50000
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 1 with 100 rules applied. Total rules applied 10206 place count 10603 transition count 50000
Applied a total of 10206 rules in 29307 ms. Remains 10603 /10606 variables (removed 3) and now considering 50000/50003 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29308 ms. Remains : 10603/10606 places, 50000/50003 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 445 ms. (steps per millisecond=22 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-20 22:15:20] [INFO ] Flow matrix only has 49998 transitions (discarded 2 similar events)
// Phase 1: matrix 49998 rows 10603 cols
[2024-05-20 22:15:30] [INFO ] Computed 102 invariants in 10218 ms
[2024-05-20 22:15:32] [INFO ] [Real]Absence check using 100 positive place invariants in 101 ms returned sat
[2024-05-20 22:15:32] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 194 ms returned sat
[2024-05-20 22:15:32] [INFO ] After 1466ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 22:15:33] [INFO ] [Nat]Absence check using 100 positive place invariants in 130 ms returned sat
[2024-05-20 22:15:33] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 190 ms returned sat
[2024-05-20 22:15:57] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 10603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10603/10603 places, 50000/50000 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10603 transition count 50000
Applied a total of 1 rules in 14676 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 14676 ms. Remains : 10603/10603 places, 50000/50000 transitions.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 7 factoid took 165 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Support contains 5 out of 10606 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10606/10606 places, 50003/50003 transitions.
Applied a total of 0 rules in 5818 ms. Remains 10606 /10606 variables (removed 0) and now considering 50003/50003 (removed 0) transitions.
[2024-05-20 22:16:18] [INFO ] Flow matrix only has 40301 transitions (discarded 9702 similar events)
// Phase 1: matrix 40301 rows 10606 cols
[2024-05-20 22:16:28] [INFO ] Computed 102 invariants in 10078 ms
[2024-05-20 22:16:29] [INFO ] Implicit Places using invariants in 10970 ms returned []
Implicit Place search using SMT only with invariants took 10976 ms to find 0 implicit places.
[2024-05-20 22:16:29] [INFO ] Flow matrix only has 40301 transitions (discarded 9702 similar events)
[2024-05-20 22:16:29] [INFO ] Invariant cache hit.
[2024-05-20 22:16:30] [INFO ] Dead Transitions using invariants and state equation in 1001 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17798 ms. Remains : 10606/10606 places, 50003/50003 transitions.
Computed a total of 302 stabilizing places and 501 stable transitions
Computed a total of 302 stabilizing places and 501 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 91 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 19 resets, run finished after 625 ms. (steps per millisecond=16 ) properties (out of 3) seen :1
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 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-20 22:16:31] [INFO ] Flow matrix only has 40301 transitions (discarded 9702 similar events)
[2024-05-20 22:16:31] [INFO ] Invariant cache hit.
[2024-05-20 22:16:32] [INFO ] [Real]Absence check using 100 positive place invariants in 98 ms returned sat
[2024-05-20 22:16:33] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 185 ms returned sat
[2024-05-20 22:16:56] [INFO ] After 25014ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 10606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10606/10606 places, 50003/50003 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 10606 transition count 50000
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 10603 transition count 50000
Partial Free-agglomeration rule applied 10100 times.
Drop transitions removed 10100 transitions
Iterating global reduction 1 with 10100 rules applied. Total rules applied 10106 place count 10603 transition count 50000
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 1 with 100 rules applied. Total rules applied 10206 place count 10603 transition count 50000
Applied a total of 10206 rules in 29504 ms. Remains 10603 /10606 variables (removed 3) and now considering 50000/50003 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29505 ms. Remains : 10603/10606 places, 50000/50003 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 428 ms. (steps per millisecond=23 ) properties (out of 2) seen :1
Finished Best-First random walk after 8769 steps, including 2 resets, run visited all 1 properties in 26 ms. (steps per millisecond=337 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) (NOT p2))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 7 factoid took 178 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 206 reset in 3697 ms.
Product exploration explored 100000 steps with 208 reset in 3708 ms.
Built C files in :
/tmp/ltsmin934210671853639404
[2024-05-20 22:17:34] [INFO ] Too many transitions (50003) to apply POR reductions. Disabling POR matrices.
[2024-05-20 22:17:34] [INFO ] Built C files in 274ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin934210671853639404
Running compilation step : cd /tmp/ltsmin934210671853639404;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin934210671853639404;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin934210671853639404;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 10606 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10606/10606 places, 50003/50003 transitions.
Applied a total of 0 rules in 5524 ms. Remains 10606 /10606 variables (removed 0) and now considering 50003/50003 (removed 0) transitions.
[2024-05-20 22:17:43] [INFO ] Flow matrix only has 40301 transitions (discarded 9702 similar events)
[2024-05-20 22:17:43] [INFO ] Invariant cache hit.
[2024-05-20 22:17:44] [INFO ] Implicit Places using invariants in 919 ms returned []
Implicit Place search using SMT only with invariants took 920 ms to find 0 implicit places.
[2024-05-20 22:17:44] [INFO ] Flow matrix only has 40301 transitions (discarded 9702 similar events)
[2024-05-20 22:17:44] [INFO ] Invariant cache hit.
[2024-05-20 22:17:45] [INFO ] Dead Transitions using invariants and state equation in 977 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7428 ms. Remains : 10606/10606 places, 50003/50003 transitions.
Built C files in :
/tmp/ltsmin11642910819971857722
[2024-05-20 22:17:45] [INFO ] Too many transitions (50003) to apply POR reductions. Disabling POR matrices.
[2024-05-20 22:17:45] [INFO ] Built C files in 275ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11642910819971857722
Running compilation step : cd /tmp/ltsmin11642910819971857722;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11642910819971857722;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11642910819971857722;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-20 22:17:50] [INFO ] Flatten gal took : 814 ms
[2024-05-20 22:17:50] [INFO ] Flatten gal took : 762 ms
[2024-05-20 22:17:50] [INFO ] Time to serialize gal into /tmp/LTL302431579242889759.gal : 143 ms
[2024-05-20 22:17:50] [INFO ] Time to serialize properties into /tmp/LTL2286492752069759910.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL302431579242889759.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13513884522430978716.hoa' '-atoms' '/tmp/LTL2286492752069759910.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL2286492752069759910.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13513884522430978716.hoa
Detected timeout of ITS tools.
[2024-05-20 22:18:07] [INFO ] Flatten gal took : 772 ms
[2024-05-20 22:18:08] [INFO ] Flatten gal took : 831 ms
[2024-05-20 22:18:08] [INFO ] Time to serialize gal into /tmp/LTL15614501039141039147.gal : 186 ms
[2024-05-20 22:18:08] [INFO ] Time to serialize properties into /tmp/LTL15872895754421052428.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15614501039141039147.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15872895754421052428.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((F(G("(Node3requestsent32<1)")))&&(F((!("((Node55Request>=1)&&(Node95IsInserted>=1))"))U(("((!((Node60IsInserted>=1)&&(Node49requ...282
Formula 0 simplified : F(GF!"(Node3requestsent32<1)" | G("((Node55Request>=1)&&(Node95IsInserted>=1))" M !"((!((Node60IsInserted>=1)&&(Node49requestsent60>...212
Detected timeout of ITS tools.
[2024-05-20 22:18:24] [INFO ] Flatten gal took : 763 ms
[2024-05-20 22:18:24] [INFO ] Applying decomposition
[2024-05-20 22:18:25] [INFO ] Flatten gal took : 807 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1093519678688212019.txt' '-o' '/tmp/graph1093519678688212019.bin' '-w' '/tmp/graph1093519678688212019.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1093519678688212019.bin' '-l' '-1' '-v' '-w' '/tmp/graph1093519678688212019.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:18:27] [INFO ] Decomposing Gal with order
[2024-05-20 22:18:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:18:34] [INFO ] Removed a total of 39761 redundant transitions.
[2024-05-20 22:18:35] [INFO ] Flatten gal took : 6586 ms
[2024-05-20 22:18:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 29800 labels/synchronizations in 15027 ms.
[2024-05-20 22:18:50] [INFO ] Time to serialize gal into /tmp/LTL11054507567870106528.gal : 151 ms
[2024-05-20 22:18:50] [INFO ] Time to serialize properties into /tmp/LTL16485762036923519917.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11054507567870106528.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16485762036923519917.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G((F(G("(u4.Node3requestsent32<1)")))&&(F((!("((i56.u57.Node55Request>=1)&&(u97.Node95IsInserted>=1))"))U(("((!((u62.Node60IsInsert...329
Formula 0 simplified : F(GF!"(u4.Node3requestsent32<1)" | G("((i56.u57.Node55Request>=1)&&(u97.Node95IsInserted>=1))" M !"((!((u62.Node60IsInserted>=1)&&(u...247
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15357327798470090478
[2024-05-20 22:19:06] [INFO ] Built C files in 277ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15357327798470090478
Running compilation step : cd /tmp/ltsmin15357327798470090478;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15357327798470090478;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15357327798470090478;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-100-LTLFireability-07 finished in 323455 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 22 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 17429 ms. Remains 10604 /21203 variables (removed 10599) and now considering 50001/60600 (removed 10599) transitions.
[2024-05-20 22:19:26] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
// Phase 1: matrix 40300 rows 10604 cols
[2024-05-20 22:19:37] [INFO ] Computed 102 invariants in 10377 ms
[2024-05-20 22:19:38] [INFO ] Implicit Places using invariants in 11272 ms returned []
Implicit Place search using SMT only with invariants took 11277 ms to find 0 implicit places.
[2024-05-20 22:19:38] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
[2024-05-20 22:19:38] [INFO ] Invariant cache hit.
[2024-05-20 22:19:38] [INFO ] Dead Transitions using invariants and state equation in 930 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 29640 ms. Remains : 10604/21203 places, 50001/60600 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s3180 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 478 steps with 0 reset in 18 ms.
FORMULA CANInsertWithFailure-PT-100-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-100-LTLFireability-08 finished in 29766 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(X(p0)&&(p1 U (G(p1)||(p1&&G((!p2||G(p3)))))))))'
Support contains 5 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 5823 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
// Phase 1: matrix 60600 rows 21203 cols
[2024-05-20 22:20:06] [INFO ] Computed 102 invariants in 22017 ms
[2024-05-20 22:20:08] [INFO ] Implicit Places using invariants in 23619 ms returned []
Implicit Place search using SMT only with invariants took 23624 ms to find 0 implicit places.
[2024-05-20 22:20:08] [INFO ] Invariant cache hit.
[2024-05-20 22:20:10] [INFO ] Dead Transitions using invariants and state equation in 1588 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31037 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Stuttering acceptance computed with spot in 598 ms :[(NOT p0), true, (NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) p2 (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p3) p2), (AND (NOT p0) (NOT p3) p2), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p3) p1), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p0) p2 p3 p1), acceptance={} source=0 dest: 6}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 7}, { cond=(AND p0 p2 (NOT p3) p1), acceptance={} source=0 dest: 8}, { cond=(AND p0 p2 p3 p1), acceptance={} source=0 dest: 9}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p3) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 5}, { cond=(AND p2 p3 p1), acceptance={} source=4 dest: 6}], [{ cond=(AND p2 (NOT p3) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p2 (NOT p3) p1), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 5}, { cond=(AND p2 p3 p1), acceptance={} source=5 dest: 6}, { cond=(AND p2 p3 (NOT p1)), acceptance={} source=5 dest: 10}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 11}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND p2 (NOT p3) p1), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 5}, { cond=(AND p2 p3 p1), acceptance={} source=6 dest: 6}, { cond=(AND p3 (NOT p1)), acceptance={} source=6 dest: 10}], [{ cond=(AND (NOT p0) p2 (NOT p3) (NOT p1)), acceptance={} source=7 dest: 1}, { cond=(AND p0 p2 (NOT p3) (NOT p1)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p3) p1), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) p2 p3 p1), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=7 dest: 7}, { cond=(AND p0 p2 (NOT p3) p1), acceptance={} source=7 dest: 8}, { cond=(AND p0 p2 p3 p1), acceptance={} source=7 dest: 9}, { cond=(AND (NOT p0) p2 p3 (NOT p1)), acceptance={} source=7 dest: 10}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 11}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=7 dest: 12}, { cond=(AND p0 p2 p3 (NOT p1)), acceptance={} source=7 dest: 13}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p3) p1), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p0) p2 p3 p1), acceptance={} source=8 dest: 6}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=8 dest: 7}, { cond=(AND p0 p2 (NOT p3) p1), acceptance={} source=8 dest: 8}, { cond=(AND p0 p2 p3 p1), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=9 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={} source=9 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p3) p1), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p0) p2 p3 p1), acceptance={} source=9 dest: 6}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=9 dest: 7}, { cond=(AND p0 p2 (NOT p3) p1), acceptance={} source=9 dest: 8}, { cond=(AND p0 p2 p3 p1), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={} source=9 dest: 10}, { cond=(AND p0 p3 (NOT p1)), acceptance={} source=9 dest: 13}], [{ cond=(NOT p3), acceptance={} source=10 dest: 1}, { cond=p3, acceptance={} source=10 dest: 10}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=11 dest: 1}, { cond=(AND p2 p3), acceptance={} source=11 dest: 10}, { cond=(NOT p2), acceptance={} source=11 dest: 11}], [{ cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=12 dest: 1}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=12 dest: 3}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=12 dest: 10}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=12 dest: 11}, { cond=(AND p0 (NOT p2)), acceptance={} source=12 dest: 12}, { cond=(AND p0 p2 p3), acceptance={} source=12 dest: 13}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=13 dest: 1}, { cond=(AND p0 (NOT p3)), acceptance={} source=13 dest: 3}, { cond=(AND (NOT p0) p3), acceptance={} source=13 dest: 10}, { cond=(AND p0 p3), acceptance={} source=13 dest: 13}]], initial=0, aps=[p0:(LT s6741 1), p1:(LT s12763 1), p2:(AND (GEQ s903 1) (GEQ s1230 1)), p3:(LT s835 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 69 reset in 3196 ms.
Product exploration explored 100000 steps with 73 reset in 3048 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 p0 p1 (NOT p2) p3), (X (AND p0 (NOT p2) p1)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p3 p1))), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (NOT (AND p2 (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p3 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p3) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p2 p3 p1))), (X p1), (X (NOT (AND p2 p3 p1))), (X (NOT (AND (NOT p0) p2 p3 (NOT p1)))), (X (NOT (AND p2 p3 (NOT p1)))), (X (NOT (AND p0 p2 p3 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 p3 (NOT p1)))), (X (NOT (AND p2 (NOT p3) p1))), (X (NOT (AND p0 p2 (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p3) p1))), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p0 (NOT p2) p1))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p3 p1)))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 p2 (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (NOT (AND p0 (NOT p1))))), true, (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 p2 p3 p1)))), (X (X p1)), (X (X (NOT (AND p2 p3 p1)))), (X (X (NOT (AND (NOT p0) p2 p3 (NOT p1))))), (X (X (NOT (AND p2 p3 (NOT p1))))), (X (X (NOT (AND p2 p3)))), (X (X (AND p0 p3))), (X (X (NOT (AND p0 p2 p3 (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p3)), (X (X (NOT (AND p0 p2 p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (NOT (AND p2 (NOT p3) p1)))), (X (X (NOT (AND p0 p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) p3 (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 72 factoid took 401 ms. Reduced automaton from 14 states, 73 edges and 4 AP (stutter sensitive) to 12 states, 63 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 423 ms :[true, (AND (NOT p3) (NOT p0) p2), (AND (NOT p3) (NOT p0) p2 (NOT p1)), (AND (NOT p3) p2), (NOT p0), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p3) p2 (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 551 ms. (steps per millisecond=18 ) properties (out of 42) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) seen :0
Interrupted probabilistic random walk after 76287 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 76287 steps, saw 75298 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 39 properties.
[2024-05-20 22:20:21] [INFO ] Invariant cache hit.
[2024-05-20 22:20:34] [INFO ] [Real]Absence check using 100 positive place invariants in 212 ms returned sat
[2024-05-20 22:20:34] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 548 ms returned sat
[2024-05-20 22:20:46] [INFO ] After 11344ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:35
[2024-05-20 22:20:47] [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:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-20 22:20:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 22:20:47] [INFO ] After 25316ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 39 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 21203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 696 transitions
Trivial Post-agglo rules discarded 696 transitions
Performed 696 trivial Post agglomeration. Transition count delta: 696
Iterating post reduction 0 with 696 rules applied. Total rules applied 696 place count 21203 transition count 59904
Reduce places removed 696 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 697 rules applied. Total rules applied 1393 place count 20507 transition count 59903
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1394 place count 20506 transition count 59903
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1394 place count 20506 transition count 59902
Deduced a syphon composed of 1 places in 21 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1396 place count 20505 transition count 59902
Performed 9898 Post agglomeration using F-continuation condition.Transition count delta: 9898
Deduced a syphon composed of 9898 places in 23 ms
Reduce places removed 9898 places and 0 transitions.
Iterating global reduction 3 with 19796 rules applied. Total rules applied 21192 place count 10607 transition count 50004
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 21194 place count 10607 transition count 50002
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 21196 place count 10605 transition count 50002
Partial Free-agglomeration rule applied 10101 times.
Drop transitions removed 10101 transitions
Iterating global reduction 4 with 10101 rules applied. Total rules applied 31297 place count 10605 transition count 50002
Partial Free-agglomeration rule applied 200 times.
Drop transitions removed 200 transitions
Iterating global reduction 4 with 200 rules applied. Total rules applied 31497 place count 10605 transition count 50002
Applied a total of 31497 rules in 40323 ms. Remains 10605 /21203 variables (removed 10598) and now considering 50002/60600 (removed 10598) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40325 ms. Remains : 10605/21203 places, 50002/60600 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 853 ms. (steps per millisecond=11 ) properties (out of 39) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) seen :0
Running SMT prover for 31 properties.
[2024-05-20 22:21:28] [INFO ] Flow matrix only has 50000 transitions (discarded 2 similar events)
// Phase 1: matrix 50000 rows 10605 cols
[2024-05-20 22:21:39] [INFO ] Computed 102 invariants in 10861 ms
[2024-05-20 22:21:44] [INFO ] [Real]Absence check using 100 positive place invariants in 99 ms returned sat
[2024-05-20 22:21:44] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 185 ms returned sat
[2024-05-20 22:22:04] [INFO ] After 19113ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:25
[2024-05-20 22:22:04] [INFO ] State equation strengthened by 49595 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:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-20 22:22:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 22:22:04] [INFO ] After 25435ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 31 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 10605 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10605/10605 places, 50002/50002 transitions.
Applied a total of 0 rules in 7293 ms. Remains 10605 /10605 variables (removed 0) and now considering 50002/50002 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7294 ms. Remains : 10605/10605 places, 50002/50002 transitions.
Knowledge obtained : [(AND p0 p1 (NOT p2) p3), (X (AND p0 (NOT p2) p1)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p3 p1))), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (NOT (AND p2 (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p3 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p3) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p2 p3 p1))), (X p1), (X (NOT (AND p2 p3 p1))), (X (NOT (AND (NOT p0) p2 p3 (NOT p1)))), (X (NOT (AND p2 p3 (NOT p1)))), (X (NOT (AND p0 p2 p3 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 p3 (NOT p1)))), (X (NOT (AND p2 (NOT p3) p1))), (X (NOT (AND p0 p2 (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p3) p1))), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p0 (NOT p2) p1))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p3 p1)))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 p2 (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (NOT (AND p0 (NOT p1))))), true, (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 p2 p3 p1)))), (X (X p1)), (X (X (NOT (AND p2 p3 p1)))), (X (X (NOT (AND (NOT p0) p2 p3 (NOT p1))))), (X (X (NOT (AND p2 p3 (NOT p1))))), (X (X (NOT (AND p2 p3)))), (X (X (AND p0 p3))), (X (X (NOT (AND p0 p2 p3 (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p3)), (X (X (NOT (AND p0 p2 p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (NOT (AND p2 (NOT p3) p1)))), (X (X (NOT (AND p0 p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) p3 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND p3 p0))), (F (AND (NOT p3) p0)), (F (AND p3 p0 p2)), (F p2), (F (AND p1 p3 p0 p2)), (F (NOT (AND p0 (NOT p2)))), (F (NOT p3)), (F (NOT (AND p1 p0 (NOT p2)))), (F (AND p1 p3 p2)), (F (AND p3 p2)), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 72 factoid took 1413 ms. Reduced automaton from 12 states, 63 edges and 4 AP (stutter insensitive) to 12 states, 63 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 419 ms :[true, (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p0)), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p3) p2 (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p3) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 437 ms :[true, (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p0)), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p3) p2 (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p3) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Support contains 5 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 696 transitions
Trivial Post-agglo rules discarded 696 transitions
Performed 696 trivial Post agglomeration. Transition count delta: 696
Iterating post reduction 0 with 696 rules applied. Total rules applied 696 place count 21203 transition count 59904
Reduce places removed 696 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 697 rules applied. Total rules applied 1393 place count 20507 transition count 59903
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1394 place count 20506 transition count 59903
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1394 place count 20506 transition count 59902
Deduced a syphon composed of 1 places in 16 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1396 place count 20505 transition count 59902
Performed 9898 Post agglomeration using F-continuation condition.Transition count delta: 9898
Deduced a syphon composed of 9898 places in 23 ms
Reduce places removed 9898 places and 0 transitions.
Iterating global reduction 3 with 19796 rules applied. Total rules applied 21192 place count 10607 transition count 50004
Applied a total of 21192 rules in 17734 ms. Remains 10607 /21203 variables (removed 10596) and now considering 50004/60600 (removed 10596) transitions.
[2024-05-20 22:22:32] [INFO ] Flow matrix only has 40302 transitions (discarded 9702 similar events)
// Phase 1: matrix 40302 rows 10607 cols
[2024-05-20 22:22:43] [INFO ] Computed 102 invariants in 10765 ms
[2024-05-20 22:22:43] [INFO ] Implicit Places using invariants in 11663 ms returned []
Implicit Place search using SMT only with invariants took 11664 ms to find 0 implicit places.
[2024-05-20 22:22:43] [INFO ] Flow matrix only has 40302 transitions (discarded 9702 similar events)
[2024-05-20 22:22:43] [INFO ] Invariant cache hit.
[2024-05-20 22:22:44] [INFO ] Dead Transitions using invariants and state equation in 917 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10607/21203 places, 50004/60600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30317 ms. Remains : 10607/21203 places, 50004/60600 transitions.
Computed a total of 299 stabilizing places and 499 stable transitions
Computed a total of 299 stabilizing places and 499 stable transitions
Knowledge obtained : [(AND p3 (NOT p2) p0 p1), (X (NOT (AND p1 (NOT p3) (NOT p0) p2))), (X (NOT (AND (NOT p1) p3 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) p0))), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p1) p3 (NOT p0) p2))), (X (NOT (AND (NOT p3) (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p3 p0 p2))), (X (NOT (AND p1 (NOT p3) p0 p2))), (X (NOT (AND (NOT p3) p2))), (X p1), (X (NOT (AND (NOT p3) p0 p2))), (X (NOT (AND p3 p0 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p3 p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 p3 (NOT p0) p2))), (X (AND p0 (NOT p2))), (X p0), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0) p2))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p1) (NOT p3) p0 p2))), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p3 p2))), (X (NOT (AND (NOT p3) p0))), (X (NOT (AND p3 (NOT p0) p2))), (X (AND p3 p0)), (X (NOT p2)), (X (AND p1 p0 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X p3), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND p1 p3 p0 p2))), (X (NOT (AND p3 p2))), (X (NOT (AND p1 (NOT p3) p2))), (X (NOT (AND (NOT p1) p3 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p3) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p3 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) p0)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) p3 (NOT p0) p2)))), (X (X (NOT (AND (NOT p3) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p3 p0 p2)))), (X (X (NOT (AND p1 (NOT p3) p0 p2)))), true, (X (X (NOT (AND (NOT p3) p2)))), (X (X p1)), (X (X (NOT (AND (NOT p3) p0 p2)))), (X (X (NOT (AND p3 p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p3 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p3 (NOT p0) p2)))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) p0 p2)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p3 p2)))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND p3 (NOT p0) p2)))), (X (X (AND p3 p0))), (X (X (NOT p2))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 p3 p0 p2)))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (AND p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) p3 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 86 factoid took 546 ms. Reduced automaton from 12 states, 63 edges and 4 AP (stutter insensitive) to 12 states, 63 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 455 ms :[true, (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p0)), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p3) p2 (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p3) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 19 resets, run finished after 816 ms. (steps per millisecond=12 ) properties (out of 42) seen :15
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) seen :0
Running SMT prover for 27 properties.
[2024-05-20 22:22:47] [INFO ] Flow matrix only has 40302 transitions (discarded 9702 similar events)
[2024-05-20 22:22:47] [INFO ] Invariant cache hit.
[2024-05-20 22:22:51] [INFO ] [Real]Absence check using 100 positive place invariants in 93 ms returned sat
[2024-05-20 22:22:51] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 183 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-20 22:23:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 22:23:12] [INFO ] After 25030ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 27 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 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 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 10607 transition count 50002
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 10605 transition count 50002
Partial Free-agglomeration rule applied 10101 times.
Drop transitions removed 10101 transitions
Iterating global reduction 1 with 10101 rules applied. Total rules applied 10105 place count 10605 transition count 50002
Partial Free-agglomeration rule applied 200 times.
Drop transitions removed 200 transitions
Iterating global reduction 1 with 200 rules applied. Total rules applied 10305 place count 10605 transition count 50002
Applied a total of 10305 rules in 26110 ms. Remains 10605 /10607 variables (removed 2) and now considering 50002/50004 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26112 ms. Remains : 10605/10607 places, 50002/50004 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 699 ms. (steps per millisecond=14 ) properties (out of 27) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) seen :0
Running SMT prover for 21 properties.
[2024-05-20 22:23:39] [INFO ] Flow matrix only has 50000 transitions (discarded 2 similar events)
// Phase 1: matrix 50000 rows 10605 cols
[2024-05-20 22:23:50] [INFO ] Computed 102 invariants in 11816 ms
[2024-05-20 22:23:54] [INFO ] [Real]Absence check using 100 positive place invariants in 97 ms returned sat
[2024-05-20 22:23:54] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 184 ms returned sat
[2024-05-20 22:24:15] [INFO ] After 20648ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:16
[2024-05-20 22:24:16] [INFO ] State equation strengthened by 49595 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:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-20 22:24:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 22:24:16] [INFO ] After 25424ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 21 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 10605 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10605/10605 places, 50002/50002 transitions.
Applied a total of 0 rules in 7399 ms. Remains 10605 /10605 variables (removed 0) and now considering 50002/50002 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7399 ms. Remains : 10605/10605 places, 50002/50002 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 690 ms. (steps per millisecond=14 ) properties (out of 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) seen :0
Interrupted probabilistic random walk after 88832 steps, run timeout after 3003 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 88832 steps, saw 86893 distinct states, run finished after 3003 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 21 properties.
[2024-05-20 22:24:27] [INFO ] Flow matrix only has 50000 transitions (discarded 2 similar events)
[2024-05-20 22:24:27] [INFO ] Invariant cache hit.
[2024-05-20 22:24:31] [INFO ] [Real]Absence check using 100 positive place invariants in 96 ms returned sat
[2024-05-20 22:24:31] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 182 ms returned sat
[2024-05-20 22:24:52] [INFO ] After 20696ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:16
[2024-05-20 22:24:52] [INFO ] State equation strengthened by 49595 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:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-20 22:24:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 22:24:52] [INFO ] After 25419ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 21 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 10605 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10605/10605 places, 50002/50002 transitions.
Applied a total of 0 rules in 7023 ms. Remains 10605 /10605 variables (removed 0) and now considering 50002/50002 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7023 ms. Remains : 10605/10605 places, 50002/50002 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10605/10605 places, 50002/50002 transitions.
Applied a total of 0 rules in 7202 ms. Remains 10605 /10605 variables (removed 0) and now considering 50002/50002 (removed 0) transitions.
[2024-05-20 22:25:07] [INFO ] Flow matrix only has 50000 transitions (discarded 2 similar events)
[2024-05-20 22:25:07] [INFO ] Invariant cache hit.
[2024-05-20 22:25:08] [INFO ] Implicit Places using invariants in 902 ms returned []
Implicit Place search using SMT only with invariants took 903 ms to find 0 implicit places.
[2024-05-20 22:25:08] [INFO ] Flow matrix only has 50000 transitions (discarded 2 similar events)
[2024-05-20 22:25:08] [INFO ] Invariant cache hit.
[2024-05-20 22:25:08] [INFO ] Dead Transitions using invariants and state equation in 888 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9000 ms. Remains : 10605/10605 places, 50002/50002 transitions.
Knowledge obtained : [(AND p3 (NOT p2) p0 p1), (X (NOT (AND p1 (NOT p3) (NOT p0) p2))), (X (NOT (AND (NOT p1) p3 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) p0))), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p1) p3 (NOT p0) p2))), (X (NOT (AND (NOT p3) (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p3 p0 p2))), (X (NOT (AND p1 (NOT p3) p0 p2))), (X (NOT (AND (NOT p3) p2))), (X p1), (X (NOT (AND (NOT p3) p0 p2))), (X (NOT (AND p3 p0 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p3 p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 p3 (NOT p0) p2))), (X (AND p0 (NOT p2))), (X p0), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0) p2))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p1) (NOT p3) p0 p2))), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p3 p2))), (X (NOT (AND (NOT p3) p0))), (X (NOT (AND p3 (NOT p0) p2))), (X (AND p3 p0)), (X (NOT p2)), (X (AND p1 p0 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X p3), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND p1 p3 p0 p2))), (X (NOT (AND p3 p2))), (X (NOT (AND p1 (NOT p3) p2))), (X (NOT (AND (NOT p1) p3 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p3) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p3 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) p0)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) p3 (NOT p0) p2)))), (X (X (NOT (AND (NOT p3) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p3 p0 p2)))), (X (X (NOT (AND p1 (NOT p3) p0 p2)))), true, (X (X (NOT (AND (NOT p3) p2)))), (X (X p1)), (X (X (NOT (AND (NOT p3) p0 p2)))), (X (X (NOT (AND p3 p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p3 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p3 (NOT p0) p2)))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) p0 p2)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p3 p2)))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND p3 (NOT p0) p2)))), (X (X (AND p3 p0))), (X (X (NOT p2))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 p3 p0 p2)))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (AND p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) p3 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND p0 p2 (NOT p3))), (F (NOT (AND p0 (NOT p2)))), (F (AND p0 p2 p3)), (F (AND p1 p2 p3)), (F (AND (NOT p1) p3)), (F (AND p0 p1 p2 (NOT p3))), (F (AND p1 p2 (NOT p3))), (F p2), (F (NOT (AND p1 (NOT p2)))), (F (AND p0 (NOT p1))), (F (AND (NOT p1) (NOT p2))), (F (NOT p3)), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p2 p3)), (F (AND p0 p1 p2 p3)), (F (AND p2 (NOT p3))), (F (NOT p1)), (F (NOT (AND p0 p1 (NOT p2)))), (F (NOT (AND p0 p3))), (F (AND p0 (NOT p3))), (F (AND p0 (NOT p1) p3))]
Knowledge based reduction with 86 factoid took 2858 ms. Reduced automaton from 12 states, 63 edges and 4 AP (stutter insensitive) to 12 states, 63 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 544 ms :[true, (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p0)), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p3) p2 (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p3) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 488 ms :[true, (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p0)), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p3) p2 (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p3) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 451 ms :[true, (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p0)), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p3) p2 (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p3) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 196 reset in 3729 ms.
Product exploration explored 100000 steps with 198 reset in 3746 ms.
Built C files in :
/tmp/ltsmin14820401706861113410
[2024-05-20 22:25:20] [INFO ] Too many transitions (50004) to apply POR reductions. Disabling POR matrices.
[2024-05-20 22:25:21] [INFO ] Built C files in 259ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14820401706861113410
Running compilation step : cd /tmp/ltsmin14820401706861113410;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14820401706861113410;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14820401706861113410;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 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 5588 ms. Remains 10607 /10607 variables (removed 0) and now considering 50004/50004 (removed 0) transitions.
[2024-05-20 22:25:29] [INFO ] Flow matrix only has 40302 transitions (discarded 9702 similar events)
// Phase 1: matrix 40302 rows 10607 cols
[2024-05-20 22:25:40] [INFO ] Computed 102 invariants in 10510 ms
[2024-05-20 22:25:41] [INFO ] Implicit Places using invariants in 11344 ms returned []
Implicit Place search using SMT only with invariants took 11345 ms to find 0 implicit places.
[2024-05-20 22:25:41] [INFO ] Flow matrix only has 40302 transitions (discarded 9702 similar events)
[2024-05-20 22:25:41] [INFO ] Invariant cache hit.
[2024-05-20 22:25:41] [INFO ] Dead Transitions using invariants and state equation in 883 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17818 ms. Remains : 10607/10607 places, 50004/50004 transitions.
Built C files in :
/tmp/ltsmin17343304087182322647
[2024-05-20 22:25:42] [INFO ] Too many transitions (50004) to apply POR reductions. Disabling POR matrices.
[2024-05-20 22:25:42] [INFO ] Built C files in 265ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17343304087182322647
Running compilation step : cd /tmp/ltsmin17343304087182322647;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17343304087182322647;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17343304087182322647;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-20 22:25:46] [INFO ] Flatten gal took : 760 ms
[2024-05-20 22:25:47] [INFO ] Flatten gal took : 800 ms
[2024-05-20 22:25:47] [INFO ] Time to serialize gal into /tmp/LTL2511578128799395171.gal : 146 ms
[2024-05-20 22:25:47] [INFO ] Time to serialize properties into /tmp/LTL17719188103145609230.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2511578128799395171.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11628493152313527996.hoa' '-atoms' '/tmp/LTL17719188103145609230.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17719188103145609230.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11628493152313527996.hoa
Detected timeout of ITS tools.
[2024-05-20 22:26:04] [INFO ] Flatten gal took : 764 ms
[2024-05-20 22:26:05] [INFO ] Flatten gal took : 805 ms
[2024-05-20 22:26:05] [INFO ] Time to serialize gal into /tmp/LTL16582085010505298837.gal : 167 ms
[2024-05-20 22:26:05] [INFO ] Time to serialize properties into /tmp/LTL7499976912609543117.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16582085010505298837.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7499976912609543117.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G("(Node26requestsent96<1)"))||((X("(Node26requestsent96<1)"))&&(("(Node57requestsent37<1)")U((G("(Node57requestsent37<1)"))||(("(...264
Formula 0 simplified : F!"(Node26requestsent96<1)" & (X!"(Node26requestsent96<1)" | (F("((Node64IsInserted>=1)&&(Node87Request>=1))" & F!"(Node59ID2<1)") U...184
Detected timeout of ITS tools.
[2024-05-20 22:26:21] [INFO ] Flatten gal took : 760 ms
[2024-05-20 22:26:21] [INFO ] Applying decomposition
[2024-05-20 22:26:21] [INFO ] Flatten gal took : 796 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2673898982577701046.txt' '-o' '/tmp/graph2673898982577701046.bin' '-w' '/tmp/graph2673898982577701046.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2673898982577701046.bin' '-l' '-1' '-v' '-w' '/tmp/graph2673898982577701046.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:26:23] [INFO ] Decomposing Gal with order
[2024-05-20 22:26:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:26:31] [INFO ] Removed a total of 39743 redundant transitions.
[2024-05-20 22:26:32] [INFO ] Flatten gal took : 6798 ms
[2024-05-20 22:26:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 30096 labels/synchronizations in 14922 ms.
[2024-05-20 22:26:47] [INFO ] Time to serialize gal into /tmp/LTL10831405263830642257.gal : 156 ms
[2024-05-20 22:26:47] [INFO ] Time to serialize properties into /tmp/LTL1801717739339744902.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10831405263830642257.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1801717739339744902.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G("(u27.Node26requestsent96<1)"))||((X("(u27.Node26requestsent96<1)"))&&(("(u58.Node57requestsent37<1)")U((G("(u58.Node57requestse...304
Formula 0 simplified : F!"(u27.Node26requestsent96<1)" & (X!"(u27.Node26requestsent96<1)" | (F("((u66.Node64IsInserted>=1)&&(i88.u90.Node87Request>=1))" & ...216
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14633182361784104040
[2024-05-20 22:27:02] [INFO ] Built C files in 260ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14633182361784104040
Running compilation step : cd /tmp/ltsmin14633182361784104040;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14633182361784104040;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14633182361784104040;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-100-LTLFireability-10 finished in 446929 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U p1))&&F(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 6089 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
// Phase 1: matrix 60600 rows 21203 cols
[2024-05-20 22:27:32] [INFO ] Computed 102 invariants in 20598 ms
[2024-05-20 22:27:34] [INFO ] Implicit Places using invariants in 22217 ms returned []
Implicit Place search using SMT only with invariants took 22218 ms to find 0 implicit places.
[2024-05-20 22:27:34] [INFO ] Invariant cache hit.
[2024-05-20 22:27:35] [INFO ] Dead Transitions using invariants and state equation in 1647 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29957 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), true]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s20654 1), p1:(GEQ s17254 1), p0:(AND (GEQ s20654 1) (GEQ s13821 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2602 steps with 0 reset in 73 ms.
FORMULA CANInsertWithFailure-PT-100-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-100-LTLFireability-11 finished in 30278 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((p1||(!p0&&X(!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 6025 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
[2024-05-20 22:27:42] [INFO ] Invariant cache hit.
[2024-05-20 22:27:43] [INFO ] Implicit Places using invariants in 1658 ms returned []
Implicit Place search using SMT only with invariants took 1659 ms to find 0 implicit places.
[2024-05-20 22:27:44] [INFO ] Invariant cache hit.
[2024-05-20 22:27:45] [INFO ] Dead Transitions using invariants and state equation in 1670 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9357 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, false, (AND p0 (NOT p1)), p0]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LT s6554 1), p1:(LT s9126 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 41 reset in 3257 ms.
Product exploration explored 100000 steps with 40 reset in 2830 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 p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 103 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[true, false, (AND p0 (NOT p1)), p0]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 528 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 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 111878 steps, run timeout after 3002 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 111878 steps, saw 110335 distinct states, run finished after 3002 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-20 22:27:56] [INFO ] Invariant cache hit.
[2024-05-20 22:27:59] [INFO ] [Real]Absence check using 100 positive place invariants in 188 ms returned sat
[2024-05-20 22:28:00] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 517 ms returned sat
[2024-05-20 22:28:21] [INFO ] After 20518ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2024-05-20 22:28:21] [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:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-20 22:28:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 22:28:21] [INFO ] After 25201ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 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 9898 Post agglomeration using F-continuation condition.Transition count delta: 9898
Deduced a syphon composed of 9898 places in 20 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
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21197 place count 10605 transition count 50001
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21198 place count 10604 transition count 50001
Partial Free-agglomeration rule applied 10101 times.
Drop transitions removed 10101 transitions
Iterating global reduction 3 with 10101 rules applied. Total rules applied 31299 place count 10604 transition count 50001
Applied a total of 31299 rules in 31053 ms. Remains 10604 /21203 variables (removed 10599) and now considering 50001/60600 (removed 10599) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31054 ms. Remains : 10604/21203 places, 50001/60600 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 526 ms. (steps per millisecond=19 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 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 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 90807 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 90807 steps, saw 88827 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 50001 rows 10604 cols
[2024-05-20 22:29:05] [INFO ] Computed 102 invariants in 9330 ms
[2024-05-20 22:29:07] [INFO ] [Real]Absence check using 100 positive place invariants in 99 ms returned sat
[2024-05-20 22:29:07] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 191 ms returned sat
[2024-05-20 22:29:30] [INFO ] After 25017ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 22:29:31] [INFO ] [Nat]Absence check using 100 positive place invariants in 100 ms returned sat
[2024-05-20 22:29:32] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 190 ms returned sat
[2024-05-20 22:29:55] [INFO ] After 25019ms 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 2 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 7081 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 7081 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 7009 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
[2024-05-20 22:30:09] [INFO ] Invariant cache hit.
[2024-05-20 22:30:10] [INFO ] Implicit Places using invariants in 890 ms returned []
Implicit Place search using SMT only with invariants took 891 ms to find 0 implicit places.
[2024-05-20 22:30:10] [INFO ] Invariant cache hit.
[2024-05-20 22:30:11] [INFO ] Dead Transitions using invariants and state equation in 884 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8793 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 101 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[true, false, (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 114 ms :[true, false, (AND p0 (NOT p1)), 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 5716 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
// Phase 1: matrix 60600 rows 21203 cols
[2024-05-20 22:30:39] [INFO ] Computed 102 invariants in 22216 ms
[2024-05-20 22:30:41] [INFO ] Implicit Places using invariants in 23855 ms returned []
Implicit Place search using SMT only with invariants took 23856 ms to find 0 implicit places.
[2024-05-20 22:30:41] [INFO ] Invariant cache hit.
[2024-05-20 22:30:42] [INFO ] Dead Transitions using invariants and state equation in 1671 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31248 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 p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 124 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[true, false, (AND p0 (NOT p1)), p0]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 435 ms. (steps per millisecond=22 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 98825 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 98825 steps, saw 97493 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-20 22:30:47] [INFO ] Invariant cache hit.
[2024-05-20 22:30:50] [INFO ] [Real]Absence check using 100 positive place invariants in 199 ms returned sat
[2024-05-20 22:30:51] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 519 ms returned sat
[2024-05-20 22:31:12] [INFO ] After 20227ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2024-05-20 22:31:12] [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:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-20 22:31:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 22:31:12] [INFO ] After 25286ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 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 9898 Post agglomeration using F-continuation condition.Transition count delta: 9898
Deduced a syphon composed of 9898 places in 23 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
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21197 place count 10605 transition count 50001
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21198 place count 10604 transition count 50001
Partial Free-agglomeration rule applied 10101 times.
Drop transitions removed 10101 transitions
Iterating global reduction 3 with 10101 rules applied. Total rules applied 31299 place count 10604 transition count 50001
Applied a total of 31299 rules in 31727 ms. Remains 10604 /21203 variables (removed 10599) and now considering 50001/60600 (removed 10599) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31728 ms. Remains : 10604/21203 places, 50001/60600 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 572 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 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 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
Interrupted probabilistic random walk after 92150 steps, run timeout after 3002 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 92150 steps, saw 90153 distinct states, run finished after 3002 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 50001 rows 10604 cols
[2024-05-20 22:31:57] [INFO ] Computed 102 invariants in 9942 ms
[2024-05-20 22:31:59] [INFO ] [Real]Absence check using 100 positive place invariants in 92 ms returned sat
[2024-05-20 22:31:59] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 182 ms returned sat
[2024-05-20 22:32:22] [INFO ] After 25012ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 22:32:24] [INFO ] [Nat]Absence check using 100 positive place invariants in 94 ms returned sat
[2024-05-20 22:32:24] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 181 ms returned sat
[2024-05-20 22:32:47] [INFO ] After 22666ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-20 22:32:48] [INFO ] State equation strengthened by 49696 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:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-20 22:32:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 22:32:48] [INFO ] After 25592ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 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 7259 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 7260 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 7335 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
[2024-05-20 22:33:03] [INFO ] Invariant cache hit.
[2024-05-20 22:33:03] [INFO ] Implicit Places using invariants in 890 ms returned []
Implicit Place search using SMT only with invariants took 891 ms to find 0 implicit places.
[2024-05-20 22:33:03] [INFO ] Invariant cache hit.
[2024-05-20 22:33:04] [INFO ] Dead Transitions using invariants and state equation in 872 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9107 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 119 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, false, (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 121 ms :[true, false, (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 116 ms :[true, false, (AND p0 (NOT p1)), p0]
Product exploration explored 100000 steps with 41 reset in 3586 ms.
Product exploration explored 100000 steps with 40 reset in 3173 ms.
Built C files in :
/tmp/ltsmin14635394661597782623
[2024-05-20 22:33:12] [INFO ] Built C files in 333ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14635394661597782623
Running compilation step : cd /tmp/ltsmin14635394661597782623;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14635394661597782623;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14635394661597782623;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
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 5089 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
// Phase 1: matrix 60600 rows 21203 cols
[2024-05-20 22:33:41] [INFO ] Computed 102 invariants in 21054 ms
[2024-05-20 22:33:43] [INFO ] Implicit Places using invariants in 22686 ms returned []
Implicit Place search using SMT only with invariants took 22687 ms to find 0 implicit places.
[2024-05-20 22:33:43] [INFO ] Invariant cache hit.
[2024-05-20 22:33:44] [INFO ] Dead Transitions using invariants and state equation in 1628 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29412 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Built C files in :
/tmp/ltsmin10875978285537985687
[2024-05-20 22:33:45] [INFO ] Built C files in 321ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10875978285537985687
Running compilation step : cd /tmp/ltsmin10875978285537985687;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10875978285537985687;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10875978285537985687;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-20 22:33:50] [INFO ] Flatten gal took : 1100 ms
[2024-05-20 22:33:51] [INFO ] Flatten gal took : 994 ms
[2024-05-20 22:33:51] [INFO ] Time to serialize gal into /tmp/LTL15924715283942420920.gal : 162 ms
[2024-05-20 22:33:51] [INFO ] Time to serialize properties into /tmp/LTL5356153391016366335.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15924715283942420920.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15124340682650262387.hoa' '-atoms' '/tmp/LTL5356153391016366335.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL5356153391016366335.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15124340682650262387.hoa
Detected timeout of ITS tools.
[2024-05-20 22:34:08] [INFO ] Flatten gal took : 1105 ms
[2024-05-20 22:34:09] [INFO ] Flatten gal took : 1058 ms
[2024-05-20 22:34:09] [INFO ] Time to serialize gal into /tmp/LTL8023980725143078082.gal : 150 ms
[2024-05-20 22:34:09] [INFO ] Time to serialize properties into /tmp/LTL12162918110473321271.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8023980725143078082.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12162918110473321271.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(("(Node26GiveAnswer1<1)")||(X(("(Node39GiveAnswer0<1)")||(("(Node26GiveAnswer1>=1)")&&(X("(Node26GiveAnswer1>=1)"))))))))
Formula 0 simplified : F(!"(Node26GiveAnswer1<1)" & X(!"(Node39GiveAnswer0<1)" & (!"(Node26GiveAnswer1>=1)" | X!"(Node26GiveAnswer1>=1)")))
Detected timeout of ITS tools.
[2024-05-20 22:34:25] [INFO ] Flatten gal took : 1006 ms
[2024-05-20 22:34:25] [INFO ] Applying decomposition
[2024-05-20 22:34:26] [INFO ] Flatten gal took : 1096 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13850309617835060368.txt' '-o' '/tmp/graph13850309617835060368.bin' '-w' '/tmp/graph13850309617835060368.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13850309617835060368.bin' '-l' '-1' '-v' '-w' '/tmp/graph13850309617835060368.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:34:28] [INFO ] Decomposing Gal with order
[2024-05-20 22:34:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:34:37] [INFO ] Removed a total of 30054 redundant transitions.
[2024-05-20 22:34:37] [INFO ] Flatten gal took : 4223 ms
[2024-05-20 22:34:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 39906 labels/synchronizations in 6903 ms.
[2024-05-20 22:34:45] [INFO ] Time to serialize gal into /tmp/LTL6956712896015824752.gal : 274 ms
[2024-05-20 22:34:45] [INFO ] Time to serialize properties into /tmp/LTL13350962355701901670.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6956712896015824752.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13350962355701901670.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(("(i2.u7.Node26GiveAnswer1<1)")||(X(("(i1.u2.Node39GiveAnswer0<1)")||(("(i2.u7.Node26GiveAnswer1>=1)")&&(X("(i2.u7.Node26GiveAnsw...171
Formula 0 simplified : F(!"(i2.u7.Node26GiveAnswer1<1)" & X(!"(i1.u2.Node39GiveAnswer0<1)" & (!"(i2.u7.Node26GiveAnswer1>=1)" | X!"(i2.u7.Node26GiveAnswer1...163
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8105404289003826173
[2024-05-20 22:35:00] [INFO ] Built C files in 354ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8105404289003826173
Running compilation step : cd /tmp/ltsmin8105404289003826173;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8105404289003826173;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8105404289003826173;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-100-LTLFireability-12 finished in 447565 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(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 31 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 17917 ms. Remains 10604 /21203 variables (removed 10599) and now considering 50001/60600 (removed 10599) transitions.
[2024-05-20 22:35:21] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
// Phase 1: matrix 40300 rows 10604 cols
[2024-05-20 22:35:32] [INFO ] Computed 102 invariants in 10626 ms
[2024-05-20 22:35:33] [INFO ] Implicit Places using invariants in 11532 ms returned []
Implicit Place search using SMT only with invariants took 11534 ms to find 0 implicit places.
[2024-05-20 22:35:33] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
[2024-05-20 22:35:33] [INFO ] Invariant cache hit.
[2024-05-20 22:35:34] [INFO ] Dead Transitions using invariants and state equation in 1008 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 30463 ms. Remains : 10604/21203 places, 50001/60600 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s6466 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 523 steps with 0 reset in 20 ms.
FORMULA CANInsertWithFailure-PT-100-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-100-LTLFireability-13 finished in 30590 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||G(p1)))&&X(X(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 5503 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
// Phase 1: matrix 60600 rows 21203 cols
[2024-05-20 22:36:03] [INFO ] Computed 102 invariants in 23746 ms
[2024-05-20 22:36:05] [INFO ] Implicit Places using invariants in 25387 ms returned []
Implicit Place search using SMT only with invariants took 25388 ms to find 0 implicit places.
[2024-05-20 22:36:05] [INFO ] Invariant cache hit.
[2024-05-20 22:36:07] [INFO ] Dead Transitions using invariants and state equation in 1847 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32745 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2), (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(OR p0 p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LT s7960 1), p1:(LT s1984 1), p2:(OR (LT s1197 1) (LT s18997 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 69 reset in 2828 ms.
Product exploration explored 100000 steps with 81 reset in 2919 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 p0 p1 p2), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1))), true, (X (X p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 112 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 464 ms. (steps per millisecond=21 ) properties (out of 4) 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 4) 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 4) 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 4) 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 4) seen :0
Interrupted probabilistic random walk after 100665 steps, run timeout after 3002 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 100665 steps, saw 99300 distinct states, run finished after 3003 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-20 22:36:17] [INFO ] Invariant cache hit.
[2024-05-20 22:36:20] [INFO ] [Real]Absence check using 100 positive place invariants in 193 ms returned sat
[2024-05-20 22:36:21] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 522 ms returned sat
[2024-05-20 22:36:42] [INFO ] After 20440ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2024-05-20 22:36:42] [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:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-20 22:36:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 22:36:42] [INFO ] After 25216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 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 9898 Post agglomeration using F-continuation condition.Transition count delta: 9898
Deduced a syphon composed of 9898 places in 22 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
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21197 place count 10605 transition count 50001
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21198 place count 10604 transition count 50001
Partial Free-agglomeration rule applied 10101 times.
Drop transitions removed 10101 transitions
Iterating global reduction 3 with 10101 rules applied. Total rules applied 31299 place count 10604 transition count 50001
Applied a total of 31299 rules in 31104 ms. Remains 10604 /21203 variables (removed 10599) and now considering 50001/60600 (removed 10599) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31105 ms. Remains : 10604/21203 places, 50001/60600 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 522 ms. (steps per millisecond=19 ) properties (out of 4) 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 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) 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 4) seen :0
Interrupted probabilistic random walk after 94170 steps, run timeout after 3002 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 94170 steps, saw 92133 distinct states, run finished after 3002 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 50001 rows 10604 cols
[2024-05-20 22:37:27] [INFO ] Computed 102 invariants in 9959 ms
[2024-05-20 22:37:28] [INFO ] [Real]Absence check using 100 positive place invariants in 93 ms returned sat
[2024-05-20 22:37:28] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 183 ms returned sat
[2024-05-20 22:37:52] [INFO ] After 23019ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2024-05-20 22:37:52] [INFO ] State equation strengthened by 49696 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:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-20 22:37:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 22:37:52] [INFO ] After 25420ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 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 6964 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 6965 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 6847 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
[2024-05-20 22:38:06] [INFO ] Invariant cache hit.
[2024-05-20 22:38:07] [INFO ] Implicit Places using invariants in 872 ms returned []
Implicit Place search using SMT only with invariants took 873 ms to find 0 implicit places.
[2024-05-20 22:38:07] [INFO ] Invariant cache hit.
[2024-05-20 22:38:08] [INFO ] Dead Transitions using invariants and state equation in 924 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8650 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1))), true, (X (X p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 114 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 21203 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 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 9898 Post agglomeration using F-continuation condition.Transition count delta: 9898
Deduced a syphon composed of 9898 places in 20 ms
Reduce places removed 9898 places and 0 transitions.
Iterating global reduction 2 with 19796 rules applied. Total rules applied 21194 place count 10606 transition count 50003
Applied a total of 21194 rules in 17172 ms. Remains 10606 /21203 variables (removed 10597) and now considering 50003/60600 (removed 10597) transitions.
[2024-05-20 22:38:25] [INFO ] Flow matrix only has 40303 transitions (discarded 9700 similar events)
// Phase 1: matrix 40303 rows 10606 cols
[2024-05-20 22:38:35] [INFO ] Computed 102 invariants in 9949 ms
[2024-05-20 22:38:36] [INFO ] Implicit Places using invariants in 10958 ms returned []
Implicit Place search using SMT only with invariants took 10958 ms to find 0 implicit places.
[2024-05-20 22:38:36] [INFO ] Flow matrix only has 40303 transitions (discarded 9700 similar events)
[2024-05-20 22:38:36] [INFO ] Invariant cache hit.
[2024-05-20 22:38:37] [INFO ] Dead Transitions using invariants and state equation in 904 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10606/21203 places, 50003/60600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 29045 ms. Remains : 10606/21203 places, 50003/60600 transitions.
Computed a total of 304 stabilizing places and 501 stable transitions
Computed a total of 304 stabilizing places and 501 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 106 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 20 resets, run finished after 472 ms. (steps per millisecond=21 ) properties (out of 4) 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 4) 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 4) 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 4) 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 4) seen :0
Interrupted probabilistic random walk after 67564 steps, run timeout after 3002 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 67564 steps, saw 64787 distinct states, run finished after 3002 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-20 22:38:41] [INFO ] Flow matrix only has 40303 transitions (discarded 9700 similar events)
[2024-05-20 22:38:41] [INFO ] Invariant cache hit.
[2024-05-20 22:38:43] [INFO ] [Real]Absence check using 100 positive place invariants in 98 ms returned sat
[2024-05-20 22:38:43] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 188 ms returned sat
[2024-05-20 22:39:06] [INFO ] After 23095ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-20 22:39:06] [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:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-20 22:39:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 22:39:06] [INFO ] After 25272ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 10606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10606/10606 places, 50003/50003 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 1 rules applied. Total rules applied 1 place count 10606 transition count 50002
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 10605 transition count 50002
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 10605 transition count 50001
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 10604 transition count 50001
Partial Free-agglomeration rule applied 10101 times.
Drop transitions removed 10101 transitions
Iterating global reduction 3 with 10101 rules applied. Total rules applied 10105 place count 10604 transition count 50001
Applied a total of 10105 rules in 18778 ms. Remains 10604 /10606 variables (removed 2) and now considering 50001/50003 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18781 ms. Remains : 10604/10606 places, 50001/50003 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 587 ms. (steps per millisecond=17 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) 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 4) seen :0
Interrupted probabilistic random walk after 94712 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 94712 steps, saw 92583 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 50001 rows 10604 cols
[2024-05-20 22:39:39] [INFO ] Computed 102 invariants in 9877 ms
[2024-05-20 22:39:40] [INFO ] [Real]Absence check using 100 positive place invariants in 97 ms returned sat
[2024-05-20 22:39:41] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 185 ms returned sat
[2024-05-20 22:40:04] [INFO ] After 22990ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-20 22:40:04] [INFO ] State equation strengthened by 49696 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:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-20 22:40:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 22:40:04] [INFO ] After 25417ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 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 7134 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 7134 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 7283 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
[2024-05-20 22:40:19] [INFO ] Invariant cache hit.
[2024-05-20 22:40:20] [INFO ] Implicit Places using invariants in 912 ms returned []
Implicit Place search using SMT only with invariants took 913 ms to find 0 implicit places.
[2024-05-20 22:40:20] [INFO ] Invariant cache hit.
[2024-05-20 22:40:21] [INFO ] Dead Transitions using invariants and state equation in 904 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9110 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 112 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 189 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 198 reset in 3855 ms.
Product exploration explored 100000 steps with 197 reset in 3722 ms.
Built C files in :
/tmp/ltsmin10121361368594732550
[2024-05-20 22:40:29] [INFO ] Too many transitions (50003) to apply POR reductions. Disabling POR matrices.
[2024-05-20 22:40:29] [INFO ] Built C files in 265ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10121361368594732550
Running compilation step : cd /tmp/ltsmin10121361368594732550;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10121361368594732550;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10121361368594732550;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 10606 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10606/10606 places, 50003/50003 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 1 rules applied. Total rules applied 1 place count 10606 transition count 50002
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 10605 transition count 50002
Applied a total of 2 rules in 5586 ms. Remains 10605 /10606 variables (removed 1) and now considering 50002/50003 (removed 1) transitions.
[2024-05-20 22:40:38] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
// Phase 1: matrix 40302 rows 10605 cols
[2024-05-20 22:40:49] [INFO ] Computed 102 invariants in 11171 ms
[2024-05-20 22:40:50] [INFO ] Implicit Places using invariants in 12076 ms returned []
Implicit Place search using SMT only with invariants took 12077 ms to find 0 implicit places.
[2024-05-20 22:40:50] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2024-05-20 22:40:50] [INFO ] Invariant cache hit.
[2024-05-20 22:40:51] [INFO ] Dead Transitions using invariants and state equation in 910 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10605/10606 places, 50002/50003 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18577 ms. Remains : 10605/10606 places, 50002/50003 transitions.
Built C files in :
/tmp/ltsmin13280513770669785310
[2024-05-20 22:40:51] [INFO ] Too many transitions (50002) to apply POR reductions. Disabling POR matrices.
[2024-05-20 22:40:51] [INFO ] Built C files in 270ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13280513770669785310
Running compilation step : cd /tmp/ltsmin13280513770669785310;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13280513770669785310;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13280513770669785310;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-20 22:40:55] [INFO ] Flatten gal took : 895 ms
[2024-05-20 22:40:56] [INFO ] Flatten gal took : 744 ms
[2024-05-20 22:40:56] [INFO ] Time to serialize gal into /tmp/LTL14123493881992187068.gal : 148 ms
[2024-05-20 22:40:56] [INFO ] Time to serialize properties into /tmp/LTL13290318563453150354.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14123493881992187068.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6114756851681684906.hoa' '-atoms' '/tmp/LTL13290318563453150354.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13290318563453150354.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6114756851681684906.hoa
Detected timeout of ITS tools.
[2024-05-20 22:41:13] [INFO ] Flatten gal took : 834 ms
[2024-05-20 22:41:14] [INFO ] Flatten gal took : 861 ms
[2024-05-20 22:41:14] [INFO ] Time to serialize gal into /tmp/LTL10951061487259528527.gal : 131 ms
[2024-05-20 22:41:14] [INFO ] Time to serialize properties into /tmp/LTL3930891988783028888.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10951061487259528527.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3930891988783028888.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G(("(Node33GiveAnswer11<1)")||(G("(Node2GiveAnswer93<1)"))))&&(X(X(F("((Node85IsInserted<1)||(Node88requestsent85<1))"))))))
Formula 0 simplified : F(!"(Node33GiveAnswer11<1)" & F!"(Node2GiveAnswer93<1)") | XXG!"((Node85IsInserted<1)||(Node88requestsent85<1))"
Detected timeout of ITS tools.
[2024-05-20 22:41:30] [INFO ] Flatten gal took : 758 ms
[2024-05-20 22:41:30] [INFO ] Applying decomposition
[2024-05-20 22:41:30] [INFO ] Flatten gal took : 789 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13244960908494645569.txt' '-o' '/tmp/graph13244960908494645569.bin' '-w' '/tmp/graph13244960908494645569.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13244960908494645569.bin' '-l' '-1' '-v' '-w' '/tmp/graph13244960908494645569.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:41:32] [INFO ] Decomposing Gal with order
[2024-05-20 22:41:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:41:40] [INFO ] Removed a total of 39756 redundant transitions.
[2024-05-20 22:41:41] [INFO ] Flatten gal took : 6814 ms
[2024-05-20 22:41:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 29501 labels/synchronizations in 15026 ms.
[2024-05-20 22:41:57] [INFO ] Time to serialize gal into /tmp/LTL12427732872237201667.gal : 159 ms
[2024-05-20 22:41:57] [INFO ] Time to serialize properties into /tmp/LTL12394709710685140861.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12427732872237201667.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12394709710685140861.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((G(("(u12.Node33GiveAnswer11<1)")||(G("(u94.Node2GiveAnswer93<1)"))))&&(X(X(F("((u86.Node85IsInserted<1)||(u89.Node88requestsent85<...165
Formula 0 simplified : F(!"(u12.Node33GiveAnswer11<1)" & F!"(u94.Node2GiveAnswer93<1)") | XXG!"((u86.Node85IsInserted<1)||(u89.Node88requestsent85<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16816442242321713839
[2024-05-20 22:42:12] [INFO ] Built C files in 253ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16816442242321713839
Running compilation step : cd /tmp/ltsmin16816442242321713839;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16816442242321713839;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16816442242321713839;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-100-LTLFireability-15 finished in 400946 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((X(F(p1))||p0))))))'
Found a Lengthening insensitive property : CANInsertWithFailure-PT-100-LTLFireability-02
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 5 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 698 transitions
Trivial Post-agglo rules discarded 698 transitions
Performed 698 trivial Post agglomeration. Transition count delta: 698
Iterating post reduction 0 with 698 rules applied. Total rules applied 698 place count 21203 transition count 59902
Reduce places removed 698 places and 0 transitions.
Iterating post reduction 1 with 698 rules applied. Total rules applied 1396 place count 20505 transition count 59902
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 21196 place count 10605 transition count 50002
Applied a total of 21196 rules in 18966 ms. Remains 10605 /21203 variables (removed 10598) and now considering 50002/60600 (removed 10598) transitions.
[2024-05-20 22:42:34] [INFO ] Flow matrix only has 40300 transitions (discarded 9702 similar events)
// Phase 1: matrix 40300 rows 10605 cols
[2024-05-20 22:42:45] [INFO ] Computed 102 invariants in 11165 ms
[2024-05-20 22:42:46] [INFO ] Implicit Places using invariants in 12064 ms returned []
Implicit Place search using SMT only with invariants took 12065 ms to find 0 implicit places.
[2024-05-20 22:42:46] [INFO ] Flow matrix only has 40300 transitions (discarded 9702 similar events)
[2024-05-20 22:42:46] [INFO ] Invariant cache hit.
[2024-05-20 22:42:47] [INFO ] Dead Transitions using invariants and state equation in 877 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 10605/21203 places, 50002/60600 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 31914 ms. Remains : 10605/21203 places, 50002/60600 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s545 1) (LT s3394 1)), p1:(OR (LT s5079 1) (LT s576 1) (LT s4199 1))], 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 198 reset in 3620 ms.
Product exploration explored 100000 steps with 203 reset in 3851 ms.
Computed a total of 305 stabilizing places and 502 stable transitions
Computed a total of 305 stabilizing places and 502 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 19 resets, run finished after 417 ms. (steps per millisecond=23 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 69065 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69065 steps, saw 65039 distinct states, run finished after 3003 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-20 22:42:59] [INFO ] Flow matrix only has 40300 transitions (discarded 9702 similar events)
[2024-05-20 22:42:59] [INFO ] Invariant cache hit.
[2024-05-20 22:43:00] [INFO ] [Real]Absence check using 100 positive place invariants in 95 ms returned sat
[2024-05-20 22:43:00] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 183 ms returned sat
[2024-05-20 22:43:24] [INFO ] After 23355ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 22:43:24] [INFO ] State equation strengthened by 29898 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:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-20 22:43:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 22:43:24] [INFO ] After 25274ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 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 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 10605 transition count 49999
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 10602 transition count 49999
Partial Free-agglomeration rule applied 10098 times.
Drop transitions removed 10098 transitions
Iterating global reduction 1 with 10098 rules applied. Total rules applied 10104 place count 10602 transition count 49999
Applied a total of 10104 rules in 19395 ms. Remains 10602 /10605 variables (removed 3) and now considering 49999/50002 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19397 ms. Remains : 10602/10605 places, 49999/50002 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 549 ms. (steps per millisecond=18 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 94920 steps, run timeout after 3002 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 94920 steps, saw 92628 distinct states, run finished after 3002 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-20 22:43:47] [INFO ] Flow matrix only has 49996 transitions (discarded 3 similar events)
// Phase 1: matrix 49996 rows 10602 cols
[2024-05-20 22:43:57] [INFO ] Computed 102 invariants in 10034 ms
[2024-05-20 22:43:58] [INFO ] [Real]Absence check using 100 positive place invariants in 97 ms returned sat
[2024-05-20 22:43:58] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 180 ms returned sat
[2024-05-20 22:44:22] [INFO ] After 23364ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 22:44:22] [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:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-20 22:44:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 22:44:22] [INFO ] After 25578ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 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 7272 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 7274 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 7190 ms. Remains 10602 /10602 variables (removed 0) and now considering 49999/49999 (removed 0) transitions.
[2024-05-20 22:44:37] [INFO ] Flow matrix only has 49996 transitions (discarded 3 similar events)
[2024-05-20 22:44:37] [INFO ] Invariant cache hit.
[2024-05-20 22:44:38] [INFO ] Implicit Places using invariants in 906 ms returned []
Implicit Place search using SMT only with invariants took 906 ms to find 0 implicit places.
[2024-05-20 22:44:38] [INFO ] Flow matrix only has 49996 transitions (discarded 3 similar events)
[2024-05-20 22:44:38] [INFO ] Invariant cache hit.
[2024-05-20 22:44:39] [INFO ] Dead Transitions using invariants and state equation in 926 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9031 ms. Remains : 10602/10602 places, 49999/49999 transitions.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 5 out of 10605 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10605/10605 places, 50002/50002 transitions.
Applied a total of 0 rules in 5496 ms. Remains 10605 /10605 variables (removed 0) and now considering 50002/50002 (removed 0) transitions.
[2024-05-20 22:44:45] [INFO ] Flow matrix only has 40300 transitions (discarded 9702 similar events)
// Phase 1: matrix 40300 rows 10605 cols
[2024-05-20 22:44:56] [INFO ] Computed 102 invariants in 10715 ms
[2024-05-20 22:44:56] [INFO ] Implicit Places using invariants in 11609 ms returned []
Implicit Place search using SMT only with invariants took 11610 ms to find 0 implicit places.
[2024-05-20 22:44:56] [INFO ] Flow matrix only has 40300 transitions (discarded 9702 similar events)
[2024-05-20 22:44:56] [INFO ] Invariant cache hit.
[2024-05-20 22:44:57] [INFO ] Dead Transitions using invariants and state equation in 876 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17984 ms. Remains : 10605/10605 places, 50002/50002 transitions.
Computed a total of 305 stabilizing places and 502 stable transitions
Computed a total of 305 stabilizing places and 502 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 19 resets, run finished after 476 ms. (steps per millisecond=21 ) properties (out of 2) seen :1
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
Running SMT prover for 1 properties.
[2024-05-20 22:44:58] [INFO ] Flow matrix only has 40300 transitions (discarded 9702 similar events)
[2024-05-20 22:44:58] [INFO ] Invariant cache hit.
[2024-05-20 22:44:59] [INFO ] [Real]Absence check using 100 positive place invariants in 98 ms returned sat
[2024-05-20 22:45:00] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 185 ms returned sat
[2024-05-20 22:45:23] [INFO ] After 25026ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
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.
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 1 rules applied. Total rules applied 1 place count 10605 transition count 50001
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 10604 transition count 50001
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 10604 transition count 49999
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 10602 transition count 49999
Partial Free-agglomeration rule applied 10099 times.
Drop transitions removed 10099 transitions
Iterating global reduction 3 with 10099 rules applied. Total rules applied 10105 place count 10602 transition count 49999
Applied a total of 10105 rules in 19089 ms. Remains 10602 /10605 variables (removed 3) and now considering 49999/50002 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19090 ms. Remains : 10602/10605 places, 49999/50002 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 97589 steps, run timeout after 3002 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97589 steps, saw 93095 distinct states, run finished after 3002 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 22:45:46] [INFO ] Flow matrix only has 49997 transitions (discarded 2 similar events)
// Phase 1: matrix 49997 rows 10602 cols
[2024-05-20 22:45:56] [INFO ] Computed 102 invariants in 10046 ms
[2024-05-20 22:45:57] [INFO ] [Real]Absence check using 100 positive place invariants in 97 ms returned sat
[2024-05-20 22:45:57] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 185 ms returned sat
[2024-05-20 22:46:21] [INFO ] After 25014ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 3 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 7217 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 7217 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 7391 ms. Remains 10602 /10602 variables (removed 0) and now considering 49999/49999 (removed 0) transitions.
[2024-05-20 22:46:36] [INFO ] Flow matrix only has 49997 transitions (discarded 2 similar events)
[2024-05-20 22:46:36] [INFO ] Invariant cache hit.
[2024-05-20 22:46:36] [INFO ] Implicit Places using invariants in 900 ms returned []
Implicit Place search using SMT only with invariants took 900 ms to find 0 implicit places.
[2024-05-20 22:46:36] [INFO ] Flow matrix only has 49997 transitions (discarded 2 similar events)
[2024-05-20 22:46:36] [INFO ] Invariant cache hit.
[2024-05-20 22:46:37] [INFO ] Dead Transitions using invariants and state equation in 889 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9187 ms. Remains : 10602/10602 places, 49999/49999 transitions.
Graph (trivial) has 49390 edges and 10602 vertex of which 10197 / 10602 are part of one of the 2 SCC in 10 ms
Free SCC test removed 10195 places
Drop transitions removed 39493 transitions
Ensure Unique test removed 10094 transitions
Reduce isomorphic transitions removed 49587 transitions.
Graph (complete) has 1014 edges and 407 vertex of which 110 are kept as prefixes of interest. Removing 297 places using SCC suffix rule.1 ms
Discarding 297 places :
Also discarding 98 output transitions
Drop transitions removed 98 transitions
Drop transitions removed 199 transitions
Reduce isomorphic transitions removed 199 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 200 rules applied. Total rules applied 202 place count 110 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 203 place count 109 transition count 114
Discarding 97 places :
Symmetric choice reduction at 2 with 97 rule applications. Total rules 300 place count 12 transition count 17
Iterating global reduction 2 with 97 rules applied. Total rules applied 397 place count 12 transition count 17
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 399 place count 12 transition count 15
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 400 place count 12 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 401 place count 11 transition count 14
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 402 place count 11 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 3 with 2 rules applied. Total rules applied 404 place count 10 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 405 place count 9 transition count 11
Applied a total of 405 rules in 231 ms. Remains 9 /10602 variables (removed 10593) and now considering 11/49999 (removed 49988) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 9 cols
[2024-05-20 22:46:38] [INFO ] Computed 1 invariants in 1 ms
[2024-05-20 22:46:38] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-20 22:46:38] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 22:46:38] [INFO ] After 5ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-20 22:46:38] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 197 reset in 3641 ms.
Product exploration explored 100000 steps with 200 reset in 3641 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 5 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 5330 ms. Remains 10605 /10605 variables (removed 0) and now considering 50002/50002 (removed 0) transitions.
[2024-05-20 22:46:51] [INFO ] Flow matrix only has 40300 transitions (discarded 9702 similar events)
// Phase 1: matrix 40300 rows 10605 cols
[2024-05-20 22:47:02] [INFO ] Computed 102 invariants in 10414 ms
[2024-05-20 22:47:03] [INFO ] Dead Transitions using invariants and state equation in 11328 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16663 ms. Remains : 10605/10605 places, 50002/50002 transitions.
Built C files in :
/tmp/ltsmin8542906640368386454
[2024-05-20 22:47:03] [INFO ] Built C files in 276ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8542906640368386454
Running compilation step : cd /tmp/ltsmin8542906640368386454;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8542906640368386454;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8542906640368386454;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 10605 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10605/10605 places, 50002/50002 transitions.
Applied a total of 0 rules in 5642 ms. Remains 10605 /10605 variables (removed 0) and now considering 50002/50002 (removed 0) transitions.
[2024-05-20 22:47:12] [INFO ] Flow matrix only has 40300 transitions (discarded 9702 similar events)
[2024-05-20 22:47:12] [INFO ] Invariant cache hit.
[2024-05-20 22:47:13] [INFO ] Implicit Places using invariants in 895 ms returned []
Implicit Place search using SMT only with invariants took 896 ms to find 0 implicit places.
[2024-05-20 22:47:13] [INFO ] Flow matrix only has 40300 transitions (discarded 9702 similar events)
[2024-05-20 22:47:13] [INFO ] Invariant cache hit.
[2024-05-20 22:47:13] [INFO ] Dead Transitions using invariants and state equation in 895 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7435 ms. Remains : 10605/10605 places, 50002/50002 transitions.
Built C files in :
/tmp/ltsmin4890917672228973454
[2024-05-20 22:47:14] [INFO ] Built C files in 270ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4890917672228973454
Running compilation step : cd /tmp/ltsmin4890917672228973454;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4890917672228973454;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4890917672228973454;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-20 22:47:18] [INFO ] Flatten gal took : 775 ms
[2024-05-20 22:47:19] [INFO ] Flatten gal took : 830 ms
[2024-05-20 22:47:19] [INFO ] Time to serialize gal into /tmp/LTL3322777920119873360.gal : 151 ms
[2024-05-20 22:47:19] [INFO ] Time to serialize properties into /tmp/LTL13214569083435995656.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3322777920119873360.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16935243067196704721.hoa' '-atoms' '/tmp/LTL13214569083435995656.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13214569083435995656.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16935243067196704721.hoa
Detected timeout of ITS tools.
[2024-05-20 22:47:36] [INFO ] Flatten gal took : 761 ms
[2024-05-20 22:47:36] [INFO ] Flatten gal took : 814 ms
[2024-05-20 22:47:37] [INFO ] Time to serialize gal into /tmp/LTL6820499284082240780.gal : 154 ms
[2024-05-20 22:47:37] [INFO ] Time to serialize properties into /tmp/LTL132964525967674248.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6820499284082240780.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL132964525967674248.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G(("((Node90IsInserted<1)||(Node27requestsent90<1))")||(X(F("(((Node44requestsent75<1)||(Node95IsInserted<1))||(Node35request...175
Formula 0 simplified : XXXF(!"((Node90IsInserted<1)||(Node27requestsent90<1))" & XG!"(((Node44requestsent75<1)||(Node95IsInserted<1))||(Node35requestsent95...161
Detected timeout of ITS tools.
[2024-05-20 22:47:53] [INFO ] Flatten gal took : 940 ms
[2024-05-20 22:47:53] [INFO ] Applying decomposition
[2024-05-20 22:47:53] [INFO ] Flatten gal took : 792 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11546706207556416190.txt' '-o' '/tmp/graph11546706207556416190.bin' '-w' '/tmp/graph11546706207556416190.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11546706207556416190.bin' '-l' '-1' '-v' '-w' '/tmp/graph11546706207556416190.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:47:55] [INFO ] Decomposing Gal with order
[2024-05-20 22:47:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:48:03] [INFO ] Removed a total of 39740 redundant transitions.
[2024-05-20 22:48:04] [INFO ] Flatten gal took : 6836 ms
[2024-05-20 22:48:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 29503 labels/synchronizations in 15170 ms.
[2024-05-20 22:48:20] [INFO ] Time to serialize gal into /tmp/LTL10530605689367235946.gal : 160 ms
[2024-05-20 22:48:20] [INFO ] Time to serialize properties into /tmp/LTL8534706665912342392.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10530605689367235946.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8534706665912342392.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G(("((u91.Node90IsInserted<1)||(u28.Node27requestsent90<1))")||(X(F("(((u45.Node44requestsent75<1)||(u96.Node95IsInserted<1))...195
Formula 0 simplified : XXXF(!"((u91.Node90IsInserted<1)||(u28.Node27requestsent90<1))" & XG!"(((u45.Node44requestsent75<1)||(u96.Node95IsInserted<1))||(u36...181
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6075126538782462398
[2024-05-20 22:48:35] [INFO ] Built C files in 265ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6075126538782462398
Running compilation step : cd /tmp/ltsmin6075126538782462398;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6075126538782462398;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6075126538782462398;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-100-LTLFireability-02 finished in 383189 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(F(p0)&&X(p1)))))'
Found a Shortening insensitive property : CANInsertWithFailure-PT-100-LTLFireability-05
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 2 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 9898 Post agglomeration using F-continuation condition.Transition count delta: 9898
Deduced a syphon composed of 9898 places in 19 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 17688 ms. Remains 10605 /21203 variables (removed 10598) and now considering 50002/60600 (removed 10598) transitions.
[2024-05-20 22:48:56] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
// Phase 1: matrix 40302 rows 10605 cols
[2024-05-20 22:49:07] [INFO ] Computed 102 invariants in 10521 ms
[2024-05-20 22:49:07] [INFO ] Implicit Places using invariants in 11403 ms returned []
Implicit Place search using SMT only with invariants took 11404 ms to find 0 implicit places.
[2024-05-20 22:49:07] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2024-05-20 22:49:07] [INFO ] Invariant cache hit.
[2024-05-20 22:49:08] [INFO ] Dead Transitions using invariants and state equation in 919 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 10605/21203 places, 50002/60600 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 30014 ms. Remains : 10605/21203 places, 50002/60600 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LT s3161 1), p1:(GEQ s9574 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 200 reset in 3583 ms.
Product exploration explored 100000 steps with 198 reset in 3663 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 p0 (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 100 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 288 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), false, false]
Incomplete random walk after 10000 steps, including 19 resets, run finished after 483 ms. (steps per millisecond=20 ) 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 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 68267 steps, run timeout after 3002 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68267 steps, saw 64912 distinct states, run finished after 3003 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-20 22:49:20] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2024-05-20 22:49:20] [INFO ] Invariant cache hit.
[2024-05-20 22:49:21] [INFO ] [Real]Absence check using 100 positive place invariants in 99 ms returned sat
[2024-05-20 22:49:22] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 187 ms returned sat
[2024-05-20 22:49:45] [INFO ] After 22686ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2024-05-20 22:49:45] [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:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-20 22:49:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 22:49:45] [INFO ] After 25270ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
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 21667 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 21667 ms. Remains : 10604/10605 places, 50001/50002 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 494 ms. (steps per millisecond=20 ) properties (out of 5) seen :4
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
Running SMT prover for 1 properties.
// Phase 1: matrix 50001 rows 10604 cols
[2024-05-20 22:50:17] [INFO ] Computed 102 invariants in 9809 ms
[2024-05-20 22:50:18] [INFO ] [Real]Absence check using 100 positive place invariants in 94 ms returned sat
[2024-05-20 22:50:18] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 181 ms returned sat
[2024-05-20 22:50:42] [INFO ] After 25018ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 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 8794 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 8794 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 423 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 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 97722 steps, run timeout after 3002 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97722 steps, saw 93112 distinct states, run finished after 3002 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 22:50:55] [INFO ] Invariant cache hit.
[2024-05-20 22:50:56] [INFO ] [Real]Absence check using 100 positive place invariants in 92 ms returned sat
[2024-05-20 22:50:56] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 182 ms returned sat
[2024-05-20 22:51:20] [INFO ] After 25015ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 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 8744 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 8744 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 8759 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
[2024-05-20 22:51:37] [INFO ] Invariant cache hit.
[2024-05-20 22:51:38] [INFO ] Implicit Places using invariants in 873 ms returned []
Implicit Place search using SMT only with invariants took 874 ms to find 0 implicit places.
[2024-05-20 22:51:38] [INFO ] Invariant cache hit.
[2024-05-20 22:51:39] [INFO ] Dead Transitions using invariants and state equation in 897 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10538 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 7 factoid took 206 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), false, false]
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 6095 ms. Remains 10605 /10605 variables (removed 0) and now considering 50002/50002 (removed 0) transitions.
[2024-05-20 22:51:46] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
// Phase 1: matrix 40302 rows 10605 cols
[2024-05-20 22:51:56] [INFO ] Computed 102 invariants in 10385 ms
[2024-05-20 22:51:57] [INFO ] Implicit Places using invariants in 11294 ms returned []
Implicit Place search using SMT only with invariants took 11294 ms to find 0 implicit places.
[2024-05-20 22:51:57] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2024-05-20 22:51:57] [INFO ] Invariant cache hit.
[2024-05-20 22:51:58] [INFO ] Dead Transitions using invariants and state equation in 893 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18283 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 p1) p0), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 119 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), false, false]
Incomplete random walk after 10000 steps, including 20 resets, run finished after 481 ms. (steps per millisecond=20 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 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 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 29 ms. (steps per millisecond=344 ) 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 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 68952 steps, run timeout after 3002 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68952 steps, saw 65025 distinct states, run finished after 3002 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-20 22:52:02] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2024-05-20 22:52:02] [INFO ] Invariant cache hit.
[2024-05-20 22:52:03] [INFO ] [Real]Absence check using 100 positive place invariants in 95 ms returned sat
[2024-05-20 22:52:04] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 188 ms returned sat
[2024-05-20 22:52:27] [INFO ] After 22688ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2024-05-20 22:52:27] [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:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-20 22:52:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 22:52:27] [INFO ] After 25269ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
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 21589 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 21591 ms. Remains : 10604/10605 places, 50001/50002 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 515 ms. (steps per millisecond=19 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 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 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 95870 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 95870 steps, saw 92787 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 50001 rows 10604 cols
[2024-05-20 22:53:02] [INFO ] Computed 102 invariants in 9411 ms
[2024-05-20 22:53:03] [INFO ] [Real]Absence check using 100 positive place invariants in 93 ms returned sat
[2024-05-20 22:53:04] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 181 ms returned sat
[2024-05-20 22:53:27] [INFO ] After 22766ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2024-05-20 22:53:27] [INFO ] State equation strengthened by 49696 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:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-20 22:53:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 22:53:27] [INFO ] After 25495ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 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 8496 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 8496 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 8842 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
[2024-05-20 22:53:45] [INFO ] Invariant cache hit.
[2024-05-20 22:53:46] [INFO ] Implicit Places using invariants in 887 ms returned []
Implicit Place search using SMT only with invariants took 887 ms to find 0 implicit places.
[2024-05-20 22:53:46] [INFO ] Invariant cache hit.
[2024-05-20 22:53:46] [INFO ] Dead Transitions using invariants and state equation in 884 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10621 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 108 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 199 reset in 3546 ms.
Product exploration explored 100000 steps with 200 reset in 3725 ms.
Built C files in :
/tmp/ltsmin9286930674372391958
[2024-05-20 22:53:54] [INFO ] Too many transitions (50002) to apply POR reductions. Disabling POR matrices.
[2024-05-20 22:53:55] [INFO ] Built C files in 268ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9286930674372391958
Running compilation step : cd /tmp/ltsmin9286930674372391958;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9286930674372391958;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9286930674372391958;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
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 5964 ms. Remains 10605 /10605 variables (removed 0) and now considering 50002/50002 (removed 0) transitions.
[2024-05-20 22:54:04] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
// Phase 1: matrix 40302 rows 10605 cols
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8065224 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15957736 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-PT-100"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is CANInsertWithFailure-PT-100, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r087-tall-171620521500108"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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