Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.6K Feb 25 22:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 22:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 22:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 22:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 22:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 25 22:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 22:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 22:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 15M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CANConstruction-PT-100-LTLFireability-00
FORMULA_NAME CANConstruction-PT-100-LTLFireability-01
FORMULA_NAME CANConstruction-PT-100-LTLFireability-02
FORMULA_NAME CANConstruction-PT-100-LTLFireability-03
FORMULA_NAME CANConstruction-PT-100-LTLFireability-04
FORMULA_NAME CANConstruction-PT-100-LTLFireability-05
FORMULA_NAME CANConstruction-PT-100-LTLFireability-06
FORMULA_NAME CANConstruction-PT-100-LTLFireability-07
FORMULA_NAME CANConstruction-PT-100-LTLFireability-08
FORMULA_NAME CANConstruction-PT-100-LTLFireability-09
FORMULA_NAME CANConstruction-PT-100-LTLFireability-10
FORMULA_NAME CANConstruction-PT-100-LTLFireability-11
FORMULA_NAME CANConstruction-PT-100-LTLFireability-12
FORMULA_NAME CANConstruction-PT-100-LTLFireability-13
FORMULA_NAME CANConstruction-PT-100-LTLFireability-14
FORMULA_NAME CANConstruction-PT-100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678505266102

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-100
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 03:27:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 03:27:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:27:48] [INFO ] Load time of PNML (sax parser for PT used): 666 ms
[2023-03-11 03:27:49] [INFO ] Transformed 21202 places.
[2023-03-11 03:27:49] [INFO ] Transformed 40800 transitions.
[2023-03-11 03:27:49] [INFO ] Parsed PT model containing 21202 places and 40800 transitions and 122000 arcs in 926 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Support contains 52 out of 21202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 323 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
// Phase 1: matrix 40800 rows 21202 cols
[2023-03-11 03:27:50] [INFO ] Computed 201 place invariants in 790 ms
[2023-03-11 03:27:53] [INFO ] Implicit Places using invariants in 4034 ms returned []
Implicit Place search using SMT only with invariants took 4069 ms to find 0 implicit places.
[2023-03-11 03:27:54] [INFO ] Invariant cache hit.
[2023-03-11 03:27:56] [INFO ] Dead Transitions using invariants and state equation in 2608 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7015 ms. Remains : 21202/21202 places, 40800/40800 transitions.
Support contains 52 out of 21202 places after structural reductions.
[2023-03-11 03:27:58] [INFO ] Flatten gal took : 1318 ms
[2023-03-11 03:27:59] [INFO ] Flatten gal took : 1144 ms
[2023-03-11 03:28:01] [INFO ] Input system was already deterministic with 40800 transitions.
Support contains 51 out of 21202 places (down from 52) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 1011 ms. (steps per millisecond=9 ) properties (out of 33) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) 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 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Running SMT prover for 25 properties.
[2023-03-11 03:28:03] [INFO ] Invariant cache hit.
[2023-03-11 03:28:14] [INFO ] [Real]Absence check using 101 positive place invariants in 499 ms returned sat
[2023-03-11 03:28:14] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 185 ms returned sat
[2023-03-11 03:28:28] [INFO ] After 5046ms SMT Verify possible using state equation in real domain returned unsat :0 sat :24
[2023-03-11 03:28:28] [INFO ] State equation strengthened by 19900 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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-11 03:28:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 03:28:28] [INFO ] After 25274ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 25 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 39 out of 21202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 683 transitions
Trivial Post-agglo rules discarded 683 transitions
Performed 683 trivial Post agglomeration. Transition count delta: 683
Iterating post reduction 0 with 683 rules applied. Total rules applied 683 place count 21202 transition count 40117
Reduce places removed 683 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 684 rules applied. Total rules applied 1367 place count 20519 transition count 40116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1368 place count 20518 transition count 40116
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1368 place count 20518 transition count 40113
Deduced a syphon composed of 3 places in 15 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1374 place count 20515 transition count 40113
Performed 9981 Post agglomeration using F-continuation condition.Transition count delta: 9981
Deduced a syphon composed of 9981 places in 19 ms
Reduce places removed 9981 places and 0 transitions.
Iterating global reduction 3 with 19962 rules applied. Total rules applied 21336 place count 10534 transition count 30132
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 21348 place count 10534 transition count 30120
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 21360 place count 10522 transition count 30120
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 21363 place count 10522 transition count 30120
Applied a total of 21363 rules in 7298 ms. Remains 10522 /21202 variables (removed 10680) and now considering 30120/40800 (removed 10680) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7302 ms. Remains : 10522/21202 places, 30120/40800 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 716 ms. (steps per millisecond=13 ) properties (out of 25) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
// Phase 1: matrix 30120 rows 10522 cols
[2023-03-11 03:28:36] [INFO ] Computed 201 place invariants in 295 ms
[2023-03-11 03:28:41] [INFO ] [Real]Absence check using 101 positive place invariants in 276 ms returned sat
[2023-03-11 03:28:42] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 133 ms returned sat
[2023-03-11 03:29:01] [INFO ] After 25042ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-11 03:29:06] [INFO ] [Nat]Absence check using 101 positive place invariants in 296 ms returned sat
[2023-03-11 03:29:06] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 147 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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-11 03:29:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 03:29:26] [INFO ] After 25027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:16
Fused 20 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 35 out of 10522 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10522/10522 places, 30120/30120 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 10520 transition count 30118
Applied a total of 4 rules in 468 ms. Remains 10520 /10522 variables (removed 2) and now considering 30118/30120 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 468 ms. Remains : 10520/10522 places, 30118/30120 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 958 ms. (steps per millisecond=10 ) properties (out of 20) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 30118 rows 10520 cols
[2023-03-11 03:29:28] [INFO ] Computed 201 place invariants in 189 ms
[2023-03-11 03:29:32] [INFO ] [Real]Absence check using 101 positive place invariants in 364 ms returned sat
[2023-03-11 03:29:32] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 174 ms returned sat
[2023-03-11 03:29:53] [INFO ] After 18200ms SMT Verify possible using state equation in real domain returned unsat :0 sat :15
[2023-03-11 03:29:54] [INFO ] State equation strengthened by 29886 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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-11 03:29:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 03:29:54] [INFO ] After 25667ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 15 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 84 ms.
Support contains 29 out of 10520 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10520/10520 places, 30118/30118 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 5 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 10514 transition count 30112
Applied a total of 12 rules in 316 ms. Remains 10514 /10520 variables (removed 6) and now considering 30112/30118 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 316 ms. Remains : 10514/10520 places, 30112/30118 transitions.
FORMULA CANConstruction-PT-100-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 401 stabilizing places and 500 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 21202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 135 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
// Phase 1: matrix 40800 rows 21202 cols
[2023-03-11 03:29:55] [INFO ] Computed 201 place invariants in 308 ms
[2023-03-11 03:29:57] [INFO ] Implicit Places using invariants in 2135 ms returned []
Implicit Place search using SMT only with invariants took 2140 ms to find 0 implicit places.
[2023-03-11 03:29:57] [INFO ] Invariant cache hit.
[2023-03-11 03:29:59] [INFO ] Dead Transitions using invariants and state equation in 1688 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3970 ms. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 216 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1098 1) (GEQ s16010 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 10 ms.
FORMULA CANConstruction-PT-100-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-00 finished in 4447 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((X(F(p1))&&p0))))'
Support contains 3 out of 21202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 122 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
[2023-03-11 03:29:59] [INFO ] Invariant cache hit.
[2023-03-11 03:30:01] [INFO ] Implicit Places using invariants in 1600 ms returned []
Implicit Place search using SMT only with invariants took 1601 ms to find 0 implicit places.
[2023-03-11 03:30:01] [INFO ] Invariant cache hit.
[2023-03-11 03:30:02] [INFO ] Dead Transitions using invariants and state equation in 1529 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3257 ms. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(LT s5719 1), p0:(AND (GEQ s137 1) (GEQ s790 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 1777 steps with 0 reset in 89 ms.
FORMULA CANConstruction-PT-100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-01 finished in 3618 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 1 out of 21202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21202 transition count 40100
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20502 transition count 40100
Performed 9999 Post agglomeration using F-continuation condition.Transition count delta: 9999
Deduced a syphon composed of 9999 places in 12 ms
Reduce places removed 9999 places and 0 transitions.
Iterating global reduction 2 with 19998 rules applied. Total rules applied 21398 place count 10503 transition count 30101
Applied a total of 21398 rules in 6151 ms. Remains 10503 /21202 variables (removed 10699) and now considering 30101/40800 (removed 10699) transitions.
// Phase 1: matrix 30101 rows 10503 cols
[2023-03-11 03:30:09] [INFO ] Computed 201 place invariants in 286 ms
[2023-03-11 03:30:10] [INFO ] Implicit Places using invariants in 1132 ms returned []
Implicit Place search using SMT only with invariants took 1147 ms to find 0 implicit places.
[2023-03-11 03:30:10] [INFO ] Invariant cache hit.
[2023-03-11 03:30:11] [INFO ] Dead Transitions using invariants and state equation in 818 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10503/21202 places, 30101/40800 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8121 ms. Remains : 10503/21202 places, 30101/40800 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s2675 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 664 steps with 0 reset in 36 ms.
FORMULA CANConstruction-PT-100-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-02 finished in 8250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 21202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21202 transition count 40100
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20502 transition count 40100
Performed 9998 Post agglomeration using F-continuation condition.Transition count delta: 9998
Deduced a syphon composed of 9998 places in 12 ms
Reduce places removed 9998 places and 0 transitions.
Iterating global reduction 2 with 19996 rules applied. Total rules applied 21396 place count 10504 transition count 30102
Applied a total of 21396 rules in 5864 ms. Remains 10504 /21202 variables (removed 10698) and now considering 30102/40800 (removed 10698) transitions.
// Phase 1: matrix 30102 rows 10504 cols
[2023-03-11 03:30:17] [INFO ] Computed 201 place invariants in 236 ms
[2023-03-11 03:30:18] [INFO ] Implicit Places using invariants in 1175 ms returned []
Implicit Place search using SMT only with invariants took 1183 ms to find 0 implicit places.
[2023-03-11 03:30:18] [INFO ] Invariant cache hit.
[2023-03-11 03:30:19] [INFO ] Dead Transitions using invariants and state equation in 917 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10504/21202 places, 30102/40800 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7973 ms. Remains : 10504/21202 places, 30102/40800 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s9035 1) (GEQ s3906 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 664 steps with 0 reset in 25 ms.
FORMULA CANConstruction-PT-100-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-04 finished in 8110 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(p0) U p1)&&G((F(G(X(p2)))&&p2)))))'
Support contains 4 out of 21202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 114 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
// Phase 1: matrix 40800 rows 21202 cols
[2023-03-11 03:30:20] [INFO ] Computed 201 place invariants in 506 ms
[2023-03-11 03:30:22] [INFO ] Implicit Places using invariants in 2534 ms returned []
Implicit Place search using SMT only with invariants took 2536 ms to find 0 implicit places.
[2023-03-11 03:30:22] [INFO ] Invariant cache hit.
[2023-03-11 03:30:24] [INFO ] Dead Transitions using invariants and state equation in 1889 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4540 ms. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p2 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=2 dest: 2}, { cond=(OR (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p2:(GEQ s1563 1), p1:(AND (GEQ s123 1) (GEQ s650 1)), p0:(GEQ s5109 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA CANConstruction-PT-100-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-05 finished in 4829 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(p1||G(p2)))))'
Support contains 3 out of 21202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 140 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
[2023-03-11 03:30:24] [INFO ] Invariant cache hit.
[2023-03-11 03:30:26] [INFO ] Implicit Places using invariants in 1691 ms returned []
Implicit Place search using SMT only with invariants took 1692 ms to find 0 implicit places.
[2023-03-11 03:30:26] [INFO ] Invariant cache hit.
[2023-03-11 03:30:27] [INFO ] Dead Transitions using invariants and state equation in 1608 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3443 ms. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 177 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 2}]], initial=1, aps=[p2:(LT s20039 1), p0:(GEQ s8583 1), p1:(GEQ s18769 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-100-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-06 finished in 3723 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U (X(!p1) U ((!p2&&X(!p1))||X(G(!p1))))))'
Support contains 6 out of 21202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 123 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
[2023-03-11 03:30:28] [INFO ] Invariant cache hit.
[2023-03-11 03:30:30] [INFO ] Implicit Places using invariants in 2043 ms returned []
Implicit Place search using SMT only with invariants took 2050 ms to find 0 implicit places.
[2023-03-11 03:30:30] [INFO ] Invariant cache hit.
[2023-03-11 03:30:32] [INFO ] Dead Transitions using invariants and state equation in 1787 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3977 ms. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p0) p1), p1, p1, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p1), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (GEQ s188 1) (GEQ s8358 1)), p1:(AND (GEQ s986 1) (GEQ s1327 1)), p2:(AND (GEQ s188 1) (GEQ s8358 1) (GEQ s305 1) (GEQ s720 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 91360 steps with 45680 reset in 10001 ms.
Product exploration timeout after 95400 steps with 47700 reset in 10001 ms.
Computed a total of 401 stabilizing places and 500 stable transitions
Computed a total of 401 stabilizing places and 500 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p2 p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) (NOT p1) (NOT p2))
Knowledge based reduction with 15 factoid took 431 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-100-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-100-LTLFireability-07 finished in 24914 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((p0&&F(p1))))))'
Support contains 4 out of 21202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 121 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
[2023-03-11 03:30:53] [INFO ] Invariant cache hit.
[2023-03-11 03:30:55] [INFO ] Implicit Places using invariants in 2080 ms returned []
Implicit Place search using SMT only with invariants took 2092 ms to find 0 implicit places.
[2023-03-11 03:30:55] [INFO ] Invariant cache hit.
[2023-03-11 03:30:57] [INFO ] Dead Transitions using invariants and state equation in 1980 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4204 ms. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s230 1) (LT s347 1)), p1:(AND (GEQ s958 1) (GEQ s12228 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1786 steps with 0 reset in 48 ms.
FORMULA CANConstruction-PT-100-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-08 finished in 4558 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 21202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21202 transition count 40100
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20502 transition count 40100
Performed 9999 Post agglomeration using F-continuation condition.Transition count delta: 9999
Deduced a syphon composed of 9999 places in 14 ms
Reduce places removed 9999 places and 0 transitions.
Iterating global reduction 2 with 19998 rules applied. Total rules applied 21398 place count 10503 transition count 30101
Applied a total of 21398 rules in 5490 ms. Remains 10503 /21202 variables (removed 10699) and now considering 30101/40800 (removed 10699) transitions.
// Phase 1: matrix 30101 rows 10503 cols
[2023-03-11 03:31:03] [INFO ] Computed 201 place invariants in 257 ms
[2023-03-11 03:31:04] [INFO ] Implicit Places using invariants in 1191 ms returned []
Implicit Place search using SMT only with invariants took 1196 ms to find 0 implicit places.
[2023-03-11 03:31:04] [INFO ] Invariant cache hit.
[2023-03-11 03:31:05] [INFO ] Dead Transitions using invariants and state equation in 1155 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10503/21202 places, 30101/40800 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7844 ms. Remains : 10503/21202 places, 30101/40800 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s8365 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 721 steps with 0 reset in 35 ms.
FORMULA CANConstruction-PT-100-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-09 finished in 8075 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U !p1)))'
Support contains 3 out of 21202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 119 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
// Phase 1: matrix 40800 rows 21202 cols
[2023-03-11 03:31:06] [INFO ] Computed 201 place invariants in 486 ms
[2023-03-11 03:31:08] [INFO ] Implicit Places using invariants in 2399 ms returned []
Implicit Place search using SMT only with invariants took 2402 ms to find 0 implicit places.
[2023-03-11 03:31:08] [INFO ] Invariant cache hit.
[2023-03-11 03:31:09] [INFO ] Dead Transitions using invariants and state equation in 1513 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4056 ms. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 127 ms :[p1, p1, true, (NOT p0)]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s10515 1) (GEQ s230 1) (GEQ s18462 1)), p0:(GEQ s10515 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 98420 steps with 49210 reset in 10014 ms.
Product exploration explored 100000 steps with 50000 reset in 9536 ms.
Computed a total of 401 stabilizing places and 500 stable transitions
Computed a total of 401 stabilizing places and 500 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p1 (NOT p0))))
Knowledge based reduction with 7 factoid took 146 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-100-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-100-LTLFireability-10 finished in 24069 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(!p0))||(F(!p0)&&p1))))'
Support contains 4 out of 21202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 696 transitions
Trivial Post-agglo rules discarded 696 transitions
Performed 696 trivial Post agglomeration. Transition count delta: 696
Iterating post reduction 0 with 696 rules applied. Total rules applied 696 place count 21202 transition count 40104
Reduce places removed 696 places and 0 transitions.
Iterating post reduction 1 with 696 rules applied. Total rules applied 1392 place count 20506 transition count 40104
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1392 place count 20506 transition count 40102
Deduced a syphon composed of 2 places in 12 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1396 place count 20504 transition count 40102
Performed 9998 Post agglomeration using F-continuation condition.Transition count delta: 9998
Deduced a syphon composed of 9998 places in 13 ms
Reduce places removed 9998 places and 0 transitions.
Iterating global reduction 2 with 19996 rules applied. Total rules applied 21392 place count 10506 transition count 30104
Applied a total of 21392 rules in 6189 ms. Remains 10506 /21202 variables (removed 10696) and now considering 30104/40800 (removed 10696) transitions.
// Phase 1: matrix 30104 rows 10506 cols
[2023-03-11 03:31:36] [INFO ] Computed 201 place invariants in 259 ms
[2023-03-11 03:31:37] [INFO ] Implicit Places using invariants in 1428 ms returned []
Implicit Place search using SMT only with invariants took 1429 ms to find 0 implicit places.
[2023-03-11 03:31:37] [INFO ] Invariant cache hit.
[2023-03-11 03:31:38] [INFO ] Dead Transitions using invariants and state equation in 946 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10506/21202 places, 30104/40800 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8580 ms. Remains : 10506/21202 places, 30104/40800 transitions.
Stuttering acceptance computed with spot in 98 ms :[p0, p0]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s415 1) (GEQ s553 1)), p0:(AND (GEQ s415 1) (GEQ s553 1) (GEQ s58 1) (GEQ s264 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 164 reset in 3157 ms.
Product exploration explored 100000 steps with 164 reset in 3495 ms.
Computed a total of 299 stabilizing places and 300 stable transitions
Computed a total of 299 stabilizing places and 300 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 207 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[p0, p0]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 03:31:45] [INFO ] Invariant cache hit.
[2023-03-11 03:31:47] [INFO ] [Real]Absence check using 101 positive place invariants in 235 ms returned sat
[2023-03-11 03:31:47] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 106 ms returned sat
[2023-03-11 03:32:06] [INFO ] After 19309ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 03:32:06] [INFO ] State equation strengthened by 29898 read => feed constraints.
[2023-03-11 03:32:11] [INFO ] After 4215ms SMT Verify possible using 29898 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:32:11] [INFO ] After 25250ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:32:12] [INFO ] [Nat]Absence check using 101 positive place invariants in 235 ms returned sat
[2023-03-11 03:32:12] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 109 ms returned sat
[2023-03-11 03:32:28] [INFO ] After 16318ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:32:32] [INFO ] After 3882ms SMT Verify possible using 29898 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:32:34] [INFO ] After 5247ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1055 ms.
[2023-03-11 03:32:35] [INFO ] After 24011ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 10506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10506/10506 places, 30104/30104 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 10506 transition count 30102
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 10504 transition count 30102
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 10504 transition count 30102
Applied a total of 6 rules in 520 ms. Remains 10504 /10506 variables (removed 2) and now considering 30102/30104 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 520 ms. Remains : 10504/10506 places, 30102/30104 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 307 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 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 84879 steps, run timeout after 3002 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 84879 steps, saw 74902 distinct states, run finished after 3003 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 30102 rows 10504 cols
[2023-03-11 03:32:39] [INFO ] Computed 201 place invariants in 255 ms
[2023-03-11 03:32:40] [INFO ] [Real]Absence check using 101 positive place invariants in 213 ms returned sat
[2023-03-11 03:32:40] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 100 ms returned sat
[2023-03-11 03:32:58] [INFO ] After 18015ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 03:32:59] [INFO ] State equation strengthened by 29900 read => feed constraints.
[2023-03-11 03:33:02] [INFO ] After 3695ms SMT Verify possible using 29900 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:33:02] [INFO ] After 23425ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:33:04] [INFO ] [Nat]Absence check using 101 positive place invariants in 221 ms returned sat
[2023-03-11 03:33:04] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 110 ms returned sat
[2023-03-11 03:33:22] [INFO ] After 18249ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:33:26] [INFO ] After 3575ms SMT Verify possible using 29900 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:33:27] [INFO ] After 4720ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 337 ms.
[2023-03-11 03:33:27] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 10504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10504/10504 places, 30102/30102 transitions.
Applied a total of 0 rules in 166 ms. Remains 10504 /10504 variables (removed 0) and now considering 30102/30102 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 10504/10504 places, 30102/30102 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10504/10504 places, 30102/30102 transitions.
Applied a total of 0 rules in 242 ms. Remains 10504 /10504 variables (removed 0) and now considering 30102/30102 (removed 0) transitions.
[2023-03-11 03:33:28] [INFO ] Invariant cache hit.
[2023-03-11 03:33:29] [INFO ] Implicit Places using invariants in 992 ms returned []
Implicit Place search using SMT only with invariants took 1007 ms to find 0 implicit places.
[2023-03-11 03:33:29] [INFO ] Invariant cache hit.
[2023-03-11 03:33:30] [INFO ] Dead Transitions using invariants and state equation in 838 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2116 ms. Remains : 10504/10504 places, 30102/30102 transitions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 187 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[p0, p0]
Stuttering acceptance computed with spot in 97 ms :[p0, p0]
Support contains 4 out of 10506 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10506/10506 places, 30104/30104 transitions.
Applied a total of 0 rules in 240 ms. Remains 10506 /10506 variables (removed 0) and now considering 30104/30104 (removed 0) transitions.
// Phase 1: matrix 30104 rows 10506 cols
[2023-03-11 03:33:31] [INFO ] Computed 201 place invariants in 274 ms
[2023-03-11 03:33:32] [INFO ] Implicit Places using invariants in 1314 ms returned []
Implicit Place search using SMT only with invariants took 1315 ms to find 0 implicit places.
[2023-03-11 03:33:32] [INFO ] Invariant cache hit.
[2023-03-11 03:33:32] [INFO ] Dead Transitions using invariants and state equation in 825 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2403 ms. Remains : 10506/10506 places, 30104/30104 transitions.
Computed a total of 299 stabilizing places and 300 stable transitions
Computed a total of 299 stabilizing places and 300 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 170 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[p0, p0]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 03:33:33] [INFO ] Invariant cache hit.
[2023-03-11 03:33:35] [INFO ] [Real]Absence check using 101 positive place invariants in 363 ms returned sat
[2023-03-11 03:33:35] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 163 ms returned sat
[2023-03-11 03:33:53] [INFO ] After 17665ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 03:33:53] [INFO ] State equation strengthened by 29898 read => feed constraints.
[2023-03-11 03:33:57] [INFO ] After 3988ms SMT Verify possible using 29898 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:33:57] [INFO ] After 23778ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:33:58] [INFO ] [Nat]Absence check using 101 positive place invariants in 281 ms returned sat
[2023-03-11 03:33:58] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 116 ms returned sat
[2023-03-11 03:34:15] [INFO ] After 16535ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:34:19] [INFO ] After 3685ms SMT Verify possible using 29898 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:34:20] [INFO ] After 4916ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 927 ms.
[2023-03-11 03:34:21] [INFO ] After 23851ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 4 out of 10506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10506/10506 places, 30104/30104 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 10506 transition count 30102
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 10504 transition count 30102
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 10504 transition count 30102
Applied a total of 6 rules in 626 ms. Remains 10504 /10506 variables (removed 2) and now considering 30102/30104 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 627 ms. Remains : 10504/10506 places, 30102/30104 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 83780 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 83780 steps, saw 74725 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 30102 rows 10504 cols
[2023-03-11 03:34:25] [INFO ] Computed 201 place invariants in 264 ms
[2023-03-11 03:34:26] [INFO ] [Real]Absence check using 101 positive place invariants in 203 ms returned sat
[2023-03-11 03:34:26] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 97 ms returned sat
[2023-03-11 03:34:42] [INFO ] After 15621ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 03:34:42] [INFO ] State equation strengthened by 29900 read => feed constraints.
[2023-03-11 03:34:46] [INFO ] After 3830ms SMT Verify possible using 29900 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:34:46] [INFO ] After 21173ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:34:47] [INFO ] [Nat]Absence check using 101 positive place invariants in 203 ms returned sat
[2023-03-11 03:34:48] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 100 ms returned sat
[2023-03-11 03:35:05] [INFO ] After 17349ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:35:09] [INFO ] After 3508ms SMT Verify possible using 29900 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:35:10] [INFO ] After 4762ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 963 ms.
[2023-03-11 03:35:11] [INFO ] After 24465ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 10504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10504/10504 places, 30102/30102 transitions.
Applied a total of 0 rules in 189 ms. Remains 10504 /10504 variables (removed 0) and now considering 30102/30102 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 10504/10504 places, 30102/30102 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10504/10504 places, 30102/30102 transitions.
Applied a total of 0 rules in 152 ms. Remains 10504 /10504 variables (removed 0) and now considering 30102/30102 (removed 0) transitions.
[2023-03-11 03:35:11] [INFO ] Invariant cache hit.
[2023-03-11 03:35:12] [INFO ] Implicit Places using invariants in 1203 ms returned []
Implicit Place search using SMT only with invariants took 1205 ms to find 0 implicit places.
[2023-03-11 03:35:12] [INFO ] Invariant cache hit.
[2023-03-11 03:35:13] [INFO ] Dead Transitions using invariants and state equation in 965 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2329 ms. Remains : 10504/10504 places, 30102/30102 transitions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 271 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[p0, p0]
Stuttering acceptance computed with spot in 90 ms :[p0, p0]
Stuttering acceptance computed with spot in 74 ms :[p0, p0]
Product exploration explored 100000 steps with 166 reset in 3118 ms.
Product exploration explored 100000 steps with 164 reset in 3417 ms.
Support contains 4 out of 10506 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10506/10506 places, 30104/30104 transitions.
Applied a total of 0 rules in 269 ms. Remains 10506 /10506 variables (removed 0) and now considering 30104/30104 (removed 0) transitions.
// Phase 1: matrix 30104 rows 10506 cols
[2023-03-11 03:35:21] [INFO ] Computed 201 place invariants in 276 ms
[2023-03-11 03:35:22] [INFO ] Implicit Places using invariants in 1302 ms returned []
Implicit Place search using SMT only with invariants took 1318 ms to find 0 implicit places.
[2023-03-11 03:35:22] [INFO ] Invariant cache hit.
[2023-03-11 03:35:23] [INFO ] Dead Transitions using invariants and state equation in 1175 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2764 ms. Remains : 10506/10506 places, 30104/30104 transitions.
Treatment of property CANConstruction-PT-100-LTLFireability-11 finished in 235539 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 21202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 184 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
// Phase 1: matrix 40800 rows 21202 cols
[2023-03-11 03:35:26] [INFO ] Computed 201 place invariants in 476 ms
[2023-03-11 03:35:28] [INFO ] Implicit Places using invariants in 2536 ms returned []
Implicit Place search using SMT only with invariants took 2538 ms to find 0 implicit places.
[2023-03-11 03:35:28] [INFO ] Invariant cache hit.
[2023-03-11 03:35:30] [INFO ] Dead Transitions using invariants and state equation in 1877 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4602 ms. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s846 1) (GEQ s8648 1) (GEQ s14119 1) (GEQ s900 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 1660 steps with 0 reset in 75 ms.
FORMULA CANConstruction-PT-100-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-12 finished in 5038 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&&G(F((p1&&X((p1 U (p0||G(p1))))))))))'
Support contains 2 out of 21202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 165 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
[2023-03-11 03:35:30] [INFO ] Invariant cache hit.
[2023-03-11 03:35:32] [INFO ] Implicit Places using invariants in 1942 ms returned []
Implicit Place search using SMT only with invariants took 1943 ms to find 0 implicit places.
[2023-03-11 03:35:32] [INFO ] Invariant cache hit.
[2023-03-11 03:35:34] [INFO ] Dead Transitions using invariants and state equation in 2011 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4123 ms. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LT s10041 1), p0:(GEQ s7543 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 10712 steps with 5 reset in 372 ms.
FORMULA CANConstruction-PT-100-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-13 finished in 4844 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)&&F((G(p1)||G(p2)))))'
Support contains 5 out of 21202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 696 transitions
Trivial Post-agglo rules discarded 696 transitions
Performed 696 trivial Post agglomeration. Transition count delta: 696
Iterating post reduction 0 with 696 rules applied. Total rules applied 696 place count 21202 transition count 40104
Reduce places removed 696 places and 0 transitions.
Iterating post reduction 1 with 696 rules applied. Total rules applied 1392 place count 20506 transition count 40104
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1392 place count 20506 transition count 40102
Deduced a syphon composed of 2 places in 16 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1396 place count 20504 transition count 40102
Performed 9997 Post agglomeration using F-continuation condition.Transition count delta: 9997
Deduced a syphon composed of 9997 places in 11 ms
Reduce places removed 9997 places and 0 transitions.
Iterating global reduction 2 with 19994 rules applied. Total rules applied 21390 place count 10507 transition count 30105
Applied a total of 21390 rules in 6139 ms. Remains 10507 /21202 variables (removed 10695) and now considering 30105/40800 (removed 10695) transitions.
// Phase 1: matrix 30105 rows 10507 cols
[2023-03-11 03:35:41] [INFO ] Computed 201 place invariants in 277 ms
[2023-03-11 03:35:42] [INFO ] Implicit Places using invariants in 1378 ms returned []
Implicit Place search using SMT only with invariants took 1380 ms to find 0 implicit places.
[2023-03-11 03:35:42] [INFO ] Invariant cache hit.
[2023-03-11 03:35:43] [INFO ] Dead Transitions using invariants and state equation in 916 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10507/21202 places, 30105/40800 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8453 ms. Remains : 10507/21202 places, 30105/40800 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s311 1) (GEQ s343 1)), p1:(OR (LT s5 1) (LT s379 1)), p2:(GEQ s893 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 7169 steps with 10 reset in 274 ms.
FORMULA CANConstruction-PT-100-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-14 finished in 8937 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((X(F((p1||X(p2))))&&p0))))'
Support contains 3 out of 21202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 150 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
// Phase 1: matrix 40800 rows 21202 cols
[2023-03-11 03:35:44] [INFO ] Computed 201 place invariants in 442 ms
[2023-03-11 03:35:46] [INFO ] Implicit Places using invariants in 2433 ms returned []
Implicit Place search using SMT only with invariants took 2434 ms to find 0 implicit places.
[2023-03-11 03:35:46] [INFO ] Invariant cache hit.
[2023-03-11 03:35:48] [INFO ] Dead Transitions using invariants and state equation in 1686 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4287 ms. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (GEQ s216 1) (GEQ s16282 1)), p2:(LT s18983 1), p0:(AND (GEQ s18983 1) (GEQ s216 1) (GEQ s16282 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 1840 steps with 0 reset in 68 ms.
FORMULA CANConstruction-PT-100-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-15 finished in 4660 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(!p0))||(F(!p0)&&p1))))'
[2023-03-11 03:35:49] [INFO ] Flatten gal took : 733 ms
[2023-03-11 03:35:49] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-11 03:35:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 21202 places, 40800 transitions and 122000 arcs took 158 ms.
Total runtime 481850 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CANConstruction-PT-100
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability

