About the Execution of ITS-Tools for RERS2020-PT-pb103
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15206.556 | 2605183.00 | 3101180.00 | 9924.20 | FFFFFFTTFFFTTTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r325-tall-167889196900236.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is RERS2020-PT-pb103, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r325-tall-167889196900236
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 7.2K Feb 26 08:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 08:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 08:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 08:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 08:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 26 08:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 08:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 08:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 18M Mar 5 18:23 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 RERS2020-PT-pb103-LTLFireability-00
FORMULA_NAME RERS2020-PT-pb103-LTLFireability-01
FORMULA_NAME RERS2020-PT-pb103-LTLFireability-02
FORMULA_NAME RERS2020-PT-pb103-LTLFireability-03
FORMULA_NAME RERS2020-PT-pb103-LTLFireability-04
FORMULA_NAME RERS2020-PT-pb103-LTLFireability-05
FORMULA_NAME RERS2020-PT-pb103-LTLFireability-06
FORMULA_NAME RERS2020-PT-pb103-LTLFireability-07
FORMULA_NAME RERS2020-PT-pb103-LTLFireability-08
FORMULA_NAME RERS2020-PT-pb103-LTLFireability-09
FORMULA_NAME RERS2020-PT-pb103-LTLFireability-10
FORMULA_NAME RERS2020-PT-pb103-LTLFireability-11
FORMULA_NAME RERS2020-PT-pb103-LTLFireability-12
FORMULA_NAME RERS2020-PT-pb103-LTLFireability-13
FORMULA_NAME RERS2020-PT-pb103-LTLFireability-14
FORMULA_NAME RERS2020-PT-pb103-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678990016029
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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS2020-PT-pb103
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-16 18:06:57] [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]
[2023-03-16 18:06:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 18:06:58] [INFO ] Load time of PNML (sax parser for PT used): 782 ms
[2023-03-16 18:06:58] [INFO ] Transformed 520 places.
[2023-03-16 18:06:58] [INFO ] Transformed 31658 transitions.
[2023-03-16 18:06:58] [INFO ] Found NUPN structural information;
[2023-03-16 18:06:58] [INFO ] Parsed PT model containing 520 places and 31658 transitions and 125892 arcs in 966 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 3229 transitions
Reduce redundant transitions removed 3229 transitions.
FORMULA RERS2020-PT-pb103-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb103-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 63 out of 520 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 520/520 places, 28429/28429 transitions.
Ensure Unique test removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 513 transition count 28429
Applied a total of 7 rules in 101 ms. Remains 513 /520 variables (removed 7) and now considering 28429/28429 (removed 0) transitions.
[2023-03-16 18:06:59] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2023-03-16 18:06:59] [INFO ] Computed 8 place invariants in 123 ms
[2023-03-16 18:06:59] [INFO ] Implicit Places using invariants in 965 ms returned []
Implicit Place search using SMT only with invariants took 988 ms to find 0 implicit places.
[2023-03-16 18:06:59] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-16 18:06:59] [INFO ] Invariant cache hit.
[2023-03-16 18:07:08] [INFO ] Dead Transitions using invariants and state equation in 8418 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 513/520 places, 28429/28429 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9517 ms. Remains : 513/520 places, 28429/28429 transitions.
Support contains 63 out of 513 places after structural reductions.
[2023-03-16 18:07:09] [INFO ] Flatten gal took : 1042 ms
[2023-03-16 18:07:10] [INFO ] Flatten gal took : 841 ms
[2023-03-16 18:07:12] [INFO ] Input system was already deterministic with 28429 transitions.
Support contains 60 out of 513 places (down from 63) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 813 ms. (steps per millisecond=12 ) properties (out of 31) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 29) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Running SMT prover for 28 properties.
[2023-03-16 18:07:13] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-16 18:07:13] [INFO ] Invariant cache hit.
[2023-03-16 18:07:14] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 18:07:23] [INFO ] After 9235ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:27
[2023-03-16 18:07:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-16 18:07:37] [INFO ] After 13748ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :27
[2023-03-16 18:07:37] [INFO ] State equation strengthened by 1379 read => feed constraints.
[2023-03-16 18:07:48] [INFO ] After 10543ms SMT Verify possible using 1379 Read/Feed constraints in natural domain returned unsat :1 sat :26
[2023-03-16 18:07:48] [INFO ] After 10546ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :26
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-16 18:07:48] [INFO ] After 25042ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :26
Fused 28 Parikh solutions to 27 different solutions.
Parikh walk visited 0 properties in 106 ms.
Support contains 49 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 513 transition count 27367
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1064 place count 512 transition count 27366
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1066 place count 511 transition count 27377
Free-agglomeration rule applied 11 times.
Iterating global reduction 1 with 11 rules applied. Total rules applied 1077 place count 511 transition count 27366
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 1176 place count 500 transition count 27278
Applied a total of 1176 rules in 604 ms. Remains 500 /513 variables (removed 13) and now considering 27278/28429 (removed 1151) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 605 ms. Remains : 500/513 places, 27278/28429 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 468 ms. (steps per millisecond=21 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Interrupted probabilistic random walk after 32888 steps, run timeout after 3001 ms. (steps per millisecond=10 ) properties seen :{}
Probabilistic random walk after 32888 steps, saw 23481 distinct states, run finished after 3002 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 26 properties.
[2023-03-16 18:07:52] [INFO ] Flow matrix only has 18597 transitions (discarded 8681 similar events)
// Phase 1: matrix 18597 rows 500 cols
[2023-03-16 18:07:52] [INFO ] Computed 8 place invariants in 80 ms
[2023-03-16 18:07:53] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 18:08:01] [INFO ] After 8739ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:26
[2023-03-16 18:08:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-16 18:08:14] [INFO ] After 12201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :26
[2023-03-16 18:08:14] [INFO ] State equation strengthened by 1369 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.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:644)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 18:08:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 18:08:26] [INFO ] After 25036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:26
Parikh walk visited 0 properties in 61 ms.
Support contains 45 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 27278/27278 transitions.
Applied a total of 0 rules in 109 ms. Remains 500 /500 variables (removed 0) and now considering 27278/27278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 500/500 places, 27278/27278 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 451 ms. (steps per millisecond=22 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Interrupted probabilistic random walk after 29743 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :{}
Probabilistic random walk after 29743 steps, saw 21348 distinct states, run finished after 3001 ms. (steps per millisecond=9 ) properties seen :0
Running SMT prover for 26 properties.
[2023-03-16 18:08:30] [INFO ] Flow matrix only has 18597 transitions (discarded 8681 similar events)
[2023-03-16 18:08:30] [INFO ] Invariant cache hit.
[2023-03-16 18:08:31] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-16 18:08:39] [INFO ] After 8341ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:26
[2023-03-16 18:08:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-16 18:08:50] [INFO ] After 11340ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :26
[2023-03-16 18:08:50] [INFO ] State equation strengthened by 1369 read => feed constraints.
[2023-03-16 18:09:04] [INFO ] After 13163ms SMT Verify possible using 1369 Read/Feed constraints in natural domain returned unsat :0 sat :26
[2023-03-16 18:09:04] [INFO ] After 13164ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :26
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-16 18:09:04] [INFO ] After 25044ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :26
Parikh walk visited 0 properties in 56 ms.
Support contains 45 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 27278/27278 transitions.
Applied a total of 0 rules in 101 ms. Remains 500 /500 variables (removed 0) and now considering 27278/27278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 500/500 places, 27278/27278 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 27278/27278 transitions.
Applied a total of 0 rules in 106 ms. Remains 500 /500 variables (removed 0) and now considering 27278/27278 (removed 0) transitions.
[2023-03-16 18:09:04] [INFO ] Flow matrix only has 18597 transitions (discarded 8681 similar events)
[2023-03-16 18:09:04] [INFO ] Invariant cache hit.
[2023-03-16 18:09:05] [INFO ] Implicit Places using invariants in 861 ms returned []
Implicit Place search using SMT only with invariants took 862 ms to find 0 implicit places.
[2023-03-16 18:09:05] [INFO ] Flow matrix only has 18597 transitions (discarded 8681 similar events)
[2023-03-16 18:09:05] [INFO ] Invariant cache hit.
[2023-03-16 18:09:13] [INFO ] Dead Transitions using invariants and state equation in 7831 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8808 ms. Remains : 500/500 places, 27278/27278 transitions.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 121 stabilizing places and 10286 stable transitions
FORMULA RERS2020-PT-pb103-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 32 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2023-03-16 18:09:13] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2023-03-16 18:09:13] [INFO ] Computed 8 place invariants in 51 ms
[2023-03-16 18:09:14] [INFO ] Implicit Places using invariants in 843 ms returned []
Implicit Place search using SMT only with invariants took 845 ms to find 0 implicit places.
[2023-03-16 18:09:14] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-16 18:09:14] [INFO ] Invariant cache hit.
[2023-03-16 18:09:22] [INFO ] Dead Transitions using invariants and state equation in 8069 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8952 ms. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 329 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RERS2020-PT-pb103-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (EQ s88 1) (EQ s107 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 62 steps with 0 reset in 23 ms.
FORMULA RERS2020-PT-pb103-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLFireability-00 finished in 9415 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&X(p1))))'
Support contains 6 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 30 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2023-03-16 18:09:22] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-16 18:09:22] [INFO ] Invariant cache hit.
[2023-03-16 18:09:23] [INFO ] Implicit Places using invariants in 792 ms returned []
Implicit Place search using SMT only with invariants took 794 ms to find 0 implicit places.
[2023-03-16 18:09:23] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-16 18:09:23] [INFO ] Invariant cache hit.
[2023-03-16 18:09:31] [INFO ] Dead Transitions using invariants and state equation in 7687 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8515 ms. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : RERS2020-PT-pb103-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (EQ s8 1) (EQ s308 1)) (AND (EQ s22 1) (EQ s366 1))), p1:(OR (EQ s265 0) (EQ s457 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 48 steps with 0 reset in 5 ms.
FORMULA RERS2020-PT-pb103-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLFireability-01 finished in 8735 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((((p1 U G(p2))||p0)&&((p1 U G(p2))||G(F(p3)))))))'
Support contains 6 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Reduce places removed 1 places and 1 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 511 transition count 28427
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
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 4 place count 510 transition count 28438
Applied a total of 4 rules in 297 ms. Remains 510 /513 variables (removed 3) and now considering 28438/28429 (removed -9) transitions.
[2023-03-16 18:09:31] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
// Phase 1: matrix 18682 rows 510 cols
[2023-03-16 18:09:31] [INFO ] Computed 8 place invariants in 57 ms
[2023-03-16 18:09:32] [INFO ] Implicit Places using invariants in 760 ms returned []
Implicit Place search using SMT only with invariants took 764 ms to find 0 implicit places.
[2023-03-16 18:09:32] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-16 18:09:32] [INFO ] Invariant cache hit.
[2023-03-16 18:09:40] [INFO ] Dead Transitions using invariants and state equation in 8042 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 510/513 places, 28438/28429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9106 ms. Remains : 510/513 places, 28438/28429 transitions.
Stuttering acceptance computed with spot in 271 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : RERS2020-PT-pb103-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR p2 p0 p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p2 (NOT p0) p1), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={1} source=0 dest: 4}, { cond=(AND p2 p0 (NOT p1) (NOT p3)), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p2 p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p0) p1), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={1} source=1 dest: 4}, { cond=(AND p2 p0 (NOT p1) (NOT p3)), acceptance={} source=1 dest: 5}], [{ cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p2 p1 (NOT p3)), acceptance={1} source=2 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={1} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p2 p1 (NOT p3)), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={1} source=3 dest: 5}], [{ cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p2 (NOT p0) p1), acceptance={1} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(OR (AND p2 p0) (AND p2 p1)), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={1} source=4 dest: 4}, { cond=(AND p2 p0 (NOT p1) (NOT p3)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p2 p1 (NOT p3)), acceptance={1} source=5 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p2 p1 (NOT p3)), acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={1} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s212 1) (EQ s408 1)), p0:(OR (EQ s35 0) (EQ s297 0)), p1:(AND (EQ s35 1) (EQ s297 1)), p3:(OR (EQ s231 0) (EQ s483 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 1019 steps with 0 reset in 43 ms.
FORMULA RERS2020-PT-pb103-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLFireability-04 finished in 9484 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 30 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2023-03-16 18:09:41] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2023-03-16 18:09:41] [INFO ] Computed 8 place invariants in 52 ms
[2023-03-16 18:09:41] [INFO ] Implicit Places using invariants in 792 ms returned []
Implicit Place search using SMT only with invariants took 792 ms to find 0 implicit places.
[2023-03-16 18:09:41] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-16 18:09:41] [INFO ] Invariant cache hit.
[2023-03-16 18:09:49] [INFO ] Dead Transitions using invariants and state equation in 7744 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8572 ms. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RERS2020-PT-pb103-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s116 1) (EQ s496 1)) (AND (EQ s11 1) (EQ s62 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 44 steps with 0 reset in 2 ms.
FORMULA RERS2020-PT-pb103-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLFireability-05 finished in 8689 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((F(p2)||p1)))))'
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 28429/28429 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 512 transition count 28428
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 511 transition count 28439
Applied a total of 4 rules in 235 ms. Remains 511 /513 variables (removed 2) and now considering 28439/28429 (removed -10) transitions.
[2023-03-16 18:09:49] [INFO ] Flow matrix only has 18683 transitions (discarded 9756 similar events)
// Phase 1: matrix 18683 rows 511 cols
[2023-03-16 18:09:50] [INFO ] Computed 8 place invariants in 57 ms
[2023-03-16 18:09:50] [INFO ] Implicit Places using invariants in 818 ms returned []
Implicit Place search using SMT only with invariants took 819 ms to find 0 implicit places.
[2023-03-16 18:09:50] [INFO ] Flow matrix only has 18683 transitions (discarded 9756 similar events)
[2023-03-16 18:09:50] [INFO ] Invariant cache hit.
[2023-03-16 18:09:58] [INFO ] Dead Transitions using invariants and state equation in 7657 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 511/513 places, 28439/28429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8712 ms. Remains : 511/513 places, 28439/28429 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : RERS2020-PT-pb103-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p1:(OR (NEQ s171 1) (NEQ s340 1)), p2:(OR (NEQ s171 1) (NEQ s340 1)), p0:(OR (NEQ s305 1) (NEQ s375 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 2257 ms.
Product exploration explored 100000 steps with 0 reset in 2202 ms.
Computed a total of 119 stabilizing places and 10296 stable transitions
Computed a total of 119 stabilizing places and 10296 stable transitions
Detected a total of 119/511 stabilizing places and 10296/28439 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 373 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 370 ms. (steps per millisecond=27 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 31534 steps, run timeout after 3001 ms. (steps per millisecond=10 ) properties seen :{}
Probabilistic random walk after 31534 steps, saw 21728 distinct states, run finished after 3001 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-16 18:10:07] [INFO ] Flow matrix only has 18683 transitions (discarded 9756 similar events)
[2023-03-16 18:10:07] [INFO ] Invariant cache hit.
[2023-03-16 18:10:07] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 18:10:11] [INFO ] After 3849ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:2
[2023-03-16 18:10:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 18:10:14] [INFO ] After 3579ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2023-03-16 18:10:14] [INFO ] State equation strengthened by 1380 read => feed constraints.
[2023-03-16 18:10:22] [INFO ] After 7754ms SMT Verify possible using 1380 Read/Feed constraints in natural domain returned unsat :3 sat :2
[2023-03-16 18:10:25] [INFO ] Deduced a trap composed of 96 places in 1593 ms of which 4 ms to minimize.
[2023-03-16 18:10:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 1873 ms
[2023-03-16 18:10:25] [INFO ] After 10190ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :0
[2023-03-16 18:10:25] [INFO ] After 13983ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p1) p0 (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p2)))), (G (NOT (AND p1 (NOT p0) (NOT p2)))), (G (NOT (AND p1 p0 (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p1) p0 (NOT p2))))
Knowledge based reduction with 15 factoid took 368 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RERS2020-PT-pb103-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RERS2020-PT-pb103-LTLFireability-06 finished in 35844 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 5 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 511 transition count 28427
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
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 4 place count 510 transition count 28438
Applied a total of 4 rules in 217 ms. Remains 510 /513 variables (removed 3) and now considering 28438/28429 (removed -9) transitions.
[2023-03-16 18:10:25] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
// Phase 1: matrix 18682 rows 510 cols
[2023-03-16 18:10:25] [INFO ] Computed 8 place invariants in 57 ms
[2023-03-16 18:10:26] [INFO ] Implicit Places using invariants in 791 ms returned []
Implicit Place search using SMT only with invariants took 792 ms to find 0 implicit places.
[2023-03-16 18:10:26] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-16 18:10:26] [INFO ] Invariant cache hit.
[2023-03-16 18:10:34] [INFO ] Dead Transitions using invariants and state equation in 7647 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 510/513 places, 28438/28429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8659 ms. Remains : 510/513 places, 28438/28429 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : RERS2020-PT-pb103-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (EQ s32 0) (EQ s148 0)) (OR (EQ s388 0) (EQ s469 0)) (OR (EQ s32 0) (EQ s92 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 2225 ms.
Product exploration explored 100000 steps with 0 reset in 2198 ms.
Computed a total of 118 stabilizing places and 10295 stable transitions
Computed a total of 118 stabilizing places and 10295 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 37109 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 37109 steps, saw 25305 distinct states, run finished after 3002 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 18:10:42] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-16 18:10:42] [INFO ] Invariant cache hit.
[2023-03-16 18:10:42] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 18:10:42] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 18:10:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 18:10:45] [INFO ] After 3433ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 18:10:46] [INFO ] State equation strengthened by 1380 read => feed constraints.
[2023-03-16 18:10:52] [INFO ] After 6587ms SMT Verify possible using 1380 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 18:10:55] [INFO ] Deduced a trap composed of 72 places in 1460 ms of which 1 ms to minimize.
[2023-03-16 18:10:57] [INFO ] Deduced a trap composed of 117 places in 1439 ms of which 1 ms to minimize.
[2023-03-16 18:10:59] [INFO ] Deduced a trap composed of 84 places in 1583 ms of which 2 ms to minimize.
[2023-03-16 18:11:01] [INFO ] Deduced a trap composed of 30 places in 1555 ms of which 1 ms to minimize.
[2023-03-16 18:11:03] [INFO ] Deduced a trap composed of 119 places in 1621 ms of which 0 ms to minimize.
[2023-03-16 18:11:05] [INFO ] Deduced a trap composed of 84 places in 1644 ms of which 1 ms to minimize.
[2023-03-16 18:11:05] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 12148 ms
[2023-03-16 18:11:05] [INFO ] After 19842ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 897 ms.
[2023-03-16 18:11:06] [INFO ] After 24369ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 510 transition count 27376
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1074 place count 510 transition count 27364
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1174 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1175 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1176 place count 497 transition count 27456
Applied a total of 1176 rules in 360 ms. Remains 497 /510 variables (removed 13) and now considering 27456/28438 (removed 982) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 360 ms. Remains : 497/510 places, 27456/28438 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Finished Best-First random walk after 4172 steps, including 2 resets, run visited all 1 properties in 11 ms. (steps per millisecond=379 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Support contains 5 out of 510 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Applied a total of 0 rules in 100 ms. Remains 510 /510 variables (removed 0) and now considering 28438/28438 (removed 0) transitions.
[2023-03-16 18:11:07] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-16 18:11:07] [INFO ] Invariant cache hit.
[2023-03-16 18:11:08] [INFO ] Implicit Places using invariants in 769 ms returned []
Implicit Place search using SMT only with invariants took 770 ms to find 0 implicit places.
[2023-03-16 18:11:08] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-16 18:11:08] [INFO ] Invariant cache hit.
[2023-03-16 18:11:16] [INFO ] Dead Transitions using invariants and state equation in 7774 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8646 ms. Remains : 510/510 places, 28438/28438 transitions.
Computed a total of 118 stabilizing places and 10295 stable transitions
Computed a total of 118 stabilizing places and 10295 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 1) seen :0
Finished Best-First random walk after 34 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=17 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 2224 ms.
Product exploration explored 100000 steps with 0 reset in 1930 ms.
Built C files in :
/tmp/ltsmin16928183049588326326
[2023-03-16 18:11:21] [INFO ] Too many transitions (28438) to apply POR reductions. Disabling POR matrices.
[2023-03-16 18:11:21] [INFO ] Built C files in 295ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16928183049588326326
Running compilation step : cd /tmp/ltsmin16928183049588326326;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16928183049588326326;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16928183049588326326;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 510 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Applied a total of 0 rules in 104 ms. Remains 510 /510 variables (removed 0) and now considering 28438/28438 (removed 0) transitions.
[2023-03-16 18:11:24] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-16 18:11:24] [INFO ] Invariant cache hit.
[2023-03-16 18:11:25] [INFO ] Implicit Places using invariants in 784 ms returned []
Implicit Place search using SMT only with invariants took 785 ms to find 0 implicit places.
[2023-03-16 18:11:25] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-16 18:11:25] [INFO ] Invariant cache hit.
[2023-03-16 18:11:33] [INFO ] Dead Transitions using invariants and state equation in 7861 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8751 ms. Remains : 510/510 places, 28438/28438 transitions.
Built C files in :
/tmp/ltsmin5156306409155926103
[2023-03-16 18:11:33] [INFO ] Too many transitions (28438) to apply POR reductions. Disabling POR matrices.
[2023-03-16 18:11:33] [INFO ] Built C files in 244ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5156306409155926103
Running compilation step : cd /tmp/ltsmin5156306409155926103;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5156306409155926103;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5156306409155926103;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-16 18:11:38] [INFO ] Flatten gal took : 769 ms
[2023-03-16 18:11:38] [INFO ] Flatten gal took : 652 ms
[2023-03-16 18:11:38] [INFO ] Time to serialize gal into /tmp/LTL1753732517999478677.gal : 130 ms
[2023-03-16 18:11:38] [INFO ] Time to serialize properties into /tmp/LTL1344074731967250896.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1753732517999478677.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9691482058861473760.hoa' '-atoms' '/tmp/LTL1344074731967250896.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL1344074731967250896.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9691482058861473760.hoa
Detected timeout of ITS tools.
[2023-03-16 18:11:55] [INFO ] Flatten gal took : 661 ms
[2023-03-16 18:11:55] [INFO ] Flatten gal took : 691 ms
[2023-03-16 18:11:55] [INFO ] Time to serialize gal into /tmp/LTL4274325148793800823.gal : 126 ms
[2023-03-16 18:11:55] [INFO ] Time to serialize properties into /tmp/LTL15428185665629813188.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4274325148793800823.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15428185665629813188.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((((ps500==0)||(ps437==0))&&((ps446==0)||(ps224==0)))&&((ps500==0)||(ps351==0)))"))))
Formula 0 simplified : GF!"((((ps500==0)||(ps437==0))&&((ps446==0)||(ps224==0)))&&((ps500==0)||(ps351==0)))"
Detected timeout of ITS tools.
[2023-03-16 18:12:11] [INFO ] Flatten gal took : 652 ms
[2023-03-16 18:12:11] [INFO ] Applying decomposition
[2023-03-16 18:12:12] [INFO ] Flatten gal took : 767 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2503523504783827116.txt' '-o' '/tmp/graph2503523504783827116.bin' '-w' '/tmp/graph2503523504783827116.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2503523504783827116.bin' '-l' '-1' '-v' '-w' '/tmp/graph2503523504783827116.weights' '-q' '0' '-e' '0.001'
[2023-03-16 18:12:13] [INFO ] Decomposing Gal with order
[2023-03-16 18:12:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 18:12:15] [INFO ] Removed a total of 64251 redundant transitions.
[2023-03-16 18:12:16] [INFO ] Flatten gal took : 1725 ms
[2023-03-16 18:12:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 2065 labels/synchronizations in 804 ms.
[2023-03-16 18:12:17] [INFO ] Time to serialize gal into /tmp/LTL2351664718874284998.gal : 47 ms
[2023-03-16 18:12:17] [INFO ] Time to serialize properties into /tmp/LTL16100698679224918690.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2351664718874284998.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16100698679224918690.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("((((i0.u5.ps500==0)||(i4.i1.u106.ps437==0))&&((i2.u52.ps446==0)||(i3.i1.u25.ps224==0)))&&((i0.u5.ps500==0)||(i1.u27.ps351==0))...161
Formula 0 simplified : GF!"((((i0.u5.ps500==0)||(i4.i1.u106.ps437==0))&&((i2.u52.ps446==0)||(i3.i1.u25.ps224==0)))&&((i0.u5.ps500==0)||(i1.u27.ps351==0)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4597112250353944086
[2023-03-16 18:12:33] [INFO ] Built C files in 202ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4597112250353944086
Running compilation step : cd /tmp/ltsmin4597112250353944086;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4597112250353944086;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4597112250353944086;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property RERS2020-PT-pb103-LTLFireability-07 finished in 130623 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(p0)||(G(p2)&&p1))))))'
Support contains 6 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 31 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2023-03-16 18:12:36] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2023-03-16 18:12:36] [INFO ] Computed 8 place invariants in 54 ms
[2023-03-16 18:12:37] [INFO ] Implicit Places using invariants in 812 ms returned []
Implicit Place search using SMT only with invariants took 813 ms to find 0 implicit places.
[2023-03-16 18:12:37] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-16 18:12:37] [INFO ] Invariant cache hit.
[2023-03-16 18:12:44] [INFO ] Dead Transitions using invariants and state equation in 7840 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8685 ms. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : RERS2020-PT-pb103-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(AND (EQ s438 1) (EQ s446 1)), p1:(AND (EQ s158 1) (EQ s252 1)), p2:(OR (NEQ s7 1) (NEQ s377 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 47 steps with 0 reset in 2 ms.
FORMULA RERS2020-PT-pb103-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLFireability-08 finished in 8952 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(p1)))'
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 31 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2023-03-16 18:12:45] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-16 18:12:45] [INFO ] Invariant cache hit.
[2023-03-16 18:12:45] [INFO ] Implicit Places using invariants in 748 ms returned []
Implicit Place search using SMT only with invariants took 756 ms to find 0 implicit places.
[2023-03-16 18:12:45] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-16 18:12:45] [INFO ] Invariant cache hit.
[2023-03-16 18:12:53] [INFO ] Dead Transitions using invariants and state equation in 7743 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8534 ms. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : RERS2020-PT-pb103-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s34 1) (EQ s331 1)), p1:(AND (EQ s65 1) (EQ s418 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 55 steps with 0 reset in 2 ms.
FORMULA RERS2020-PT-pb103-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLFireability-09 finished in 8710 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&(p1||G(p2)))))'
Support contains 6 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 511 transition count 28427
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 510 transition count 28438
Applied a total of 4 rules in 235 ms. Remains 510 /513 variables (removed 3) and now considering 28438/28429 (removed -9) transitions.
[2023-03-16 18:12:54] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
// Phase 1: matrix 18682 rows 510 cols
[2023-03-16 18:12:54] [INFO ] Computed 8 place invariants in 61 ms
[2023-03-16 18:12:54] [INFO ] Implicit Places using invariants in 821 ms returned []
Implicit Place search using SMT only with invariants took 822 ms to find 0 implicit places.
[2023-03-16 18:12:54] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-16 18:12:54] [INFO ] Invariant cache hit.
[2023-03-16 18:13:03] [INFO ] Dead Transitions using invariants and state equation in 8593 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 510/513 places, 28438/28429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9654 ms. Remains : 510/513 places, 28438/28429 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : RERS2020-PT-pb103-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s109 1) (EQ s450 1)), p2:(AND (EQ s22 1) (EQ s473 1)), p0:(AND (OR (EQ s231 0) (EQ s454 0)) (OR (EQ s22 0) (EQ s473 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 46 steps with 0 reset in 2 ms.
FORMULA RERS2020-PT-pb103-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLFireability-10 finished in 9881 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 511 transition count 28427
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
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 4 place count 510 transition count 28438
Applied a total of 4 rules in 242 ms. Remains 510 /513 variables (removed 3) and now considering 28438/28429 (removed -9) transitions.
[2023-03-16 18:13:03] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-16 18:13:03] [INFO ] Invariant cache hit.
[2023-03-16 18:13:04] [INFO ] Implicit Places using invariants in 879 ms returned []
Implicit Place search using SMT only with invariants took 880 ms to find 0 implicit places.
[2023-03-16 18:13:04] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-16 18:13:04] [INFO ] Invariant cache hit.
[2023-03-16 18:13:12] [INFO ] Dead Transitions using invariants and state equation in 7682 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 510/513 places, 28438/28429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8805 ms. Remains : 510/513 places, 28438/28429 transitions.
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Running random walk in product with property : RERS2020-PT-pb103-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s212 0) (EQ s487 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 2174 ms.
Product exploration explored 100000 steps with 0 reset in 2224 ms.
Computed a total of 118 stabilizing places and 10295 stable transitions
Computed a total of 118 stabilizing places and 10295 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 37454 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 37454 steps, saw 25541 distinct states, run finished after 3001 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 18:13:20] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-16 18:13:20] [INFO ] Invariant cache hit.
[2023-03-16 18:13:20] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 18:13:24] [INFO ] After 3560ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 18:13:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 18:13:27] [INFO ] After 3448ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 18:13:27] [INFO ] State equation strengthened by 1380 read => feed constraints.
[2023-03-16 18:13:33] [INFO ] After 5437ms SMT Verify possible using 1380 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 18:13:35] [INFO ] Deduced a trap composed of 72 places in 1505 ms of which 1 ms to minimize.
[2023-03-16 18:13:37] [INFO ] Deduced a trap composed of 49 places in 1309 ms of which 1 ms to minimize.
[2023-03-16 18:13:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 3415 ms
[2023-03-16 18:13:37] [INFO ] After 9187ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2023-03-16 18:13:37] [INFO ] After 12889ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (G p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G p0)
Knowledge based reduction with 5 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RERS2020-PT-pb103-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RERS2020-PT-pb103-LTLFireability-12 finished in 33461 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p1)||(X(p3)&&p2)||p0)))))'
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 32 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2023-03-16 18:13:37] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2023-03-16 18:13:37] [INFO ] Computed 8 place invariants in 52 ms
[2023-03-16 18:13:38] [INFO ] Implicit Places using invariants in 816 ms returned []
Implicit Place search using SMT only with invariants took 823 ms to find 0 implicit places.
[2023-03-16 18:13:38] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-16 18:13:38] [INFO ] Invariant cache hit.
[2023-03-16 18:13:45] [INFO ] Dead Transitions using invariants and state equation in 7875 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8731 ms. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 247 ms :[true, (NOT p1), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3)))]
Running random walk in product with property : RERS2020-PT-pb103-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=2 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2) p1) (AND (NOT p0) (NOT p2) p3)), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p2 p1) (AND (NOT p0) p2 p3)), acceptance={} source=2 dest: 2}, { cond=(OR (AND p0 p1) (AND p0 p3)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p1:(AND (EQ s48 1) (EQ s149 1)), p0:(OR (EQ s48 0) (EQ s149 0)), p2:(AND (EQ s48 1) (EQ s149 1)), p3:(AND (EQ s147 1) (EQ s344 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 2134 ms.
Product exploration explored 100000 steps with 0 reset in 2219 ms.
Computed a total of 121 stabilizing places and 10286 stable transitions
Computed a total of 121 stabilizing places and 10286 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2) (NOT p3)), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 182 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[true, (NOT p1), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 488 ms. (steps per millisecond=20 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 34568 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 34568 steps, saw 23745 distinct states, run finished after 3001 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 11 properties.
[2023-03-16 18:13:55] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-16 18:13:55] [INFO ] Invariant cache hit.
[2023-03-16 18:13:55] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-16 18:13:59] [INFO ] After 4630ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:7
[2023-03-16 18:14:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 18:14:05] [INFO ] After 5660ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :7
[2023-03-16 18:14:05] [INFO ] State equation strengthened by 1379 read => feed constraints.
[2023-03-16 18:14:13] [INFO ] After 7477ms SMT Verify possible using 1379 Read/Feed constraints in natural domain returned unsat :4 sat :7
[2023-03-16 18:14:15] [INFO ] Deduced a trap composed of 49 places in 1975 ms of which 5 ms to minimize.
[2023-03-16 18:14:17] [INFO ] Deduced a trap composed of 59 places in 1485 ms of which 0 ms to minimize.
[2023-03-16 18:14:20] [INFO ] Deduced a trap composed of 53 places in 1720 ms of which 0 ms to minimize.
[2023-03-16 18:14:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 6517 ms
[2023-03-16 18:14:22] [INFO ] Deduced a trap composed of 50 places in 1923 ms of which 1 ms to minimize.
[2023-03-16 18:14:24] [INFO ] Deduced a trap composed of 22 places in 1723 ms of which 1 ms to minimize.
[2023-03-16 18:14:27] [INFO ] Deduced a trap composed of 9 places in 2097 ms of which 0 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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 18:14:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 18:14:27] [INFO ] After 27124ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0 real:7
Fused 11 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 513 transition count 27367
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1064 place count 512 transition count 27366
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1066 place count 511 transition count 27377
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1078 place count 511 transition count 27365
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1178 place count 499 transition count 27277
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1179 place count 499 transition count 27457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1180 place count 498 transition count 27457
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1181 place count 497 transition count 27456
Applied a total of 1181 rules in 728 ms. Remains 497 /513 variables (removed 16) and now considering 27456/28429 (removed 973) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 729 ms. Remains : 497/513 places, 27456/28429 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 35472 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 35472 steps, saw 25212 distinct states, run finished after 3002 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-16 18:14:31] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-16 18:14:31] [INFO ] Computed 8 place invariants in 55 ms
[2023-03-16 18:14:31] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 18:14:31] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-16 18:14:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 18:14:36] [INFO ] After 4924ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-16 18:14:36] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-16 18:14:44] [INFO ] After 7466ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-16 18:14:46] [INFO ] Deduced a trap composed of 51 places in 1834 ms of which 0 ms to minimize.
[2023-03-16 18:14:48] [INFO ] Deduced a trap composed of 39 places in 1598 ms of which 1 ms to minimize.
[2023-03-16 18:14:50] [INFO ] Deduced a trap composed of 155 places in 1487 ms of which 0 ms to minimize.
[2023-03-16 18:14:52] [INFO ] Deduced a trap composed of 150 places in 1575 ms of which 1 ms to minimize.
[2023-03-16 18:14:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 7831 ms
[2023-03-16 18:14:52] [INFO ] After 15797ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :0
[2023-03-16 18:14:52] [INFO ] After 20974ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 11 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2) (NOT p3)), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (G (AND (NOT p1) (NOT p3))), (G (NOT (AND p1 p0))), (G (NOT (OR (AND p1 (NOT p0) p2) (AND p3 (NOT p0) p2)))), (G (NOT (OR (AND p1 (NOT p0) (NOT p2)) (AND p3 (NOT p0) (NOT p2))))), (G (NOT p1)), (G (NOT (AND p1 (NOT p0) p2))), (G (NOT (AND p1 (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p2)))), (G p0), (G (NOT (OR (AND p1 p0) (AND p3 p0)))), (G (NOT (AND (NOT p0) p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G p0)
Knowledge based reduction with 15 factoid took 341 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RERS2020-PT-pb103-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RERS2020-PT-pb103-LTLFireability-13 finished in 75859 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&p0)))'
Support contains 6 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 31 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2023-03-16 18:14:53] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2023-03-16 18:14:53] [INFO ] Computed 8 place invariants in 53 ms
[2023-03-16 18:14:53] [INFO ] Implicit Places using invariants in 832 ms returned []
Implicit Place search using SMT only with invariants took 832 ms to find 0 implicit places.
[2023-03-16 18:14:53] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-16 18:14:53] [INFO ] Invariant cache hit.
[2023-03-16 18:15:01] [INFO ] Dead Transitions using invariants and state equation in 7868 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8734 ms. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 135 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : RERS2020-PT-pb103-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (EQ s358 0) (EQ s444 0)), p0:(AND (OR (EQ s358 0) (EQ s444 0)) (OR (EQ s46 0) (EQ s90 0)) (OR (EQ s481 0) (EQ s498 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 2232 ms.
Product exploration explored 100000 steps with 0 reset in 2315 ms.
Computed a total of 121 stabilizing places and 10286 stable transitions
Computed a total of 121 stabilizing places and 10286 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), true, (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 203 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 37747 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 37747 steps, saw 25736 distinct states, run finished after 3001 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 18:15:10] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-16 18:15:10] [INFO ] Invariant cache hit.
[2023-03-16 18:15:10] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 18:15:13] [INFO ] After 3477ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 18:15:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 18:15:17] [INFO ] After 3440ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 18:15:17] [INFO ] State equation strengthened by 1379 read => feed constraints.
[2023-03-16 18:15:22] [INFO ] After 5201ms SMT Verify possible using 1379 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 18:15:24] [INFO ] Deduced a trap composed of 96 places in 1485 ms of which 1 ms to minimize.
[2023-03-16 18:15:26] [INFO ] Deduced a trap composed of 61 places in 1692 ms of which 1 ms to minimize.
[2023-03-16 18:15:28] [INFO ] Deduced a trap composed of 50 places in 1787 ms of which 0 ms to minimize.
[2023-03-16 18:15:30] [INFO ] Deduced a trap composed of 155 places in 1780 ms of which 1 ms to minimize.
[2023-03-16 18:15:33] [INFO ] Deduced a trap composed of 22 places in 1839 ms of which 0 ms to minimize.
[2023-03-16 18:15:35] [INFO ] Deduced a trap composed of 135 places in 1893 ms of which 1 ms to minimize.
[2023-03-16 18:15:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 12395 ms
[2023-03-16 18:15:35] [INFO ] After 17985ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2023-03-16 18:15:35] [INFO ] After 21641ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), true, (X (X p1)), (G p1)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G p1)
Knowledge based reduction with 6 factoid took 133 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RERS2020-PT-pb103-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RERS2020-PT-pb103-LTLFireability-14 finished in 42411 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 512 transition count 28428
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 511 transition count 28439
Applied a total of 4 rules in 217 ms. Remains 511 /513 variables (removed 2) and now considering 28439/28429 (removed -10) transitions.
[2023-03-16 18:15:35] [INFO ] Flow matrix only has 18683 transitions (discarded 9756 similar events)
// Phase 1: matrix 18683 rows 511 cols
[2023-03-16 18:15:35] [INFO ] Computed 8 place invariants in 55 ms
[2023-03-16 18:15:36] [INFO ] Implicit Places using invariants in 823 ms returned []
Implicit Place search using SMT only with invariants took 823 ms to find 0 implicit places.
[2023-03-16 18:15:36] [INFO ] Flow matrix only has 18683 transitions (discarded 9756 similar events)
[2023-03-16 18:15:36] [INFO ] Invariant cache hit.
[2023-03-16 18:15:44] [INFO ] Dead Transitions using invariants and state equation in 7919 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 511/513 places, 28439/28429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8961 ms. Remains : 511/513 places, 28439/28429 transitions.
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : RERS2020-PT-pb103-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s349 1) (EQ s426 1)), p1:(OR (EQ s150 0) (EQ s322 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 2267 ms.
Product exploration explored 100000 steps with 1 reset in 2333 ms.
Computed a total of 119 stabilizing places and 10296 stable transitions
Computed a total of 119 stabilizing places and 10296 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 387 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 34869 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 34869 steps, saw 23921 distinct states, run finished after 3001 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-16 18:15:53] [INFO ] Flow matrix only has 18683 transitions (discarded 9756 similar events)
[2023-03-16 18:15:53] [INFO ] Invariant cache hit.
[2023-03-16 18:15:53] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 18:15:57] [INFO ] After 4093ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-16 18:15:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 18:16:02] [INFO ] After 4765ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-16 18:16:02] [INFO ] State equation strengthened by 1380 read => feed constraints.
[2023-03-16 18:16:08] [INFO ] After 5572ms SMT Verify possible using 1380 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-16 18:16:10] [INFO ] Deduced a trap composed of 44 places in 1863 ms of which 1 ms to minimize.
[2023-03-16 18:16:12] [INFO ] Deduced a trap composed of 73 places in 1543 ms of which 0 ms to minimize.
[2023-03-16 18:16:14] [INFO ] Deduced a trap composed of 61 places in 1536 ms of which 1 ms to minimize.
[2023-03-16 18:16:16] [INFO ] Deduced a trap composed of 31 places in 1557 ms of which 0 ms to minimize.
[2023-03-16 18:16:18] [INFO ] Deduced a trap composed of 84 places in 1757 ms of which 0 ms to minimize.
[2023-03-16 18:16:19] [INFO ] Deduced a trap composed of 96 places in 1296 ms of which 0 ms to minimize.
[2023-03-16 18:16:21] [INFO ] Deduced a trap composed of 69 places in 1688 ms of which 1 ms to minimize.
[2023-03-16 18:16:23] [INFO ] Deduced a trap composed of 50 places in 1334 ms of which 2 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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 18:16:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 18:16:23] [INFO ] After 26287ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 12 ms.
Support contains 4 out of 511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 28439/28439 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 511 transition count 27377
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1074 place count 511 transition count 27365
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1174 place count 499 transition count 27277
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1175 place count 499 transition count 27457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1176 place count 498 transition count 27457
Applied a total of 1176 rules in 440 ms. Remains 498 /511 variables (removed 13) and now considering 27457/28439 (removed 982) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 441 ms. Remains : 498/511 places, 27457/28439 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 369 ms. (steps per millisecond=27 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 35984 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 35984 steps, saw 25555 distinct states, run finished after 3002 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-16 18:16:27] [INFO ] Flow matrix only has 18728 transitions (discarded 8729 similar events)
// Phase 1: matrix 18728 rows 498 cols
[2023-03-16 18:16:27] [INFO ] Computed 8 place invariants in 51 ms
[2023-03-16 18:16:28] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 18:16:31] [INFO ] After 4085ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-16 18:16:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 18:16:36] [INFO ] After 4729ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-16 18:16:36] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-16 18:16:44] [INFO ] After 7693ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-16 18:16:46] [INFO ] Deduced a trap composed of 48 places in 1543 ms of which 0 ms to minimize.
[2023-03-16 18:16:48] [INFO ] Deduced a trap composed of 20 places in 1384 ms of which 0 ms to minimize.
[2023-03-16 18:16:50] [INFO ] Deduced a trap composed of 50 places in 1372 ms of which 1 ms to minimize.
[2023-03-16 18:16:51] [INFO ] Deduced a trap composed of 73 places in 950 ms of which 0 ms to minimize.
[2023-03-16 18:16:52] [INFO ] Deduced a trap composed of 93 places in 1153 ms of which 2 ms to minimize.
[2023-03-16 18:16:55] [INFO ] Deduced a trap composed of 102 places in 1677 ms of which 1 ms to minimize.
[2023-03-16 18:16:57] [INFO ] Deduced a trap composed of 148 places in 1640 ms of which 1 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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 18:16:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 18:16:57] [INFO ] After 25224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 27457/27457 transitions.
Applied a total of 0 rules in 90 ms. Remains 498 /498 variables (removed 0) and now considering 27457/27457 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 498/498 places, 27457/27457 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 27457/27457 transitions.
Applied a total of 0 rules in 91 ms. Remains 498 /498 variables (removed 0) and now considering 27457/27457 (removed 0) transitions.
[2023-03-16 18:16:57] [INFO ] Flow matrix only has 18728 transitions (discarded 8729 similar events)
[2023-03-16 18:16:57] [INFO ] Invariant cache hit.
[2023-03-16 18:16:58] [INFO ] Implicit Places using invariants in 936 ms returned []
Implicit Place search using SMT only with invariants took 937 ms to find 0 implicit places.
[2023-03-16 18:16:58] [INFO ] Flow matrix only has 18728 transitions (discarded 8729 similar events)
[2023-03-16 18:16:58] [INFO ] Invariant cache hit.
[2023-03-16 18:17:06] [INFO ] Dead Transitions using invariants and state equation in 7669 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8699 ms. Remains : 498/498 places, 27457/27457 transitions.
Graph (trivial) has 10049 edges and 498 vertex of which 377 / 498 are part of one of the 61 SCC in 4 ms
Free SCC test removed 316 places
Drop transitions removed 11111 transitions
Ensure Unique test removed 13707 transitions
Reduce isomorphic transitions removed 24818 transitions.
Graph (complete) has 2436 edges and 182 vertex of which 174 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 13 rules applied. Total rules applied 15 place count 174 transition count 2626
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 172 transition count 2626
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 19 place count 170 transition count 2606
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 170 transition count 2606
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 170 transition count 2605
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 169 transition count 2604
Drop transitions removed 1442 transitions
Redundant transition composition rules discarded 1442 transitions
Iterating global reduction 3 with 1442 rules applied. Total rules applied 1466 place count 169 transition count 1162
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1430 edges and 168 vertex of which 153 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Iterating post reduction 3 with 4 rules applied. Total rules applied 1470 place count 153 transition count 1158
Drop transitions removed 52 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 4 with 53 rules applied. Total rules applied 1523 place count 153 transition count 1105
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1524 place count 152 transition count 1100
Iterating global reduction 5 with 1 rules applied. Total rules applied 1525 place count 152 transition count 1100
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1529 place count 150 transition count 1098
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 1540 place count 150 transition count 1087
Free-agglomeration rule applied 12 times with reduction of 7 identical transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 1552 place count 150 transition count 1068
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 1574 place count 138 transition count 1058
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1575 place count 137 transition count 1053
Iterating global reduction 6 with 1 rules applied. Total rules applied 1576 place count 137 transition count 1053
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1577 place count 137 transition count 1052
Drop transitions removed 57 transitions
Redundant transition composition rules discarded 57 transitions
Iterating global reduction 7 with 57 rules applied. Total rules applied 1634 place count 137 transition count 995
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1640 place count 137 transition count 989
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1650 place count 131 transition count 985
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 1656 place count 131 transition count 979
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1658 place count 131 transition count 977
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1662 place count 129 transition count 975
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 1666 place count 129 transition count 971
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1668 place count 129 transition count 969
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1672 place count 127 transition count 967
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1674 place count 127 transition count 965
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 10 with 3 rules applied. Total rules applied 1677 place count 127 transition count 1047
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 10 with 14 rules applied. Total rules applied 1691 place count 124 transition count 1036
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 11 with 19 rules applied. Total rules applied 1710 place count 124 transition count 1017
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 1715 place count 124 transition count 1017
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 1718 place count 124 transition count 1014
Applied a total of 1718 rules in 354 ms. Remains 124 /498 variables (removed 374) and now considering 1014/27457 (removed 26443) transitions.
Running SMT prover for 4 properties.
[2023-03-16 18:17:06] [INFO ] Flow matrix only has 979 transitions (discarded 35 similar events)
// Phase 1: matrix 979 rows 124 cols
[2023-03-16 18:17:06] [INFO ] Computed 0 place invariants in 8 ms
[2023-03-16 18:17:06] [INFO ] After 246ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-16 18:17:07] [INFO ] After 310ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-16 18:17:07] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-16 18:17:07] [INFO ] After 192ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-16 18:17:07] [INFO ] After 441ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 211 ms.
[2023-03-16 18:17:07] [INFO ] After 1008ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 457 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Support contains 4 out of 511 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 511/511 places, 28439/28439 transitions.
Applied a total of 0 rules in 114 ms. Remains 511 /511 variables (removed 0) and now considering 28439/28439 (removed 0) transitions.
[2023-03-16 18:17:08] [INFO ] Flow matrix only has 18683 transitions (discarded 9756 similar events)
// Phase 1: matrix 18683 rows 511 cols
[2023-03-16 18:17:08] [INFO ] Computed 8 place invariants in 73 ms
[2023-03-16 18:17:09] [INFO ] Implicit Places using invariants in 827 ms returned []
Implicit Place search using SMT only with invariants took 828 ms to find 0 implicit places.
[2023-03-16 18:17:09] [INFO ] Flow matrix only has 18683 transitions (discarded 9756 similar events)
[2023-03-16 18:17:09] [INFO ] Invariant cache hit.
[2023-03-16 18:17:16] [INFO ] Dead Transitions using invariants and state equation in 7768 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8711 ms. Remains : 511/511 places, 28439/28439 transitions.
Computed a total of 119 stabilizing places and 10296 stable transitions
Computed a total of 119 stabilizing places and 10296 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 335 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 397 ms. (steps per millisecond=25 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 32200 steps, run timeout after 3001 ms. (steps per millisecond=10 ) properties seen :{}
Probabilistic random walk after 32200 steps, saw 22151 distinct states, run finished after 3001 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-16 18:17:21] [INFO ] Flow matrix only has 18683 transitions (discarded 9756 similar events)
[2023-03-16 18:17:21] [INFO ] Invariant cache hit.
[2023-03-16 18:17:21] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 18:17:25] [INFO ] After 4202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-16 18:17:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 18:17:30] [INFO ] After 4726ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-16 18:17:30] [INFO ] State equation strengthened by 1380 read => feed constraints.
[2023-03-16 18:17:36] [INFO ] After 5654ms SMT Verify possible using 1380 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-16 18:17:38] [INFO ] Deduced a trap composed of 44 places in 1675 ms of which 11 ms to minimize.
[2023-03-16 18:17:40] [INFO ] Deduced a trap composed of 73 places in 1653 ms of which 0 ms to minimize.
[2023-03-16 18:17:42] [INFO ] Deduced a trap composed of 61 places in 1515 ms of which 1 ms to minimize.
[2023-03-16 18:17:44] [INFO ] Deduced a trap composed of 31 places in 1433 ms of which 0 ms to minimize.
[2023-03-16 18:17:45] [INFO ] Deduced a trap composed of 84 places in 1568 ms of which 0 ms to minimize.
[2023-03-16 18:17:47] [INFO ] Deduced a trap composed of 96 places in 1237 ms of which 0 ms to minimize.
[2023-03-16 18:17:49] [INFO ] Deduced a trap composed of 69 places in 1690 ms of which 1 ms to minimize.
[2023-03-16 18:17:51] [INFO ] Deduced a trap composed of 50 places in 1275 ms of which 0 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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 18:17:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 18:17:51] [INFO ] After 25813ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 11 ms.
Support contains 4 out of 511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 28439/28439 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 511 transition count 27377
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1074 place count 511 transition count 27365
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1174 place count 499 transition count 27277
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1175 place count 499 transition count 27457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1176 place count 498 transition count 27457
Applied a total of 1176 rules in 376 ms. Remains 498 /511 variables (removed 13) and now considering 27457/28439 (removed 982) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 377 ms. Remains : 498/511 places, 27457/28439 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 35000 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 35000 steps, saw 24897 distinct states, run finished after 3004 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-16 18:17:55] [INFO ] Flow matrix only has 18728 transitions (discarded 8729 similar events)
// Phase 1: matrix 18728 rows 498 cols
[2023-03-16 18:17:55] [INFO ] Computed 8 place invariants in 51 ms
[2023-03-16 18:17:55] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 18:17:59] [INFO ] After 4048ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-16 18:17:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 18:18:04] [INFO ] After 4862ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-16 18:18:04] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-16 18:18:12] [INFO ] After 8191ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-16 18:18:14] [INFO ] Deduced a trap composed of 48 places in 1648 ms of which 0 ms to minimize.
[2023-03-16 18:18:16] [INFO ] Deduced a trap composed of 20 places in 1399 ms of which 1 ms to minimize.
[2023-03-16 18:18:18] [INFO ] Deduced a trap composed of 50 places in 1396 ms of which 1 ms to minimize.
[2023-03-16 18:18:19] [INFO ] Deduced a trap composed of 73 places in 970 ms of which 0 ms to minimize.
[2023-03-16 18:18:21] [INFO ] Deduced a trap composed of 93 places in 1119 ms of which 0 ms to minimize.
[2023-03-16 18:18:23] [INFO ] Deduced a trap composed of 102 places in 1729 ms of which 1 ms to minimize.
[2023-03-16 18:18:25] [INFO ] Deduced a trap composed of 148 places in 1578 ms of which 0 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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 18:18:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 18:18:25] [INFO ] After 26016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 27457/27457 transitions.
Applied a total of 0 rules in 102 ms. Remains 498 /498 variables (removed 0) and now considering 27457/27457 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 498/498 places, 27457/27457 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 27457/27457 transitions.
Applied a total of 0 rules in 88 ms. Remains 498 /498 variables (removed 0) and now considering 27457/27457 (removed 0) transitions.
[2023-03-16 18:18:25] [INFO ] Flow matrix only has 18728 transitions (discarded 8729 similar events)
[2023-03-16 18:18:25] [INFO ] Invariant cache hit.
[2023-03-16 18:18:26] [INFO ] Implicit Places using invariants in 974 ms returned []
Implicit Place search using SMT only with invariants took 980 ms to find 0 implicit places.
[2023-03-16 18:18:26] [INFO ] Flow matrix only has 18728 transitions (discarded 8729 similar events)
[2023-03-16 18:18:26] [INFO ] Invariant cache hit.
[2023-03-16 18:18:34] [INFO ] Dead Transitions using invariants and state equation in 8168 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9240 ms. Remains : 498/498 places, 27457/27457 transitions.
Graph (trivial) has 10049 edges and 498 vertex of which 377 / 498 are part of one of the 61 SCC in 2 ms
Free SCC test removed 316 places
Drop transitions removed 11111 transitions
Ensure Unique test removed 13707 transitions
Reduce isomorphic transitions removed 24818 transitions.
Graph (complete) has 2436 edges and 182 vertex of which 174 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 13 rules applied. Total rules applied 15 place count 174 transition count 2626
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 172 transition count 2626
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 19 place count 170 transition count 2606
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 170 transition count 2606
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 170 transition count 2605
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 169 transition count 2604
Drop transitions removed 1442 transitions
Redundant transition composition rules discarded 1442 transitions
Iterating global reduction 3 with 1442 rules applied. Total rules applied 1466 place count 169 transition count 1162
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1430 edges and 168 vertex of which 153 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Iterating post reduction 3 with 4 rules applied. Total rules applied 1470 place count 153 transition count 1158
Drop transitions removed 52 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 4 with 53 rules applied. Total rules applied 1523 place count 153 transition count 1105
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1524 place count 152 transition count 1100
Iterating global reduction 5 with 1 rules applied. Total rules applied 1525 place count 152 transition count 1100
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1529 place count 150 transition count 1098
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 1540 place count 150 transition count 1087
Free-agglomeration rule applied 12 times with reduction of 7 identical transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 1552 place count 150 transition count 1068
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 1574 place count 138 transition count 1058
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1575 place count 137 transition count 1053
Iterating global reduction 6 with 1 rules applied. Total rules applied 1576 place count 137 transition count 1053
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1577 place count 137 transition count 1052
Drop transitions removed 57 transitions
Redundant transition composition rules discarded 57 transitions
Iterating global reduction 7 with 57 rules applied. Total rules applied 1634 place count 137 transition count 995
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1640 place count 137 transition count 989
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1650 place count 131 transition count 985
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 1656 place count 131 transition count 979
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1658 place count 131 transition count 977
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1662 place count 129 transition count 975
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 1666 place count 129 transition count 971
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1668 place count 129 transition count 969
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1672 place count 127 transition count 967
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1674 place count 127 transition count 965
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 10 with 3 rules applied. Total rules applied 1677 place count 127 transition count 1047
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 10 with 14 rules applied. Total rules applied 1691 place count 124 transition count 1036
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 11 with 19 rules applied. Total rules applied 1710 place count 124 transition count 1017
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 1715 place count 124 transition count 1017
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 1718 place count 124 transition count 1014
Applied a total of 1718 rules in 274 ms. Remains 124 /498 variables (removed 374) and now considering 1014/27457 (removed 26443) transitions.
Running SMT prover for 4 properties.
[2023-03-16 18:18:35] [INFO ] Flow matrix only has 979 transitions (discarded 35 similar events)
// Phase 1: matrix 979 rows 124 cols
[2023-03-16 18:18:35] [INFO ] Computed 0 place invariants in 6 ms
[2023-03-16 18:18:35] [INFO ] After 270ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-16 18:18:35] [INFO ] After 321ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-16 18:18:35] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-16 18:18:35] [INFO ] After 191ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-16 18:18:36] [INFO ] After 440ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 216 ms.
[2023-03-16 18:18:36] [INFO ] After 1027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 295 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 2982 ms.
Product exploration explored 100000 steps with 0 reset in 2286 ms.
Built C files in :
/tmp/ltsmin17734781941528431614
[2023-03-16 18:18:42] [INFO ] Too many transitions (28439) to apply POR reductions. Disabling POR matrices.
[2023-03-16 18:18:42] [INFO ] Built C files in 184ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17734781941528431614
Running compilation step : cd /tmp/ltsmin17734781941528431614;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17734781941528431614;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17734781941528431614;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 511 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 511/511 places, 28439/28439 transitions.
Applied a total of 0 rules in 103 ms. Remains 511 /511 variables (removed 0) and now considering 28439/28439 (removed 0) transitions.
[2023-03-16 18:18:45] [INFO ] Flow matrix only has 18683 transitions (discarded 9756 similar events)
// Phase 1: matrix 18683 rows 511 cols
[2023-03-16 18:18:45] [INFO ] Computed 8 place invariants in 56 ms
[2023-03-16 18:18:46] [INFO ] Implicit Places using invariants in 832 ms returned []
Implicit Place search using SMT only with invariants took 833 ms to find 0 implicit places.
[2023-03-16 18:18:46] [INFO ] Flow matrix only has 18683 transitions (discarded 9756 similar events)
[2023-03-16 18:18:46] [INFO ] Invariant cache hit.
[2023-03-16 18:18:54] [INFO ] Dead Transitions using invariants and state equation in 7969 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8906 ms. Remains : 511/511 places, 28439/28439 transitions.
Built C files in :
/tmp/ltsmin16450997983640400079
[2023-03-16 18:18:54] [INFO ] Too many transitions (28439) to apply POR reductions. Disabling POR matrices.
[2023-03-16 18:18:54] [INFO ] Built C files in 165ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16450997983640400079
Running compilation step : cd /tmp/ltsmin16450997983640400079;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16450997983640400079;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16450997983640400079;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-16 18:18:58] [INFO ] Flatten gal took : 705 ms
[2023-03-16 18:18:59] [INFO ] Flatten gal took : 678 ms
[2023-03-16 18:18:59] [INFO ] Time to serialize gal into /tmp/LTL12707304409136548736.gal : 96 ms
[2023-03-16 18:18:59] [INFO ] Time to serialize properties into /tmp/LTL10853444793818900156.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12707304409136548736.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1201575566539193536.hoa' '-atoms' '/tmp/LTL10853444793818900156.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10853444793818900156.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1201575566539193536.hoa
Detected timeout of ITS tools.
[2023-03-16 18:19:15] [INFO ] Flatten gal took : 648 ms
[2023-03-16 18:19:16] [INFO ] Flatten gal took : 681 ms
[2023-03-16 18:19:16] [INFO ] Time to serialize gal into /tmp/LTL890545426722454313.gal : 121 ms
[2023-03-16 18:19:16] [INFO ] Time to serialize properties into /tmp/LTL13026155361969439961.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL890545426722454313.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13026155361969439961.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((G("((ps2==1)&&(ps98==1))"))||(G("((ps208==0)||(ps511==0))")))))
Formula 0 simplified : G(F!"((ps2==1)&&(ps98==1))" & F!"((ps208==0)||(ps511==0))")
Detected timeout of ITS tools.
[2023-03-16 18:19:32] [INFO ] Flatten gal took : 677 ms
[2023-03-16 18:19:32] [INFO ] Applying decomposition
[2023-03-16 18:19:32] [INFO ] Flatten gal took : 698 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13891751395379590022.txt' '-o' '/tmp/graph13891751395379590022.bin' '-w' '/tmp/graph13891751395379590022.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13891751395379590022.bin' '-l' '-1' '-v' '-w' '/tmp/graph13891751395379590022.weights' '-q' '0' '-e' '0.001'
[2023-03-16 18:19:34] [INFO ] Decomposing Gal with order
[2023-03-16 18:19:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 18:19:36] [INFO ] Removed a total of 64218 redundant transitions.
[2023-03-16 18:19:36] [INFO ] Flatten gal took : 1268 ms
[2023-03-16 18:19:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 2135 labels/synchronizations in 573 ms.
[2023-03-16 18:19:37] [INFO ] Time to serialize gal into /tmp/LTL1773672478179116928.gal : 30 ms
[2023-03-16 18:19:37] [INFO ] Time to serialize properties into /tmp/LTL9427808388195798758.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1773672478179116928.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9427808388195798758.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F((G("((i7.u98.ps2==1)&&(i7.u98.ps98==1))"))||(G("((i3.i0.u60.ps208==0)||(i3.i1.u70.ps511==0))")))))
Formula 0 simplified : G(F!"((i7.u98.ps2==1)&&(i7.u98.ps98==1))" & F!"((i3.i0.u60.ps208==0)||(i3.i1.u70.ps511==0))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9897766715709841436
[2023-03-16 18:19:52] [INFO ] Built C files in 159ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9897766715709841436
Running compilation step : cd /tmp/ltsmin9897766715709841436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9897766715709841436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9897766715709841436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property RERS2020-PT-pb103-LTLFireability-15 finished in 259978 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
[2023-03-16 18:19:56] [INFO ] Flatten gal took : 665 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17042319757379630682
[2023-03-16 18:19:56] [INFO ] Too many transitions (28429) to apply POR reductions. Disabling POR matrices.
[2023-03-16 18:19:56] [INFO ] Built C files in 167ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17042319757379630682
Running compilation step : cd /tmp/ltsmin17042319757379630682;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-16 18:19:57] [INFO ] Applying decomposition
[2023-03-16 18:19:58] [INFO ] Flatten gal took : 809 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7984138941692758823.txt' '-o' '/tmp/graph7984138941692758823.bin' '-w' '/tmp/graph7984138941692758823.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7984138941692758823.bin' '-l' '-1' '-v' '-w' '/tmp/graph7984138941692758823.weights' '-q' '0' '-e' '0.001'
[2023-03-16 18:19:59] [INFO ] Decomposing Gal with order
[2023-03-16 18:19:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 18:20:00] [INFO ] Removed a total of 64816 redundant transitions.
[2023-03-16 18:20:01] [INFO ] Flatten gal took : 1197 ms
[2023-03-16 18:20:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 2192 labels/synchronizations in 616 ms.
[2023-03-16 18:20:02] [INFO ] Time to serialize gal into /tmp/LTLFireability634043303199653495.gal : 28 ms
[2023-03-16 18:20:02] [INFO ] Time to serialize properties into /tmp/LTLFireability16071763096959800857.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability634043303199653495.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16071763096959800857.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((F(G("((((i1.i0.u105.ps500==0)||(i3.i1.u116.ps437==0))&&((i1.i0.u17.ps446==0)||(i5.i2.u117.ps224==0)))&&((i1.i0.u105.ps500==0)||(i2....175
Formula 0 simplified : GF!"((((i1.i0.u105.ps500==0)||(i3.i1.u116.ps437==0))&&((i1.i0.u17.ps446==0)||(i5.i2.u117.ps224==0)))&&((i1.i0.u105.ps500==0)||(i2.u3...169
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17042319757379630682;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 360 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17042319757379630682;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 360 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Reverse transition relation is NOT exact ! Due to transitions t227, t290, t622, t638, t654, t702, t719, t735, t750, t1038, t1046, t1069, t1387, t1451, t146...2175
Computing Next relation with stutter on 6 deadlock states
Detected timeout of ITS tools.
[2023-03-16 18:44:21] [INFO ] Applying decomposition
[2023-03-16 18:44:22] [INFO ] Flatten gal took : 705 ms
[2023-03-16 18:44:22] [INFO ] Decomposing Gal with order
[2023-03-16 18:44:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 18:44:29] [INFO ] Removed a total of 54565 redundant transitions.
[2023-03-16 18:44:29] [INFO ] Flatten gal took : 6295 ms
[2023-03-16 18:44:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 1537 labels/synchronizations in 877 ms.
[2023-03-16 18:44:30] [INFO ] Time to serialize gal into /tmp/LTLFireability8523990582051122912.gal : 6 ms
[2023-03-16 18:44:30] [INFO ] Time to serialize properties into /tmp/LTLFireability6911458012085829562.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8523990582051122912.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6911458012085829562.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((F(G("((((ucomponent6.ps500==0)||(ucomponent5.ps437==0))&&((ucomponent6.ps446==0)||(ucomponent3.ps224==0)))&&((ucomponent6.ps500==0)...186
Formula 0 simplified : GF!"((((ucomponent6.ps500==0)||(ucomponent5.ps437==0))&&((ucomponent6.ps446==0)||(ucomponent3.ps224==0)))&&((ucomponent6.ps500==0)||...180
Reverse transition relation is NOT exact ! Due to transitions t725, t3185, t3188, t3523, t4826, t4831, t6708, t6709, t7406, t7436, t7445, t7563, t7979, t83...936
Computing Next relation with stutter on 6 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
16183 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,161.966,2319500,1,0,2.9849e+06,1.65141e+06,1459,2.60124e+06,6637,1.92503e+07,3794331
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA RERS2020-PT-pb103-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F((G("((ucomponent0.ps2==1)&&(ucomponent1.ps98==1))"))||(G("((ucomponent3.ps208==0)||(ucomponent7.ps511==0))")))))
Formula 1 simplified : G(F!"((ucomponent0.ps2==1)&&(ucomponent1.ps98==1))" & F!"((ucomponent3.ps208==0)||(ucomponent7.ps511==0))")
Computing Next relation with stutter on 6 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
17135 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,333.312,2678968,1,0,3.0086e+06,2.37012e+06,1465,2.64002e+06,6603,2.80264e+07,3105511
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA RERS2020-PT-pb103-LTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 2602819 ms.
BK_STOP 1678992621212
--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="RERS2020-PT-pb103"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is RERS2020-PT-pb103, 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 r325-tall-167889196900236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RERS2020-PT-pb103.tgz
mv RERS2020-PT-pb103 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 '
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 ;