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.r263-tall-171654372000098.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 MultiCrashLeafsetExtension-PT-S32C03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654372000098
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 19M
-rw-r--r-- 1 mcc users 15K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Apr 22 14:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Apr 22 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 30K Apr 12 07:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K Apr 12 07:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 18M May 18 16:43 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 MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716654781157

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=MultiCrashLeafsetExtension-PT-S32C03
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 16:33:02] [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-25 16:33:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 16:33:03] [INFO ] Load time of PNML (sax parser for PT used): 612 ms
[2024-05-25 16:33:03] [INFO ] Transformed 15862 places.
[2024-05-25 16:33:03] [INFO ] Transformed 25109 transitions.
[2024-05-25 16:33:03] [INFO ] Parsed PT model containing 15862 places and 25109 transitions and 104566 arcs in 810 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 15862 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15862/15862 places, 25109/25109 transitions.
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 15820 transition count 25109
Discarding 3162 places :
Symmetric choice reduction at 1 with 3162 rule applications. Total rules 3204 place count 12658 transition count 21947
Iterating global reduction 1 with 3162 rules applied. Total rules applied 6366 place count 12658 transition count 21947
Discarding 2968 places :
Symmetric choice reduction at 1 with 2968 rule applications. Total rules 9334 place count 9690 transition count 18979
Iterating global reduction 1 with 2968 rules applied. Total rules applied 12302 place count 9690 transition count 18979
Discarding 986 places :
Symmetric choice reduction at 1 with 986 rule applications. Total rules 13288 place count 8704 transition count 16021
Iterating global reduction 1 with 986 rules applied. Total rules applied 14274 place count 8704 transition count 16021
Applied a total of 14274 rules in 9160 ms. Remains 8704 /15862 variables (removed 7158) and now considering 16021/25109 (removed 9088) transitions.
[2024-05-25 16:33:13] [INFO ] Flow matrix only has 14965 transitions (discarded 1056 similar events)
// Phase 1: matrix 14965 rows 8704 cols
[2024-05-25 16:33:14] [INFO ] Computed 1361 invariants in 1014 ms
[2024-05-25 16:33:15] [INFO ] Implicit Places using invariants in 1999 ms returned []
Implicit Place search using SMT only with invariants took 2027 ms to find 0 implicit places.
[2024-05-25 16:33:15] [INFO ] Flow matrix only has 14965 transitions (discarded 1056 similar events)
[2024-05-25 16:33:15] [INFO ] Invariant cache hit.
[2024-05-25 16:33:15] [INFO ] Dead Transitions using invariants and state equation in 909 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8704/15862 places, 16021/25109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12106 ms. Remains : 8704/15862 places, 16021/25109 transitions.
Support contains 48 out of 8704 places after structural reductions.
[2024-05-25 16:33:16] [INFO ] Flatten gal took : 769 ms
[2024-05-25 16:33:17] [INFO ] Flatten gal took : 527 ms
[2024-05-25 16:33:18] [INFO ] Input system was already deterministic with 16021 transitions.
Incomplete random walk after 10000 steps, including 319 resets, run finished after 606 ms. (steps per millisecond=16 ) properties (out of 21) seen :4
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2024-05-25 16:33:19] [INFO ] Flow matrix only has 14965 transitions (discarded 1056 similar events)
[2024-05-25 16:33:19] [INFO ] Invariant cache hit.
[2024-05-25 16:33:22] [INFO ] [Real]Absence check using 65 positive place invariants in 215 ms returned sat
[2024-05-25 16:33:22] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 505 ms returned sat
[2024-05-25 16:33:44] [INFO ] After 19683ms SMT Verify possible using state equation in real domain returned unsat :2 sat :4 real:10
[2024-05-25 16:33:44] [INFO ] State equation strengthened by 6126 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-25 16:33:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 16:33:44] [INFO ] After 25135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 17 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 31 out of 8704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8704/8704 places, 16021/16021 transitions.
Performed 207 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 207 Pre rules applied. Total rules applied 0 place count 8704 transition count 15814
Deduced a syphon composed of 207 places in 12 ms
Reduce places removed 207 places and 0 transitions.
Iterating global reduction 0 with 414 rules applied. Total rules applied 414 place count 8497 transition count 15814
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 415 place count 8496 transition count 15813
Iterating global reduction 0 with 1 rules applied. Total rules applied 416 place count 8496 transition count 15813
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 416 place count 8496 transition count 15812
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 418 place count 8495 transition count 15812
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 419 place count 8494 transition count 15809
Iterating global reduction 0 with 1 rules applied. Total rules applied 420 place count 8494 transition count 15809
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 18 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 0 with 62 rules applied. Total rules applied 482 place count 8463 transition count 15778
Free-agglomeration rule (complex) applied 517 times.
Iterating global reduction 0 with 517 rules applied. Total rules applied 999 place count 8463 transition count 17205
Reduce places removed 517 places and 0 transitions.
Iterating post reduction 0 with 517 rules applied. Total rules applied 1516 place count 7946 transition count 17205
Partial Free-agglomeration rule applied 32 times.
Drop transitions removed 32 transitions
Iterating global reduction 1 with 32 rules applied. Total rules applied 1548 place count 7946 transition count 17205
Applied a total of 1548 rules in 14774 ms. Remains 7946 /8704 variables (removed 758) and now considering 17205/16021 (removed -1184) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14777 ms. Remains : 7946/8704 places, 17205/16021 transitions.
Incomplete random walk after 10000 steps, including 521 resets, run finished after 585 ms. (steps per millisecond=17 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2024-05-25 16:34:01] [INFO ] Flow matrix only has 15698 transitions (discarded 1507 similar events)
// Phase 1: matrix 15698 rows 7946 cols
[2024-05-25 16:34:01] [INFO ] Computed 1361 invariants in 741 ms
[2024-05-25 16:34:04] [INFO ] [Real]Absence check using 65 positive place invariants in 156 ms returned sat
[2024-05-25 16:34:04] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 473 ms returned sat
[2024-05-25 16:34:22] [INFO ] After 20450ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-05-25 16:34:24] [INFO ] [Nat]Absence check using 65 positive place invariants in 170 ms returned sat
[2024-05-25 16:34:24] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 477 ms returned sat
[2024-05-25 16:34:43] [INFO ] After 17628ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2024-05-25 16:34:43] [INFO ] State equation strengthened by 8068 read => feed constraints.
[2024-05-25 16:34:47] [INFO ] After 3443ms SMT Verify possible using 8068 Read/Feed constraints in natural domain returned unsat :6 sat :6
[2024-05-25 16:34:47] [INFO ] After 3445ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :6
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-25 16:34:47] [INFO ] After 25049ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :6
Fused 13 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 35 ms.
Support contains 14 out of 7946 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7946/7946 places, 17205/17205 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 7945 transition count 17204
Free-agglomeration rule (complex) applied 31 times.
Iterating global reduction 0 with 31 rules applied. Total rules applied 33 place count 7945 transition count 17173
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 64 place count 7914 transition count 17173
Applied a total of 64 rules in 5712 ms. Remains 7914 /7946 variables (removed 32) and now considering 17173/17205 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5712 ms. Remains : 7914/7946 places, 17173/17205 transitions.
Incomplete random walk after 10000 steps, including 521 resets, run finished after 478 ms. (steps per millisecond=20 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 13346 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :{}
Probabilistic random walk after 13346 steps, saw 6132 distinct states, run finished after 3002 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 7 properties.
[2024-05-25 16:34:56] [INFO ] Flow matrix only has 15636 transitions (discarded 1537 similar events)
// Phase 1: matrix 15636 rows 7914 cols
[2024-05-25 16:34:57] [INFO ] Computed 1361 invariants in 801 ms
[2024-05-25 16:34:59] [INFO ] [Real]Absence check using 65 positive place invariants in 137 ms returned sat
[2024-05-25 16:34:59] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 490 ms returned sat
[2024-05-25 16:35:14] [INFO ] After 16872ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-25 16:35:16] [INFO ] [Nat]Absence check using 65 positive place invariants in 135 ms returned sat
[2024-05-25 16:35:16] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 492 ms returned sat
[2024-05-25 16:35:31] [INFO ] After 14115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-25 16:35:31] [INFO ] State equation strengthened by 8068 read => feed constraints.
[2024-05-25 16:35:39] [INFO ] After 8151ms SMT Verify possible using 8068 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2024-05-25 16:35:39] [INFO ] After 25043ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 17 ms.
Support contains 14 out of 7914 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7914/7914 places, 17173/17173 transitions.
Applied a total of 0 rules in 2269 ms. Remains 7914 /7914 variables (removed 0) and now considering 17173/17173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2269 ms. Remains : 7914/7914 places, 17173/17173 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7914/7914 places, 17173/17173 transitions.
Applied a total of 0 rules in 2250 ms. Remains 7914 /7914 variables (removed 0) and now considering 17173/17173 (removed 0) transitions.
[2024-05-25 16:35:44] [INFO ] Flow matrix only has 15636 transitions (discarded 1537 similar events)
[2024-05-25 16:35:44] [INFO ] Invariant cache hit.
[2024-05-25 16:35:44] [INFO ] Implicit Places using invariants in 707 ms returned []
Implicit Place search using SMT only with invariants took 713 ms to find 0 implicit places.
[2024-05-25 16:35:44] [INFO ] Flow matrix only has 15636 transitions (discarded 1537 similar events)
[2024-05-25 16:35:44] [INFO ] Invariant cache hit.
[2024-05-25 16:35:45] [INFO ] Dead Transitions using invariants and state equation in 724 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3695 ms. Remains : 7914/7914 places, 17173/17173 transitions.
Successfully simplified 8 atomic propositions for a total of 10 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2688 stabilizing places and 4052 stable transitions
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!((p0||X(p1)))'
Support contains 4 out of 8704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8704/8704 places, 16021/16021 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 8701 transition count 16014
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 8701 transition count 16014
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 8700 transition count 16011
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 8700 transition count 16011
Applied a total of 8 rules in 6163 ms. Remains 8700 /8704 variables (removed 4) and now considering 16011/16021 (removed 10) transitions.
[2024-05-25 16:35:52] [INFO ] Flow matrix only has 14955 transitions (discarded 1056 similar events)
// Phase 1: matrix 14955 rows 8700 cols
[2024-05-25 16:35:52] [INFO ] Computed 1361 invariants in 740 ms
[2024-05-25 16:35:53] [INFO ] Implicit Places using invariants in 1525 ms returned []
Implicit Place search using SMT only with invariants took 1527 ms to find 0 implicit places.
[2024-05-25 16:35:53] [INFO ] Flow matrix only has 14955 transitions (discarded 1056 similar events)
[2024-05-25 16:35:53] [INFO ] Invariant cache hit.
[2024-05-25 16:35:54] [INFO ] Dead Transitions using invariants and state equation in 771 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8700/8704 places, 16011/16021 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8467 ms. Remains : 8700/8704 places, 16011/16021 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 187 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}]], initial=1, aps=[p0:(AND (GEQ s5384 1) (GEQ s5596 1)), p1:(AND (GEQ s4015 1) (GEQ s5689 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-09 finished in 8754 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(F((G(p1)&&p0))))'
Support contains 4 out of 8704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8704/8704 places, 16021/16021 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 8700 transition count 16013
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 8700 transition count 16013
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 8698 transition count 16007
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 8698 transition count 16007
Applied a total of 12 rules in 6162 ms. Remains 8698 /8704 variables (removed 6) and now considering 16007/16021 (removed 14) transitions.
[2024-05-25 16:36:00] [INFO ] Flow matrix only has 14951 transitions (discarded 1056 similar events)
// Phase 1: matrix 14951 rows 8698 cols
[2024-05-25 16:36:01] [INFO ] Computed 1361 invariants in 723 ms
[2024-05-25 16:36:02] [INFO ] Implicit Places using invariants in 1499 ms returned []
Implicit Place search using SMT only with invariants took 1500 ms to find 0 implicit places.
[2024-05-25 16:36:02] [INFO ] Flow matrix only has 14951 transitions (discarded 1056 similar events)
[2024-05-25 16:36:02] [INFO ] Invariant cache hit.
[2024-05-25 16:36:03] [INFO ] Dead Transitions using invariants and state equation in 768 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8698/8704 places, 16007/16021 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8443 ms. Remains : 8698/8704 places, 16007/16021 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s4198 1) (GEQ s5599 1)), p1:(AND (GEQ s6184 1) (GEQ s7769 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-10 finished in 8644 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)||F(p1)))'
Support contains 4 out of 8704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8704/8704 places, 16021/16021 transitions.
Performed 208 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 208 Pre rules applied. Total rules applied 0 place count 8704 transition count 15813
Deduced a syphon composed of 208 places in 14 ms
Reduce places removed 208 places and 0 transitions.
Iterating global reduction 0 with 416 rules applied. Total rules applied 416 place count 8496 transition count 15813
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 420 place count 8492 transition count 15805
Iterating global reduction 0 with 4 rules applied. Total rules applied 424 place count 8492 transition count 15805
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 424 place count 8492 transition count 15803
Deduced a syphon composed of 2 places in 12 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 428 place count 8490 transition count 15803
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 430 place count 8488 transition count 15797
Iterating global reduction 0 with 2 rules applied. Total rules applied 432 place count 8488 transition count 15797
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 13 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 0 with 66 rules applied. Total rules applied 498 place count 8455 transition count 15764
Applied a total of 498 rules in 8591 ms. Remains 8455 /8704 variables (removed 249) and now considering 15764/16021 (removed 257) transitions.
[2024-05-25 16:36:11] [INFO ] Flow matrix only has 14708 transitions (discarded 1056 similar events)
// Phase 1: matrix 14708 rows 8455 cols
[2024-05-25 16:36:12] [INFO ] Computed 1361 invariants in 754 ms
[2024-05-25 16:36:13] [INFO ] Implicit Places using invariants in 1495 ms returned []
Implicit Place search using SMT only with invariants took 1507 ms to find 0 implicit places.
[2024-05-25 16:36:13] [INFO ] Flow matrix only has 14708 transitions (discarded 1056 similar events)
[2024-05-25 16:36:13] [INFO ] Invariant cache hit.
[2024-05-25 16:36:14] [INFO ] Dead Transitions using invariants and state equation in 776 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8455/8704 places, 15764/16021 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10878 ms. Remains : 8455/8704 places, 15764/16021 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (GEQ s3181 1) (GEQ s4548 1)), p0:(OR (LT s882 1) (LT s2574 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4503 reset in 1879 ms.
Product exploration explored 100000 steps with 4509 reset in 1763 ms.
Computed a total of 2472 stabilizing places and 3828 stable transitions
Computed a total of 2472 stabilizing places and 3828 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 450 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 13265 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :{}
Probabilistic random walk after 13265 steps, saw 6219 distinct states, run finished after 3001 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-25 16:36:21] [INFO ] Flow matrix only has 14708 transitions (discarded 1056 similar events)
[2024-05-25 16:36:21] [INFO ] Invariant cache hit.
[2024-05-25 16:36:22] [INFO ] [Real]Absence check using 65 positive place invariants in 134 ms returned sat
[2024-05-25 16:36:23] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 532 ms returned sat
[2024-05-25 16:36:23] [INFO ] After 1801ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 16:36:24] [INFO ] [Nat]Absence check using 65 positive place invariants in 134 ms returned sat
[2024-05-25 16:36:25] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 508 ms returned sat
[2024-05-25 16:36:39] [INFO ] After 14481ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 16:36:39] [INFO ] State equation strengthened by 6118 read => feed constraints.
[2024-05-25 16:36:40] [INFO ] After 829ms SMT Verify possible using 6118 Read/Feed constraints in natural domain returned unsat :3 sat :0
[2024-05-25 16:36:40] [INFO ] After 17374ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (G (NOT p1)), (G (AND p0 (NOT p1))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 20 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-13 finished in 37509 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(X(X(X(p1))))))'
Support contains 4 out of 8704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8704/8704 places, 16021/16021 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 8701 transition count 16016
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 8701 transition count 16016
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 8699 transition count 16010
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 8699 transition count 16010
Applied a total of 10 rules in 5327 ms. Remains 8699 /8704 variables (removed 5) and now considering 16010/16021 (removed 11) transitions.
[2024-05-25 16:36:46] [INFO ] Flow matrix only has 14954 transitions (discarded 1056 similar events)
// Phase 1: matrix 14954 rows 8699 cols
[2024-05-25 16:36:46] [INFO ] Computed 1361 invariants in 710 ms
[2024-05-25 16:36:47] [INFO ] Implicit Places using invariants in 1492 ms returned []
Implicit Place search using SMT only with invariants took 1493 ms to find 0 implicit places.
[2024-05-25 16:36:47] [INFO ] Flow matrix only has 14954 transitions (discarded 1056 similar events)
[2024-05-25 16:36:47] [INFO ] Invariant cache hit.
[2024-05-25 16:36:48] [INFO ] Dead Transitions using invariants and state equation in 772 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8699/8704 places, 16010/16021 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7596 ms. Remains : 8699/8704 places, 16010/16021 transitions.
Stuttering acceptance computed with spot in 385 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 8}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 9}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 3}], [{ cond=p0, acceptance={} source=6 dest: 4}, { cond=(NOT p0), acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 5}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(NOT p0), acceptance={} source=9 dest: 8}, { cond=p0, acceptance={} source=9 dest: 9}], [{ cond=p0, acceptance={} source=10 dest: 6}, { cond=(NOT p0), acceptance={} source=10 dest: 7}]], initial=10, aps=[p1:(AND (GEQ s3219 1) (GEQ s4110 1)), p0:(OR (LT s3219 1) (LT s4110 1) (AND (GEQ s4962 1) (GEQ s8692 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3197 reset in 1478 ms.
Product exploration explored 100000 steps with 3195 reset in 1526 ms.
Computed a total of 2683 stabilizing places and 4041 stable transitions
Computed a total of 2683 stabilizing places and 4041 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 84 ms. Reduced automaton from 11 states, 17 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 319 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 12361 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :{}
Probabilistic random walk after 12361 steps, saw 5893 distinct states, run finished after 3001 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-25 16:36:55] [INFO ] Flow matrix only has 14954 transitions (discarded 1056 similar events)
[2024-05-25 16:36:55] [INFO ] Invariant cache hit.
[2024-05-25 16:36:56] [INFO ] [Real]Absence check using 65 positive place invariants in 121 ms returned sat
[2024-05-25 16:36:57] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 553 ms returned sat
[2024-05-25 16:36:57] [INFO ] After 2072ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2024-05-25 16:36:59] [INFO ] [Nat]Absence check using 65 positive place invariants in 125 ms returned sat
[2024-05-25 16:36:59] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 615 ms returned sat
[2024-05-25 16:37:16] [INFO ] After 16409ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-25 16:37:16] [INFO ] State equation strengthened by 6120 read => feed constraints.
[2024-05-25 16:37:18] [INFO ] After 1804ms SMT Verify possible using 6120 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2024-05-25 16:37:32] [INFO ] Deduced a trap composed of 938 places in 13697 ms of which 21 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
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: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-25 16:37:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 16:37:32] [INFO ] After 34648ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:3
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 8699 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8699/8699 places, 16010/16010 transitions.
Performed 210 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 210 Pre rules applied. Total rules applied 0 place count 8699 transition count 15800
Deduced a syphon composed of 210 places in 12 ms
Reduce places removed 210 places and 0 transitions.
Iterating global reduction 0 with 420 rules applied. Total rules applied 420 place count 8489 transition count 15800
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 13 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 0 with 66 rules applied. Total rules applied 486 place count 8456 transition count 15767
Free-agglomeration rule (complex) applied 575 times.
Iterating global reduction 0 with 575 rules applied. Total rules applied 1061 place count 8456 transition count 17170
Reduce places removed 575 places and 0 transitions.
Iterating post reduction 0 with 575 rules applied. Total rules applied 1636 place count 7881 transition count 17170
Applied a total of 1636 rules in 7040 ms. Remains 7881 /8699 variables (removed 818) and now considering 17170/16010 (removed -1160) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7041 ms. Remains : 7881/8699 places, 17170/16010 transitions.
Incomplete random walk after 10000 steps, including 523 resets, run finished after 515 ms. (steps per millisecond=19 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 13033 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :{}
Probabilistic random walk after 13033 steps, saw 5993 distinct states, run finished after 3001 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-25 16:37:43] [INFO ] Flow matrix only has 15605 transitions (discarded 1565 similar events)
// Phase 1: matrix 15605 rows 7881 cols
[2024-05-25 16:37:44] [INFO ] Computed 1361 invariants in 753 ms
[2024-05-25 16:37:45] [INFO ] [Real]Absence check using 65 positive place invariants in 126 ms returned sat
[2024-05-25 16:37:45] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 501 ms returned sat
[2024-05-25 16:37:59] [INFO ] After 15025ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 16:38:00] [INFO ] [Nat]Absence check using 65 positive place invariants in 127 ms returned sat
[2024-05-25 16:38:00] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 480 ms returned sat
[2024-05-25 16:38:15] [INFO ] After 14175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 16:38:15] [INFO ] State equation strengthened by 8098 read => feed constraints.
[2024-05-25 16:38:18] [INFO ] After 3212ms SMT Verify possible using 8098 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-25 16:38:32] [INFO ] Deduced a trap composed of 270 places in 13080 ms of which 11 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
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: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-25 16:38:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 16:38:32] [INFO ] After 32883ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 7881 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7881/7881 places, 17170/17170 transitions.
Applied a total of 0 rules in 2077 ms. Remains 7881 /7881 variables (removed 0) and now considering 17170/17170 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2078 ms. Remains : 7881/7881 places, 17170/17170 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7881/7881 places, 17170/17170 transitions.
Applied a total of 0 rules in 2085 ms. Remains 7881 /7881 variables (removed 0) and now considering 17170/17170 (removed 0) transitions.
[2024-05-25 16:38:36] [INFO ] Flow matrix only has 15605 transitions (discarded 1565 similar events)
[2024-05-25 16:38:36] [INFO ] Invariant cache hit.
[2024-05-25 16:38:43] [INFO ] Implicit Places using invariants in 7688 ms returned []
Implicit Place search using SMT only with invariants took 7689 ms to find 0 implicit places.
[2024-05-25 16:38:43] [INFO ] Flow matrix only has 15605 transitions (discarded 1565 similar events)
[2024-05-25 16:38:43] [INFO ] Invariant cache hit.
[2024-05-25 16:38:56] [INFO ] Dead Transitions using invariants and state equation in 12507 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22287 ms. Remains : 7881/7881 places, 17170/17170 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), true, (X (X p0)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 93 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 292 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 8699 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8699/8699 places, 16010/16010 transitions.
Applied a total of 0 rules in 1924 ms. Remains 8699 /8699 variables (removed 0) and now considering 16010/16010 (removed 0) transitions.
[2024-05-25 16:38:59] [INFO ] Flow matrix only has 14954 transitions (discarded 1056 similar events)
// Phase 1: matrix 14954 rows 8699 cols
[2024-05-25 16:38:59] [INFO ] Computed 1361 invariants in 716 ms
[2024-05-25 16:39:00] [INFO ] Implicit Places using invariants in 1476 ms returned []
Implicit Place search using SMT only with invariants took 1477 ms to find 0 implicit places.
[2024-05-25 16:39:00] [INFO ] Flow matrix only has 14954 transitions (discarded 1056 similar events)
[2024-05-25 16:39:00] [INFO ] Invariant cache hit.
[2024-05-25 16:39:01] [INFO ] Dead Transitions using invariants and state equation in 762 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4165 ms. Remains : 8699/8699 places, 16010/16010 transitions.
Computed a total of 2683 stabilizing places and 4041 stable transitions
Computed a total of 2683 stabilizing places and 4041 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 317 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 12675 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :{}
Probabilistic random walk after 12675 steps, saw 6042 distinct states, run finished after 3001 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 16:39:05] [INFO ] Flow matrix only has 14954 transitions (discarded 1056 similar events)
[2024-05-25 16:39:05] [INFO ] Invariant cache hit.
[2024-05-25 16:39:06] [INFO ] [Real]Absence check using 65 positive place invariants in 112 ms returned sat
[2024-05-25 16:39:06] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 513 ms returned sat
[2024-05-25 16:39:06] [INFO ] After 1832ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 16:39:07] [INFO ] [Nat]Absence check using 65 positive place invariants in 113 ms returned sat
[2024-05-25 16:39:08] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 535 ms returned sat
[2024-05-25 16:39:20] [INFO ] After 11316ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 16:39:20] [INFO ] State equation strengthened by 6120 read => feed constraints.
[2024-05-25 16:39:21] [INFO ] After 1225ms SMT Verify possible using 6120 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 16:39:35] [INFO ] Deduced a trap composed of 938 places in 14037 ms of which 10 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
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-25 16:39:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 16:39:35] [INFO ] After 28817ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 8699 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8699/8699 places, 16010/16010 transitions.
Performed 210 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 210 Pre rules applied. Total rules applied 0 place count 8699 transition count 15800
Deduced a syphon composed of 210 places in 11 ms
Reduce places removed 210 places and 0 transitions.
Iterating global reduction 0 with 420 rules applied. Total rules applied 420 place count 8489 transition count 15800
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 12 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 0 with 66 rules applied. Total rules applied 486 place count 8456 transition count 15767
Free-agglomeration rule (complex) applied 575 times.
Iterating global reduction 0 with 575 rules applied. Total rules applied 1061 place count 8456 transition count 17170
Reduce places removed 575 places and 0 transitions.
Iterating post reduction 0 with 575 rules applied. Total rules applied 1636 place count 7881 transition count 17170
Applied a total of 1636 rules in 7502 ms. Remains 7881 /8699 variables (removed 818) and now considering 17170/16010 (removed -1160) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7502 ms. Remains : 7881/8699 places, 17170/16010 transitions.
Incomplete random walk after 10000 steps, including 522 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 13265 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :{}
Probabilistic random walk after 13265 steps, saw 6099 distinct states, run finished after 3001 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 16:39:46] [INFO ] Flow matrix only has 15605 transitions (discarded 1565 similar events)
// Phase 1: matrix 15605 rows 7881 cols
[2024-05-25 16:39:47] [INFO ] Computed 1361 invariants in 740 ms
[2024-05-25 16:39:48] [INFO ] [Real]Absence check using 65 positive place invariants in 122 ms returned sat
[2024-05-25 16:39:48] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 485 ms returned sat
[2024-05-25 16:39:58] [INFO ] After 11364ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 16:39:59] [INFO ] [Nat]Absence check using 65 positive place invariants in 119 ms returned sat
[2024-05-25 16:40:00] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 467 ms returned sat
[2024-05-25 16:40:11] [INFO ] After 10972ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 16:40:11] [INFO ] State equation strengthened by 8098 read => feed constraints.
[2024-05-25 16:40:13] [INFO ] After 1866ms SMT Verify possible using 8098 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 16:40:25] [INFO ] Deduced a trap composed of 217 places in 11671 ms of which 7 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
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-25 16:40:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 16:40:25] [INFO ] After 26608ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 7881 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7881/7881 places, 17170/17170 transitions.
Applied a total of 0 rules in 2145 ms. Remains 7881 /7881 variables (removed 0) and now considering 17170/17170 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2146 ms. Remains : 7881/7881 places, 17170/17170 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7881/7881 places, 17170/17170 transitions.
Applied a total of 0 rules in 2107 ms. Remains 7881 /7881 variables (removed 0) and now considering 17170/17170 (removed 0) transitions.
[2024-05-25 16:40:29] [INFO ] Flow matrix only has 15605 transitions (discarded 1565 similar events)
[2024-05-25 16:40:29] [INFO ] Invariant cache hit.
[2024-05-25 16:40:37] [INFO ] Implicit Places using invariants in 8094 ms returned []
Implicit Place search using SMT only with invariants took 8095 ms to find 0 implicit places.
[2024-05-25 16:40:37] [INFO ] Flow matrix only has 15605 transitions (discarded 1565 similar events)
[2024-05-25 16:40:37] [INFO ] Invariant cache hit.
[2024-05-25 16:40:50] [INFO ] Dead Transitions using invariants and state equation in 12636 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22850 ms. Remains : 7881/7881 places, 17170/17170 transitions.
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 71 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 300 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 275 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Entered a terminal (fully accepting) state of product in 35603 steps with 1137 reset in 514 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-14 finished in 251219 ms.
All properties solved by simple procedures.
Total runtime 469375 ms.

BK_STOP 1716655252983

--------------------
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="MultiCrashLeafsetExtension-PT-S32C03"
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 MultiCrashLeafsetExtension-PT-S32C03, 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 r263-tall-171654372000098"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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