BK_STOP 1678505969395

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-100-LTLFireability-11: LTL 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 44 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-100-LTLFireability-11: LTL 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 49 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-100-LTLFireability-11: LTL 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 54 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-100-LTLFireability-11: LTL 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 59 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-100-LTLFireability-11: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 64 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-100-LTLFireability-11: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 69 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-100-LTLFireability-11: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 74 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-100-LTLFireability-11: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 79 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-100-LTLFireability-11: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 84 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-100-LTLFireability-11: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 89 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-100-LTLFireability-11: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 94 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-100-LTLFireability-11: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 99 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-100-LTLFireability-11: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 104 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-100-LTLFireability-11: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 109 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-100-LTLFireability-11: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 114 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-100-LTLFireability-11: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 119 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-100-LTLFireability-11: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 124 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-100-LTLFireability-11: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 129 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-100-LTLFireability-11: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 134 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-100-LTLFireability-11: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 139 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-100-LTLFireability-11: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 144 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
lola: LAUNCH task # 1 (type EXCL) for 0 CANConstruction-PT-100-LTLFireability-11
lola: time limit : 3455 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-100-LTLFireability-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 4/3455 1/32 CANConstruction-PT-100-LTLFireability-11 474 m, 94 m/sec, 525 t fired, .

Time elapsed: 149 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-100-LTLFireability-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 9/3455 1/32 CANConstruction-PT-100-LTLFireability-11 569 m, 19 m/sec, 638 t fired, .

