Execution Chart

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

Trace from the execution

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

--------------------
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 1678657803671

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-100
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 21:50:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 21:50:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 21:50:06] [INFO ] Load time of PNML (sax parser for PT used): 709 ms
[2023-03-12 21:50:06] [INFO ] Transformed 21202 places.
[2023-03-12 21:50:06] [INFO ] Transformed 40800 transitions.
[2023-03-12 21:50:06] [INFO ] Parsed PT model containing 21202 places and 40800 transitions and 122000 arcs in 983 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 241 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
// Phase 1: matrix 40800 rows 21202 cols
[2023-03-12 21:50:07] [INFO ] Computed 201 place invariants in 666 ms
[2023-03-12 21:50:09] [INFO ] Implicit Places using invariants in 2913 ms returned []
Implicit Place search using SMT only with invariants took 2939 ms to find 0 implicit places.
[2023-03-12 21:50:10] [INFO ] Invariant cache hit.
[2023-03-12 21:50:12] [INFO ] Dead Transitions using invariants and state equation in 2078 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5270 ms. Remains : 21202/21202 places, 40800/40800 transitions.
Support contains 52 out of 21202 places after structural reductions.
[2023-03-12 21:50:13] [INFO ] Flatten gal took : 1265 ms
[2023-03-12 21:50:14] [INFO ] Flatten gal took : 972 ms
[2023-03-12 21:50:16] [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 1128 ms. (steps per millisecond=8 ) properties (out of 33) seen :11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) seen :0
Running SMT prover for 22 properties.
[2023-03-12 21:50:18] [INFO ] Invariant cache hit.
[2023-03-12 21:50:28] [INFO ] [Real]Absence check using 101 positive place invariants in 512 ms returned sat
[2023-03-12 21:50:28] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 195 ms returned sat
[2023-03-12 21:50:43] [INFO ] After 12953ms SMT Verify possible using state equation in real domain returned unsat :0 sat :0 real:21
[2023-03-12 21:50:43] [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-12 21:50:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 21:50:43] [INFO ] After 25339ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 22 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 36 out of 21202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 682 transitions
Trivial Post-agglo rules discarded 682 transitions
Performed 682 trivial Post agglomeration. Transition count delta: 682
Iterating post reduction 0 with 682 rules applied. Total rules applied 682 place count 21202 transition count 40118
Reduce places removed 682 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 683 rules applied. Total rules applied 1365 place count 20520 transition count 40117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1366 place count 20519 transition count 40117
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 1366 place count 20519 transition count 40113
Deduced a syphon composed of 4 places in 14 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 1374 place count 20515 transition count 40113
Performed 9983 Post agglomeration using F-continuation condition.Transition count delta: 9983
Deduced a syphon composed of 9983 places in 26 ms
Reduce places removed 9983 places and 0 transitions.
Iterating global reduction 3 with 19966 rules applied. Total rules applied 21340 place count 10532 transition count 30130
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 21352 place count 10532 transition count 30118
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 21364 place count 10520 transition count 30118
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 21368 place count 10520 transition count 30118
Applied a total of 21368 rules in 7615 ms. Remains 10520 /21202 variables (removed 10682) and now considering 30118/40800 (removed 10682) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7620 ms. Remains : 10520/21202 places, 30118/40800 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 632 ms. (steps per millisecond=15 ) properties (out of 22) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) seen :0
Running SMT prover for 18 properties.
// Phase 1: matrix 30118 rows 10520 cols
[2023-03-12 21:50:52] [INFO ] Computed 201 place invariants in 251 ms
[2023-03-12 21:50:56] [INFO ] [Real]Absence check using 101 positive place invariants in 290 ms returned sat
[2023-03-12 21:50:56] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 144 ms returned sat
[2023-03-12 21:51:17] [INFO ] After 17094ms SMT Verify possible using state equation in real domain returned unsat :0 sat :17
[2023-03-12 21:51:17] [INFO ] State equation strengthened by 29887 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-12 21:51:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 21:51:17] [INFO ] After 25316ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 18 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 31 out of 10520 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10520/10520 places, 30118/30118 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 10516 transition count 30114
Applied a total of 8 rules in 271 ms. Remains 10516 /10520 variables (removed 4) and now considering 30114/30118 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 271 ms. Remains : 10516/10520 places, 30114/30118 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 593 ms. (steps per millisecond=16 ) properties (out of 18) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 30114 rows 10516 cols
[2023-03-12 21:51:19] [INFO ] Computed 201 place invariants in 326 ms
[2023-03-12 21:51:21] [INFO ] [Real]Absence check using 101 positive place invariants in 249 ms returned sat
[2023-03-12 21:51:22] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 147 ms returned sat
[2023-03-12 21:51:44] [INFO ] After 20312ms SMT Verify possible using state equation in real domain returned unsat :0 sat :10
[2023-03-12 21:51:44] [INFO ] State equation strengthened by 29890 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-12 21:51:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 21:51:44] [INFO ] After 25626ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 10 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 60 ms.
Support contains 23 out of 10516 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10516/10516 places, 30114/30114 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 10514 transition count 30112
Applied a total of 4 rules in 403 ms. Remains 10514 /10516 variables (removed 2) and now considering 30112/30114 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 403 ms. Remains : 10514/10516 places, 30112/30114 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 681 ms. (steps per millisecond=14 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 30112 rows 10514 cols
[2023-03-12 21:51:46] [INFO ] Computed 201 place invariants in 312 ms
[2023-03-12 21:51:49] [INFO ] [Real]Absence check using 101 positive place invariants in 316 ms returned sat
[2023-03-12 21:51:49] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 155 ms returned sat
[2023-03-12 21:52:11] [INFO ] After 20349ms SMT Verify possible using state equation in real domain returned unsat :0 sat :9
[2023-03-12 21:52:11] [INFO ] State equation strengthened by 29892 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-12 21:52:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 21:52:11] [INFO ] After 25288ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 22 out of 10514 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10514/10514 places, 30112/30112 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 10513 transition count 30111
Applied a total of 2 rules in 338 ms. Remains 10513 /10514 variables (removed 1) and now considering 30111/30112 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 338 ms. Remains : 10513/10514 places, 30111/30112 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 134 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
// Phase 1: matrix 40800 rows 21202 cols
[2023-03-12 21:52:13] [INFO ] Computed 201 place invariants in 481 ms
[2023-03-12 21:52:15] [INFO ] Implicit Places using invariants in 2511 ms returned []
Implicit Place search using SMT only with invariants took 2512 ms to find 0 implicit places.
[2023-03-12 21:52:15] [INFO ] Invariant cache hit.
[2023-03-12 21:52:17] [INFO ] Dead Transitions using invariants and state equation in 1745 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4395 ms. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 207 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 7 ms.
FORMULA CANConstruction-PT-100-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-00 finished in 4793 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 141 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
[2023-03-12 21:52:17] [INFO ] Invariant cache hit.
[2023-03-12 21:52:19] [INFO ] Implicit Places using invariants in 1720 ms returned []
Implicit Place search using SMT only with invariants took 1723 ms to find 0 implicit places.
[2023-03-12 21:52:19] [INFO ] Invariant cache hit.
[2023-03-12 21:52:21] [INFO ] Dead Transitions using invariants and state equation in 2151 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4017 ms. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 157 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 1966 steps with 0 reset in 104 ms.
FORMULA CANConstruction-PT-100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-01 finished in 4377 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 16 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 5894 ms. Remains 10503 /21202 variables (removed 10699) and now considering 30101/40800 (removed 10699) transitions.
// Phase 1: matrix 30101 rows 10503 cols
[2023-03-12 21:52:27] [INFO ] Computed 201 place invariants in 188 ms
[2023-03-12 21:52:28] [INFO ] Implicit Places using invariants in 1284 ms returned []
Implicit Place search using SMT only with invariants took 1285 ms to find 0 implicit places.
[2023-03-12 21:52:28] [INFO ] Invariant cache hit.
[2023-03-12 21:52:29] [INFO ] Dead Transitions using invariants and state equation in 996 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 8181 ms. Remains : 10503/21202 places, 30101/40800 transitions.
Stuttering acceptance computed with spot in 31 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 622 steps with 0 reset in 27 ms.
FORMULA CANConstruction-PT-100-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-02 finished in 8330 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 14 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 5753 ms. Remains 10504 /21202 variables (removed 10698) and now considering 30102/40800 (removed 10698) transitions.
// Phase 1: matrix 30102 rows 10504 cols
[2023-03-12 21:52:36] [INFO ] Computed 201 place invariants in 255 ms
[2023-03-12 21:52:37] [INFO ] Implicit Places using invariants in 1389 ms returned []
Implicit Place search using SMT only with invariants took 1393 ms to find 0 implicit places.
[2023-03-12 21:52:37] [INFO ] Invariant cache hit.
[2023-03-12 21:52:38] [INFO ] Dead Transitions using invariants and state equation in 1005 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 8155 ms. Remains : 10504/21202 places, 30102/40800 transitions.
Stuttering acceptance computed with spot in 51 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 703 steps with 0 reset in 41 ms.
FORMULA CANConstruction-PT-100-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-04 finished in 8345 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 141 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
// Phase 1: matrix 40800 rows 21202 cols
[2023-03-12 21:52:38] [INFO ] Computed 201 place invariants in 361 ms
[2023-03-12 21:52:40] [INFO ] Implicit Places using invariants in 2116 ms returned []
Implicit Place search using SMT only with invariants took 2117 ms to find 0 implicit places.
[2023-03-12 21:52:40] [INFO ] Invariant cache hit.
[2023-03-12 21:52:42] [INFO ] Dead Transitions using invariants and state equation in 1635 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3895 ms. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 173 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 4185 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 125 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
[2023-03-12 21:52:42] [INFO ] Invariant cache hit.
[2023-03-12 21:52:44] [INFO ] Implicit Places using invariants in 1765 ms returned []
Implicit Place search using SMT only with invariants took 1766 ms to find 0 implicit places.
[2023-03-12 21:52:44] [INFO ] Invariant cache hit.
[2023-03-12 21:52:46] [INFO ] Dead Transitions using invariants and state equation in 1627 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3520 ms. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 149 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 5 ms.
FORMULA CANConstruction-PT-100-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-06 finished in 3780 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 172 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
[2023-03-12 21:52:46] [INFO ] Invariant cache hit.
[2023-03-12 21:52:48] [INFO ] Implicit Places using invariants in 2065 ms returned []
Implicit Place search using SMT only with invariants took 2067 ms to find 0 implicit places.
[2023-03-12 21:52:48] [INFO ] Invariant cache hit.
[2023-03-12 21:52:50] [INFO ] Dead Transitions using invariants and state equation in 1585 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3827 ms. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 189 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 93980 steps with 46990 reset in 10001 ms.
Product exploration timeout after 98450 steps with 49225 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 397 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 24645 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-12 21:53:11] [INFO ] Invariant cache hit.
[2023-03-12 21:53:12] [INFO ] Implicit Places using invariants in 1677 ms returned []
Implicit Place search using SMT only with invariants took 1679 ms to find 0 implicit places.
[2023-03-12 21:53:12] [INFO ] Invariant cache hit.
[2023-03-12 21:53:14] [INFO ] Dead Transitions using invariants and state equation in 1600 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3402 ms. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 153 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 1804 steps with 0 reset in 46 ms.
FORMULA CANConstruction-PT-100-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-08 finished in 3679 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 13 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 5701 ms. Remains 10503 /21202 variables (removed 10699) and now considering 30101/40800 (removed 10699) transitions.
// Phase 1: matrix 30101 rows 10503 cols
[2023-03-12 21:53:20] [INFO ] Computed 201 place invariants in 202 ms
[2023-03-12 21:53:21] [INFO ] Implicit Places using invariants in 1317 ms returned []
Implicit Place search using SMT only with invariants took 1320 ms to find 0 implicit places.
[2023-03-12 21:53:21] [INFO ] Invariant cache hit.
[2023-03-12 21:53:22] [INFO ] Dead Transitions using invariants and state equation in 952 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 7976 ms. Remains : 10503/21202 places, 30101/40800 transitions.
Stuttering acceptance computed with spot in 93 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 658 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 8208 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 161 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
// Phase 1: matrix 40800 rows 21202 cols
[2023-03-12 21:53:23] [INFO ] Computed 201 place invariants in 353 ms
[2023-03-12 21:53:25] [INFO ] Implicit Places using invariants in 2132 ms returned []
Implicit Place search using SMT only with invariants took 2133 ms to find 0 implicit places.
[2023-03-12 21:53:25] [INFO ] Invariant cache hit.
[2023-03-12 21:53:26] [INFO ] Dead Transitions using invariants and state equation in 1725 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4023 ms. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 184 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 explored 100000 steps with 50000 reset in 9997 ms.
Product exploration timeout after 92330 steps with 46165 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 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 24578 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 15 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 15 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 6138 ms. Remains 10506 /21202 variables (removed 10696) and now considering 30104/40800 (removed 10696) transitions.
// Phase 1: matrix 30104 rows 10506 cols
[2023-03-12 21:53:53] [INFO ] Computed 201 place invariants in 220 ms
[2023-03-12 21:53:54] [INFO ] Implicit Places using invariants in 1158 ms returned []
Implicit Place search using SMT only with invariants took 1160 ms to find 0 implicit places.
[2023-03-12 21:53:54] [INFO ] Invariant cache hit.
[2023-03-12 21:53:55] [INFO ] Dead Transitions using invariants and state equation in 1015 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 8317 ms. Remains : 10506/21202 places, 30104/40800 transitions.
Stuttering acceptance computed with spot in 108 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 167 reset in 3281 ms.
Product exploration explored 100000 steps with 165 reset in 3279 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 197 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 74 ms :[p0, p0]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 334 ms. (steps per millisecond=29 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 21:54:03] [INFO ] Invariant cache hit.
[2023-03-12 21:54:04] [INFO ] [Real]Absence check using 101 positive place invariants in 225 ms returned sat
[2023-03-12 21:54:04] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 124 ms returned sat
[2023-03-12 21:54:26] [INFO ] After 21503ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 21:54:26] [INFO ] State equation strengthened by 29898 read => feed constraints.
[2023-03-12 21:54:28] [INFO ] After 1806ms SMT Verify possible using 29898 Read/Feed constraints in real domain returned unsat :0 sat :0
[2023-03-12 21:54:28] [INFO ] After 25020ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 44 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 706 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 707 ms. Remains : 10504/10506 places, 30102/30104 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 84870 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 84870 steps, saw 74898 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-12 21:54:32] [INFO ] Computed 201 place invariants in 200 ms
[2023-03-12 21:54:33] [INFO ] [Real]Absence check using 101 positive place invariants in 210 ms returned sat
[2023-03-12 21:54:33] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 113 ms returned sat
[2023-03-12 21:54:52] [INFO ] After 18738ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 21:54:53] [INFO ] State equation strengthened by 29900 read => feed constraints.
[2023-03-12 21:54:56] [INFO ] After 3835ms SMT Verify possible using 29900 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 21:54:56] [INFO ] After 24233ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 21:54:58] [INFO ] [Nat]Absence check using 101 positive place invariants in 205 ms returned sat
[2023-03-12 21:54:58] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 110 ms returned sat
[2023-03-12 21:55:20] [INFO ] After 22032ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
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:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 21:55:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 21:55:21] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 9 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 223 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 224 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 194 ms. Remains 10504 /10504 variables (removed 0) and now considering 30102/30102 (removed 0) transitions.
[2023-03-12 21:55:22] [INFO ] Invariant cache hit.
[2023-03-12 21:55:23] [INFO ] Implicit Places using invariants in 923 ms returned []
Implicit Place search using SMT only with invariants took 924 ms to find 0 implicit places.
[2023-03-12 21:55:23] [INFO ] Invariant cache hit.
[2023-03-12 21:55:24] [INFO ] Dead Transitions using invariants and state equation in 972 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2097 ms. Remains : 10504/10504 places, 30102/30102 transitions.
Graph (trivial) has 29602 edges and 10504 vertex of which 9898 / 10504 are part of one of the 98 SCC in 10 ms
Free SCC test removed 9800 places
Drop transitions removed 19502 transitions
Ensure Unique test removed 9604 transitions
Reduce isomorphic transitions removed 29106 transitions.
Graph (complete) has 1597 edges and 704 vertex of which 217 are kept as prefixes of interest. Removing 487 places using SCC suffix rule.1 ms
Discarding 487 places :
Also discarding 290 output transitions
Drop transitions removed 290 transitions
Drop transitions removed 296 transitions
Reduce isomorphic transitions removed 296 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 300 rules applied. Total rules applied 302 place count 215 transition count 408
Reduce places removed 2 places and 0 transitions.
Performed 198 Post agglomeration using F-continuation condition.Transition count delta: 198
Iterating post reduction 1 with 200 rules applied. Total rules applied 502 place count 213 transition count 210
Reduce places removed 198 places and 0 transitions.
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 2 with 394 rules applied. Total rules applied 896 place count 15 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 896 place count 15 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 900 place count 13 transition count 12
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 902 place count 11 transition count 10
Iterating global reduction 3 with 2 rules applied. Total rules applied 904 place count 11 transition count 10
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 906 place count 11 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 908 place count 9 transition count 8
Applied a total of 908 rules in 191 ms. Remains 9 /10504 variables (removed 10495) and now considering 8/30102 (removed 30094) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 8 rows 9 cols
[2023-03-12 21:55:24] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-12 21:55:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 21:55:24] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 21:55:24] [INFO ] After 6ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-12 21:55:24] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
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 201 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 79 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 245 ms. Remains 10506 /10506 variables (removed 0) and now considering 30104/30104 (removed 0) transitions.
// Phase 1: matrix 30104 rows 10506 cols
[2023-03-12 21:55:25] [INFO ] Computed 201 place invariants in 263 ms
[2023-03-12 21:55:26] [INFO ] Implicit Places using invariants in 1167 ms returned []
Implicit Place search using SMT only with invariants took 1170 ms to find 0 implicit places.
[2023-03-12 21:55:26] [INFO ] Invariant cache hit.
[2023-03-12 21:55:27] [INFO ] Dead Transitions using invariants and state equation in 1125 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2542 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 173 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 66 ms :[p0, p0]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 482 ms. (steps per millisecond=20 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 21:55:28] [INFO ] Invariant cache hit.
[2023-03-12 21:55:30] [INFO ] [Real]Absence check using 101 positive place invariants in 291 ms returned sat
[2023-03-12 21:55:30] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 125 ms returned sat
[2023-03-12 21:55:50] [INFO ] After 20031ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 21:55:50] [INFO ] State equation strengthened by 29898 read => feed constraints.
[2023-03-12 21:55:53] [INFO ] After 2930ms SMT Verify possible using 29898 Read/Feed constraints in real domain returned unsat :0 sat :0
[2023-03-12 21:55:53] [INFO ] After 25023ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 36 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 677 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 679 ms. Remains : 10504/10506 places, 30102/30104 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 85631 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 85631 steps, saw 74999 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 30102 rows 10504 cols
[2023-03-12 21:55:57] [INFO ] Computed 201 place invariants in 278 ms
[2023-03-12 21:55:59] [INFO ] [Real]Absence check using 101 positive place invariants in 250 ms returned sat
[2023-03-12 21:55:59] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 115 ms returned sat
[2023-03-12 21:56:19] [INFO ] After 19618ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 21:56:19] [INFO ] State equation strengthened by 29900 read => feed constraints.
[2023-03-12 21:56:22] [INFO ] After 3308ms SMT Verify possible using 29900 Read/Feed constraints in real domain returned unsat :0 sat :0
[2023-03-12 21:56:22] [INFO ] After 25030ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 13 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 350 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 352 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 315 ms. Remains 10504 /10504 variables (removed 0) and now considering 30102/30102 (removed 0) transitions.
[2023-03-12 21:56:23] [INFO ] Invariant cache hit.
[2023-03-12 21:56:24] [INFO ] Implicit Places using invariants in 962 ms returned []
Implicit Place search using SMT only with invariants took 963 ms to find 0 implicit places.
[2023-03-12 21:56:24] [INFO ] Invariant cache hit.
[2023-03-12 21:56:25] [INFO ] Dead Transitions using invariants and state equation in 905 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2188 ms. Remains : 10504/10504 places, 30102/30102 transitions.
Graph (trivial) has 29602 edges and 10504 vertex of which 9898 / 10504 are part of one of the 98 SCC in 9 ms
Free SCC test removed 9800 places
Drop transitions removed 19502 transitions
Ensure Unique test removed 9604 transitions
Reduce isomorphic transitions removed 29106 transitions.
Graph (complete) has 1597 edges and 704 vertex of which 217 are kept as prefixes of interest. Removing 487 places using SCC suffix rule.0 ms
Discarding 487 places :
Also discarding 290 output transitions
Drop transitions removed 290 transitions
Drop transitions removed 296 transitions
Reduce isomorphic transitions removed 296 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 300 rules applied. Total rules applied 302 place count 215 transition count 408
Reduce places removed 2 places and 0 transitions.
Performed 198 Post agglomeration using F-continuation condition.Transition count delta: 198
Iterating post reduction 1 with 200 rules applied. Total rules applied 502 place count 213 transition count 210
Reduce places removed 198 places and 0 transitions.
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 2 with 394 rules applied. Total rules applied 896 place count 15 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 896 place count 15 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 900 place count 13 transition count 12
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 902 place count 11 transition count 10
Iterating global reduction 3 with 2 rules applied. Total rules applied 904 place count 11 transition count 10
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 906 place count 11 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 908 place count 9 transition count 8
Applied a total of 908 rules in 171 ms. Remains 9 /10504 variables (removed 10495) and now considering 8/30102 (removed 30094) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 8 rows 9 cols
[2023-03-12 21:56:25] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-12 21:56:25] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 21:56:25] [INFO ] After 4ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 21:56:25] [INFO ] After 7ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-12 21:56:25] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
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 232 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 77 ms :[p0, p0]
Stuttering acceptance computed with spot in 71 ms :[p0, p0]
Stuttering acceptance computed with spot in 79 ms :[p0, p0]
Product exploration explored 100000 steps with 166 reset in 3388 ms.
Product exploration explored 100000 steps with 162 reset in 3412 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 225 ms. Remains 10506 /10506 variables (removed 0) and now considering 30104/30104 (removed 0) transitions.
// Phase 1: matrix 30104 rows 10506 cols
[2023-03-12 21:56:33] [INFO ] Computed 201 place invariants in 498 ms
[2023-03-12 21:56:35] [INFO ] Implicit Places using invariants in 2038 ms returned []
Implicit Place search using SMT only with invariants took 2052 ms to find 0 implicit places.
[2023-03-12 21:56:35] [INFO ] Invariant cache hit.
[2023-03-12 21:56:36] [INFO ] Dead Transitions using invariants and state equation in 1138 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3419 ms. Remains : 10506/10506 places, 30104/30104 transitions.
Treatment of property CANConstruction-PT-100-LTLFireability-11 finished in 170762 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 140 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
// Phase 1: matrix 40800 rows 21202 cols
[2023-03-12 21:56:38] [INFO ] Computed 201 place invariants in 403 ms
[2023-03-12 21:56:40] [INFO ] Implicit Places using invariants in 2404 ms returned []
Implicit Place search using SMT only with invariants took 2406 ms to find 0 implicit places.
[2023-03-12 21:56:40] [INFO ] Invariant cache hit.
[2023-03-12 21:56:42] [INFO ] Dead Transitions using invariants and state equation in 1840 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4390 ms. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 113 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 1867 steps with 0 reset in 63 ms.
FORMULA CANConstruction-PT-100-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-12 finished in 4741 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 127 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
[2023-03-12 21:56:43] [INFO ] Invariant cache hit.
[2023-03-12 21:56:44] [INFO ] Implicit Places using invariants in 1685 ms returned []
Implicit Place search using SMT only with invariants took 1686 ms to find 0 implicit places.
[2023-03-12 21:56:44] [INFO ] Invariant cache hit.
[2023-03-12 21:56:46] [INFO ] Dead Transitions using invariants and state equation in 1644 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3459 ms. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 252 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 11198 steps with 5 reset in 408 ms.
FORMULA CANConstruction-PT-100-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-13 finished in 4229 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 14 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 29 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 6046 ms. Remains 10507 /21202 variables (removed 10695) and now considering 30105/40800 (removed 10695) transitions.
// Phase 1: matrix 30105 rows 10507 cols
[2023-03-12 21:56:53] [INFO ] Computed 201 place invariants in 325 ms
[2023-03-12 21:56:54] [INFO ] Implicit Places using invariants in 1481 ms returned []
Implicit Place search using SMT only with invariants took 1482 ms to find 0 implicit places.
[2023-03-12 21:56:54] [INFO ] Invariant cache hit.
[2023-03-12 21:56:56] [INFO ] Dead Transitions using invariants and state equation in 1259 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 8794 ms. Remains : 10507/21202 places, 30105/40800 transitions.
Stuttering acceptance computed with spot in 114 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 669 steps with 0 reset in 37 ms.
FORMULA CANConstruction-PT-100-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-14 finished in 9045 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 161 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
// Phase 1: matrix 40800 rows 21202 cols
[2023-03-12 21:56:56] [INFO ] Computed 201 place invariants in 401 ms
[2023-03-12 21:56:59] [INFO ] Implicit Places using invariants in 2660 ms returned []
Implicit Place search using SMT only with invariants took 2662 ms to find 0 implicit places.
[2023-03-12 21:56:59] [INFO ] Invariant cache hit.
[2023-03-12 21:57:00] [INFO ] Dead Transitions using invariants and state equation in 1617 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4444 ms. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 158 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 1687 steps with 0 reset in 81 ms.
FORMULA CANConstruction-PT-100-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-15 finished in 4800 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-12 21:57:02] [INFO ] Flatten gal took : 1106 ms
[2023-03-12 21:57:02] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-12 21:57:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 21202 places, 40800 transitions and 122000 arcs took 123 ms.
Total runtime 417311 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1083/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CANConstruction-PT-100-LTLFireability-11