Time elapsed: 154 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-100-LTLFireability-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 14/3455 1/32 CANConstruction-PT-100-LTLFireability-11 670 m, 20 m/sec, 766 t fired, .

Time elapsed: 159 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-100-LTLFireability-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 19/3455 3/32 CANConstruction-PT-100-LTLFireability-11 13712 m, 2608 m/sec, 26671 t fired, .

Time elapsed: 164 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-100-LTLFireability-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 24/3455 6/32 CANConstruction-PT-100-LTLFireability-11 33837 m, 4025 m/sec, 67147 t fired, .

Time elapsed: 169 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-100-LTLFireability-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 29/3455 9/32 CANConstruction-PT-100-LTLFireability-11 54443 m, 4121 m/sec, 108539 t fired, .

Time elapsed: 174 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-100-LTLFireability-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 34/3455 12/32 CANConstruction-PT-100-LTLFireability-11 73849 m, 3881 m/sec, 147474 t fired, .

Time elapsed: 179 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-100-LTLFireability-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 39/3455 15/32 CANConstruction-PT-100-LTLFireability-11 93320 m, 3894 m/sec, 186615 t fired, .

Time elapsed: 184 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-100-LTLFireability-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 44/3455 18/32 CANConstruction-PT-100-LTLFireability-11 111401 m, 3616 m/sec, 223038 t fired, .