BK_STOP 1678658294955

--------------------
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
mcc2023
ltl formula name CANConstruction-PT-100-LTLFireability-11
ltl formula formula --ltl=/tmp/1083/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 21202 places, 40800 transitions and 122000 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 5.030 real 1.470 user 1.670 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1083/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1083/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1083/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1083/ltl_0_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55b7f27103f4]
1: pnml2lts-mc(+0xa2496) [0x55b7f2710496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fbabcbd0140]
3: pnml2lts-mc(+0x405be5) [0x55b7f2a73be5]
4: pnml2lts-mc(+0x16b3f9) [0x55b7f27d93f9]
5: pnml2lts-mc(+0x164ac4) [0x55b7f27d2ac4]
6: pnml2lts-mc(+0x272e0a) [0x55b7f28e0e0a]
7: pnml2lts-mc(+0xb61f0) [0x55b7f27241f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fbabca234d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fbabca2367a]
10: pnml2lts-mc(+0xa1581) [0x55b7f270f581]
11: pnml2lts-mc(+0xa1910) [0x55b7f270f910]
12: pnml2lts-mc(+0xa32a2) [0x55b7f27112a2]
13: pnml2lts-mc(+0xa50f4) [0x55b7f27130f4]
14: pnml2lts-mc(+0xa516b) [0x55b7f271316b]
15: pnml2lts-mc(+0x3f2e60) [0x55b7f2a60e60]
16: pnml2lts-mc(+0x3f30a2) [0x55b7f2a610a2]
17: pnml2lts-mc(+0x6943b) [0x55b7f26d743b]
18: pnml2lts-mc(+0x64be1) [0x55b7f26d2be1]
19: pnml2lts-mc(+0x60a02) [0x55b7f26cea02]
20: pnml2lts-mc(+0x5eb0a) [0x55b7f26ccb0a]
21: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fbabca0bd0a]
22: pnml2lts-mc(+0x6075e) [0x55b7f26ce75e]

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is 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 r041-tajo-167813695000692"
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 ;