Time elapsed: 189 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-100-LTLFireability-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 49/3455 21/32 CANConstruction-PT-100-LTLFireability-11 130778 m, 3875 m/sec, 262143 t fired, .

Time elapsed: 194 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-100-LTLFireability-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 54/3455 24/32 CANConstruction-PT-100-LTLFireability-11 151432 m, 4130 m/sec, 303809 t fired, .

Time elapsed: 199 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-100-LTLFireability-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 59/3455 27/32 CANConstruction-PT-100-LTLFireability-11 170320 m, 3777 m/sec, 341848 t fired, .

Time elapsed: 204 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-100-LTLFireability-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 64/3455 29/32 CANConstruction-PT-100-LTLFireability-11 188836 m, 3703 m/sec, 379194 t fired, .

Time elapsed: 209 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-100-LTLFireability-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 69/3455 32/32 CANConstruction-PT-100-LTLFireability-11 205145 m, 3261 m/sec, 411968 t fired, .

Time elapsed: 214 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for CANConstruction-PT-100-LTLFireability-11 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-100-LTLFireability-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 219 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: Portfolio finished: no open tasks 1

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANConstruction-PT-100-LTLFireability-11: LTL unknown AGGR


Time elapsed: 219 secs. Pages in use: 32

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="CANConstruction-PT-100"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is CANConstruction-PT-100, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r039-tajo-167813692900692"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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