fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r330-tall-167889202700033
Last Updated
May 14, 2023

About the Execution of Marcie+red for RERS17pb113-PT-5

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7136.188 3600000.00 3699695.00 7731.50 ??F????????????? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r330-tall-167889202700033.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is RERS17pb113-PT-5, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889202700033
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 7.5K Feb 26 18:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 18:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 26 18:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 18:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 26 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 26 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 15M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679016845092

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=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS17pb113-PT-5
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-17 01:34:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-17 01:34:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 01:34:07] [INFO ] Load time of PNML (sax parser for PT used): 624 ms
[2023-03-17 01:34:07] [INFO ] Transformed 639 places.
[2023-03-17 01:34:07] [INFO ] Transformed 31353 transitions.
[2023-03-17 01:34:07] [INFO ] Parsed PT model containing 639 places and 31353 transitions and 125418 arcs in 816 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Support contains 159 out of 639 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 639/639 places, 31353/31353 transitions.
Ensure Unique test removed 8 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 631 transition count 31353
Applied a total of 8 rules in 187 ms. Remains 631 /639 variables (removed 8) and now considering 31353/31353 (removed 0) transitions.
[2023-03-17 01:34:07] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 631 cols
[2023-03-17 01:34:08] [INFO ] Computed 17 place invariants in 112 ms
[2023-03-17 01:34:09] [INFO ] Implicit Places using invariants in 1819 ms returned []
Implicit Place search using SMT only with invariants took 1844 ms to find 0 implicit places.
[2023-03-17 01:34:09] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-17 01:34:09] [INFO ] Invariant cache hit.
[2023-03-17 01:34:18] [INFO ] Dead Transitions using invariants and state equation in 8811 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 631/639 places, 31353/31353 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10854 ms. Remains : 631/639 places, 31353/31353 transitions.
Support contains 159 out of 631 places after structural reductions.
[2023-03-17 01:34:19] [INFO ] Flatten gal took : 980 ms
[2023-03-17 01:34:20] [INFO ] Flatten gal took : 806 ms
[2023-03-17 01:34:22] [INFO ] Input system was already deterministic with 31353 transitions.
Support contains 156 out of 631 places (down from 159) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 713 ms. (steps per millisecond=14 ) properties (out of 96) seen :47
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 49) seen :0
Running SMT prover for 49 properties.
[2023-03-17 01:34:23] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-17 01:34:23] [INFO ] Invariant cache hit.
[2023-03-17 01:34:25] [INFO ] [Real]Absence check using 13 positive place invariants in 21 ms returned sat
[2023-03-17 01:34:25] [INFO ] [Real]Absence check using 13 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-17 01:34:25] [INFO ] After 780ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:49
[2023-03-17 01:34:25] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-17 01:34:25] [INFO ] [Nat]Absence check using 13 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-17 01:34:50] [INFO ] After 24126ms SMT Verify possible using state equation in natural domain returned unsat :11 sat :37
[2023-03-17 01:34:50] [INFO ] State equation strengthened by 829 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:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
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-17 01:34:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 01:34:50] [INFO ] After 25346ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:49
Fused 49 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 47 ms.
Support contains 73 out of 631 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 631/631 places, 31353/31353 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 627 transition count 31353
Applied a total of 4 rules in 516 ms. Remains 627 /631 variables (removed 4) and now considering 31353/31353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 537 ms. Remains : 627/631 places, 31353/31353 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 522 ms. (steps per millisecond=19 ) properties (out of 38) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Running SMT prover for 31 properties.
[2023-03-17 01:34:51] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2023-03-17 01:34:52] [INFO ] Computed 13 place invariants in 105 ms
[2023-03-17 01:34:52] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-17 01:34:52] [INFO ] After 406ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:31
[2023-03-17 01:34:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-17 01:35:17] [INFO ] After 24381ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :31
[2023-03-17 01:35:18] [INFO ] State equation strengthened by 829 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:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
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-17 01:35:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 01:35:18] [INFO ] After 25409ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:31
Fused 31 Parikh solutions to 18 different solutions.
Parikh walk visited 0 properties in 72 ms.
Support contains 65 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 190 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 627/627 places, 31353/31353 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 519 ms. (steps per millisecond=19 ) properties (out of 31) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Interrupted probabilistic random walk after 22265 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 22265 steps, saw 20115 distinct states, run finished after 3002 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 29 properties.
[2023-03-17 01:35:22] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-17 01:35:22] [INFO ] Invariant cache hit.
[2023-03-17 01:35:22] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-17 01:35:22] [INFO ] After 367ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:29
[2023-03-17 01:35:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-17 01:35:47] [INFO ] After 24456ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :29
[2023-03-17 01:35:47] [INFO ] State equation strengthened by 829 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:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
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-17 01:35:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 01:35:47] [INFO ] After 25154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:29
Fused 29 Parikh solutions to 25 different solutions.
Parikh walk visited 0 properties in 93 ms.
Support contains 61 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 179 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 627/627 places, 31353/31353 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 470 ms. (steps per millisecond=21 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Interrupted probabilistic random walk after 22867 steps, run timeout after 3002 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 22867 steps, saw 20656 distinct states, run finished after 3002 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 29 properties.
[2023-03-17 01:35:51] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-17 01:35:51] [INFO ] Invariant cache hit.
[2023-03-17 01:35:52] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-17 01:35:52] [INFO ] After 377ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:29
[2023-03-17 01:35:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-17 01:36:17] [INFO ] After 24457ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :29
[2023-03-17 01:36:17] [INFO ] State equation strengthened by 829 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:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
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-17 01:36:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 01:36:17] [INFO ] After 25162ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:29
Fused 29 Parikh solutions to 19 different solutions.
Parikh walk visited 0 properties in 71 ms.
Support contains 61 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 191 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 627/627 places, 31353/31353 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 171 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-17 01:36:18] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-17 01:36:18] [INFO ] Invariant cache hit.
[2023-03-17 01:36:19] [INFO ] Implicit Places using invariants in 1781 ms returned []
Implicit Place search using SMT only with invariants took 1796 ms to find 0 implicit places.
[2023-03-17 01:36:19] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-17 01:36:19] [INFO ] Invariant cache hit.
[2023-03-17 01:36:28] [INFO ] Dead Transitions using invariants and state equation in 9127 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11102 ms. Remains : 627/627 places, 31353/31353 transitions.
Successfully simplified 11 atomic propositions for a total of 16 simplifications.
[2023-03-17 01:36:29] [INFO ] Flatten gal took : 589 ms
[2023-03-17 01:36:29] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA RERS17pb113-PT-5-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-17 01:36:30] [INFO ] Flatten gal took : 695 ms
[2023-03-17 01:36:31] [INFO ] Input system was already deterministic with 31353 transitions.
Support contains 135 out of 631 places (down from 146) after GAL structural reductions.
Computed a total of 5 stabilizing places and 1 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 631/631 places, 31353/31353 transitions.
Ensure Unique test removed 4 places
Applied a total of 0 rules in 242 ms. Remains 627 /631 variables (removed 4) and now considering 31353/31353 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 243 ms. Remains : 627/631 places, 31353/31353 transitions.
[2023-03-17 01:36:32] [INFO ] Flatten gal took : 617 ms
[2023-03-17 01:36:33] [INFO ] Flatten gal took : 721 ms
[2023-03-17 01:36:35] [INFO ] Input system was already deterministic with 31353 transitions.
Starting structural reductions in LTL mode, iteration 0 : 631/631 places, 31353/31353 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 627 transition count 31353
Applied a total of 4 rules in 87 ms. Remains 627 /631 variables (removed 4) and now considering 31353/31353 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 88 ms. Remains : 627/631 places, 31353/31353 transitions.
[2023-03-17 01:36:35] [INFO ] Flatten gal took : 581 ms
[2023-03-17 01:36:36] [INFO ] Flatten gal took : 673 ms
[2023-03-17 01:36:38] [INFO ] Input system was already deterministic with 31353 transitions.
Starting structural reductions in LTL mode, iteration 0 : 631/631 places, 31353/31353 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 627 transition count 31353
Applied a total of 4 rules in 90 ms. Remains 627 /631 variables (removed 4) and now considering 31353/31353 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91 ms. Remains : 627/631 places, 31353/31353 transitions.
[2023-03-17 01:36:38] [INFO ] Flatten gal took : 566 ms
[2023-03-17 01:36:39] [INFO ] Flatten gal took : 654 ms
[2023-03-17 01:36:40] [INFO ] Input system was already deterministic with 31353 transitions.
Starting structural reductions in LTL mode, iteration 0 : 631/631 places, 31353/31353 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 627 transition count 31353
Applied a total of 4 rules in 91 ms. Remains 627 /631 variables (removed 4) and now considering 31353/31353 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91 ms. Remains : 627/631 places, 31353/31353 transitions.
[2023-03-17 01:36:41] [INFO ] Flatten gal took : 569 ms
[2023-03-17 01:36:42] [INFO ] Flatten gal took : 730 ms
[2023-03-17 01:36:43] [INFO ] Input system was already deterministic with 31353 transitions.
Starting structural reductions in LTL mode, iteration 0 : 631/631 places, 31353/31353 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 627 transition count 31353
Applied a total of 4 rules in 89 ms. Remains 627 /631 variables (removed 4) and now considering 31353/31353 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 627/631 places, 31353/31353 transitions.
[2023-03-17 01:36:44] [INFO ] Flatten gal took : 571 ms
[2023-03-17 01:36:45] [INFO ] Flatten gal took : 657 ms
[2023-03-17 01:36:46] [INFO ] Input system was already deterministic with 31353 transitions.
Starting structural reductions in LTL mode, iteration 0 : 631/631 places, 31353/31353 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 627 transition count 31353
Applied a total of 4 rules in 90 ms. Remains 627 /631 variables (removed 4) and now considering 31353/31353 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91 ms. Remains : 627/631 places, 31353/31353 transitions.
[2023-03-17 01:36:47] [INFO ] Flatten gal took : 568 ms
[2023-03-17 01:36:48] [INFO ] Flatten gal took : 656 ms
[2023-03-17 01:36:49] [INFO ] Input system was already deterministic with 31353 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 631/631 places, 31353/31353 transitions.
Ensure Unique test removed 4 places
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 626 transition count 31352
Applied a total of 1 rules in 376 ms. Remains 626 /631 variables (removed 5) and now considering 31352/31353 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 377 ms. Remains : 626/631 places, 31352/31353 transitions.
[2023-03-17 01:36:50] [INFO ] Flatten gal took : 563 ms
[2023-03-17 01:36:51] [INFO ] Flatten gal took : 662 ms
[2023-03-17 01:36:52] [INFO ] Input system was already deterministic with 31352 transitions.
Starting structural reductions in LTL mode, iteration 0 : 631/631 places, 31353/31353 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 627 transition count 31353
Applied a total of 4 rules in 91 ms. Remains 627 /631 variables (removed 4) and now considering 31353/31353 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91 ms. Remains : 627/631 places, 31353/31353 transitions.
[2023-03-17 01:36:53] [INFO ] Flatten gal took : 564 ms
[2023-03-17 01:36:53] [INFO ] Flatten gal took : 656 ms
[2023-03-17 01:36:55] [INFO ] Input system was already deterministic with 31353 transitions.
Starting structural reductions in LTL mode, iteration 0 : 631/631 places, 31353/31353 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 627 transition count 31353
Applied a total of 4 rules in 92 ms. Remains 627 /631 variables (removed 4) and now considering 31353/31353 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93 ms. Remains : 627/631 places, 31353/31353 transitions.
[2023-03-17 01:36:56] [INFO ] Flatten gal took : 572 ms
[2023-03-17 01:36:56] [INFO ] Flatten gal took : 659 ms
[2023-03-17 01:36:58] [INFO ] Input system was already deterministic with 31353 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 631/631 places, 31353/31353 transitions.
Ensure Unique test removed 4 places
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 626 transition count 31352
Applied a total of 1 rules in 369 ms. Remains 626 /631 variables (removed 5) and now considering 31352/31353 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 369 ms. Remains : 626/631 places, 31352/31353 transitions.
[2023-03-17 01:36:59] [INFO ] Flatten gal took : 697 ms
[2023-03-17 01:37:00] [INFO ] Flatten gal took : 622 ms
[2023-03-17 01:37:01] [INFO ] Input system was already deterministic with 31352 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 24724 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 24724 steps, saw 22319 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 01:37:04] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-17 01:37:05] [INFO ] Computed 13 place invariants in 59 ms
[2023-03-17 01:37:05] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-17 01:37:22] [INFO ] After 17364ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 01:37:22] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-17 01:37:39] [INFO ] After 16812ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 01:37:39] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-17 01:37:47] [INFO ] After 8026ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-17 01:37:47] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 160 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 626/626 places, 31352/31352 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 2973 ms. (steps per millisecond=33 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-17 01:37:50] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-17 01:37:50] [INFO ] Invariant cache hit.
[2023-03-17 01:37:50] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-17 01:38:08] [INFO ] After 17561ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 01:38:08] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-17 01:38:17] [INFO ] After 8327ms SMT Verify possible using 268 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-17 01:38:19] [INFO ] Deduced a trap composed of 40 places in 680 ms of which 3 ms to minimize.
[2023-03-17 01:38:19] [INFO ] Deduced a trap composed of 40 places in 503 ms of which 0 ms to minimize.
[2023-03-17 01:38:20] [INFO ] Deduced a trap composed of 40 places in 387 ms of which 1 ms to minimize.
[2023-03-17 01:38:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3261 ms
[2023-03-17 01:38:21] [INFO ] After 12712ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 01:38:21] [INFO ] After 30690ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 01:38:21] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-17 01:38:37] [INFO ] After 16297ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 01:38:45] [INFO ] After 7693ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 01:38:47] [INFO ] Deduced a trap composed of 40 places in 810 ms of which 1 ms to minimize.
[2023-03-17 01:38:48] [INFO ] Deduced a trap composed of 40 places in 715 ms of which 1 ms to minimize.
[2023-03-17 01:38:49] [INFO ] Deduced a trap composed of 64 places in 525 ms of which 0 ms to minimize.
[2023-03-17 01:38:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3676 ms
[2023-03-17 01:38:49] [INFO ] After 12117ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 811 ms.
[2023-03-17 01:38:50] [INFO ] After 29313ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 29422 ms. (steps per millisecond=33 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2362 ms. (steps per millisecond=423 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 833951 steps, run timeout after 93001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 833951 steps, saw 751447 distinct states, run finished after 93002 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 01:40:55] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-17 01:40:55] [INFO ] Invariant cache hit.
[2023-03-17 01:40:55] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-17 01:41:14] [INFO ] After 18712ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 01:41:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-17 01:41:31] [INFO ] After 17238ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 01:41:31] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-17 01:41:38] [INFO ] After 7264ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 01:41:40] [INFO ] Deduced a trap composed of 40 places in 550 ms of which 2 ms to minimize.
[2023-03-17 01:41:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1359 ms
[2023-03-17 01:41:40] [INFO ] After 9028ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 749 ms.
[2023-03-17 01:41:41] [INFO ] After 27222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 170 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 168 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-17 01:41:41] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-17 01:41:41] [INFO ] Invariant cache hit.
[2023-03-17 01:41:43] [INFO ] Implicit Places using invariants in 1753 ms returned []
Implicit Place search using SMT only with invariants took 1755 ms to find 0 implicit places.
[2023-03-17 01:41:43] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-17 01:41:43] [INFO ] Invariant cache hit.
[2023-03-17 01:41:52] [INFO ] Dead Transitions using invariants and state equation in 8712 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10656 ms. Remains : 626/626 places, 31352/31352 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 2795 ms. (steps per millisecond=35 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-17 01:41:55] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-17 01:41:55] [INFO ] Invariant cache hit.
[2023-03-17 01:41:55] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-17 01:42:12] [INFO ] After 17716ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 01:42:13] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-17 01:42:21] [INFO ] After 8154ms SMT Verify possible using 268 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-17 01:42:23] [INFO ] Deduced a trap composed of 40 places in 607 ms of which 1 ms to minimize.
[2023-03-17 01:42:23] [INFO ] Deduced a trap composed of 40 places in 486 ms of which 0 ms to minimize.
[2023-03-17 01:42:24] [INFO ] Deduced a trap composed of 40 places in 393 ms of which 1 ms to minimize.
[2023-03-17 01:42:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3028 ms
[2023-03-17 01:42:25] [INFO ] After 12193ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 01:42:25] [INFO ] After 30071ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 01:42:25] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-17 01:42:41] [INFO ] After 15856ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 01:42:47] [INFO ] After 6687ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 01:42:49] [INFO ] Deduced a trap composed of 40 places in 865 ms of which 1 ms to minimize.
[2023-03-17 01:42:50] [INFO ] Deduced a trap composed of 40 places in 676 ms of which 0 ms to minimize.
[2023-03-17 01:42:51] [INFO ] Deduced a trap composed of 64 places in 537 ms of which 0 ms to minimize.
[2023-03-17 01:42:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3597 ms
[2023-03-17 01:42:52] [INFO ] After 10946ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 852 ms.
[2023-03-17 01:42:53] [INFO ] After 27753ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 24836 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 24836 steps, saw 22417 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 01:42:56] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-17 01:42:56] [INFO ] Invariant cache hit.
[2023-03-17 01:42:56] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-17 01:43:14] [INFO ] After 17764ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 01:43:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-17 01:43:30] [INFO ] After 16421ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 01:43:30] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-17 01:43:37] [INFO ] After 6871ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 01:43:39] [INFO ] Deduced a trap composed of 40 places in 389 ms of which 1 ms to minimize.
[2023-03-17 01:43:41] [INFO ] Deduced a trap composed of 64 places in 2735 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:669)
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-17 01:43:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 01:43:41] [INFO ] After 27806ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 170 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 626/626 places, 31352/31352 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 24771 steps, run timeout after 3002 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 24771 steps, saw 22360 distinct states, run finished after 3002 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 01:43:45] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-17 01:43:45] [INFO ] Invariant cache hit.
[2023-03-17 01:43:45] [INFO ] [Real]Absence check using 13 positive place invariants in 28 ms returned sat
[2023-03-17 01:44:02] [INFO ] After 17304ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 01:44:02] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-17 01:44:18] [INFO ] After 15994ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 01:44:18] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-17 01:44:25] [INFO ] After 6783ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 01:44:27] [INFO ] Deduced a trap composed of 40 places in 401 ms of which 0 ms to minimize.
[2023-03-17 01:44:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1196 ms
[2023-03-17 01:44:27] [INFO ] After 8821ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-17 01:44:27] [INFO ] After 25041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 155 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 156 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-17 01:44:28] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-17 01:44:28] [INFO ] Invariant cache hit.
[2023-03-17 01:44:29] [INFO ] Implicit Places using invariants in 1756 ms returned []
Implicit Place search using SMT only with invariants took 1776 ms to find 0 implicit places.
[2023-03-17 01:44:29] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-17 01:44:29] [INFO ] Invariant cache hit.
[2023-03-17 01:44:38] [INFO ] Dead Transitions using invariants and state equation in 8633 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10578 ms. Remains : 626/626 places, 31352/31352 transitions.
Ensure Unique test removed 13027 transitions
Reduce isomorphic transitions removed 13027 transitions.
Iterating post reduction 0 with 13027 rules applied. Total rules applied 13027 place count 626 transition count 18325
Applied a total of 13027 rules in 680 ms. Remains 626 /626 variables (removed 0) and now considering 18325/31352 (removed 13027) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-17 01:44:39] [INFO ] Computed 13 place invariants in 64 ms
[2023-03-17 01:44:39] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-17 01:44:52] [INFO ] After 13255ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 01:44:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-17 01:45:07] [INFO ] After 14354ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 01:45:08] [INFO ] After 15720ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 587 ms.
[2023-03-17 01:45:09] [INFO ] After 16429ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Starting structural reductions in SI_CTL mode, iteration 0 : 631/631 places, 31353/31353 transitions.
Ensure Unique test removed 4 places
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 626 transition count 31352
Applied a total of 1 rules in 319 ms. Remains 626 /631 variables (removed 5) and now considering 31352/31353 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 319 ms. Remains : 626/631 places, 31352/31353 transitions.
[2023-03-17 01:45:10] [INFO ] Flatten gal took : 568 ms
[2023-03-17 01:45:10] [INFO ] Flatten gal took : 664 ms
[2023-03-17 01:45:12] [INFO ] Input system was already deterministic with 31352 transitions.
Starting structural reductions in LTL mode, iteration 0 : 631/631 places, 31353/31353 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 627 transition count 31353
Applied a total of 4 rules in 89 ms. Remains 627 /631 variables (removed 4) and now considering 31353/31353 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90 ms. Remains : 627/631 places, 31353/31353 transitions.
[2023-03-17 01:45:12] [INFO ] Flatten gal took : 566 ms
[2023-03-17 01:45:13] [INFO ] Flatten gal took : 664 ms
[2023-03-17 01:45:14] [INFO ] Input system was already deterministic with 31353 transitions.
Starting structural reductions in LTL mode, iteration 0 : 631/631 places, 31353/31353 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 627 transition count 31353
Applied a total of 4 rules in 87 ms. Remains 627 /631 variables (removed 4) and now considering 31353/31353 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 627/631 places, 31353/31353 transitions.
[2023-03-17 01:45:15] [INFO ] Flatten gal took : 576 ms
[2023-03-17 01:45:16] [INFO ] Flatten gal took : 656 ms
[2023-03-17 01:45:17] [INFO ] Input system was already deterministic with 31353 transitions.
Starting structural reductions in LTL mode, iteration 0 : 631/631 places, 31353/31353 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 627 transition count 31353
Applied a total of 4 rules in 91 ms. Remains 627 /631 variables (removed 4) and now considering 31353/31353 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92 ms. Remains : 627/631 places, 31353/31353 transitions.
[2023-03-17 01:45:18] [INFO ] Flatten gal took : 580 ms
[2023-03-17 01:45:18] [INFO ] Flatten gal took : 667 ms
[2023-03-17 01:45:20] [INFO ] Input system was already deterministic with 31353 transitions.
Starting structural reductions in LTL mode, iteration 0 : 631/631 places, 31353/31353 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 628 transition count 31353
Applied a total of 3 rules in 89 ms. Remains 628 /631 variables (removed 3) and now considering 31353/31353 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90 ms. Remains : 628/631 places, 31353/31353 transitions.
[2023-03-17 01:45:20] [INFO ] Flatten gal took : 562 ms
[2023-03-17 01:45:21] [INFO ] Flatten gal took : 654 ms
[2023-03-17 01:45:22] [INFO ] Input system was already deterministic with 31353 transitions.
[2023-03-17 01:45:23] [INFO ] Flatten gal took : 635 ms
[2023-03-17 01:45:24] [INFO ] Flatten gal took : 656 ms
[2023-03-17 01:45:24] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-17 01:45:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 631 places, 31353 transitions and 125410 arcs took 131 ms.
Total runtime 677991 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 631 NrTr: 31353 NrArc: 125410)

parse formulas
formulas created successfully
place and transition orderings generation:0m 2.847sec

net check time: 0m 0.023sec

init dd package: 0m 2.526sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10461628 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16062572 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 6.791sec

2152 2513 3602 3598 5251 6262 8282 9829 7553 8318 9371 8318 9769 13473 12488 12766 14977 14611 15615 17184 17885 16682 17210 16945 16464 16495 14292 12595 14007 16433 15148 16579 15999 17270 18707 19234 17623 17717 17885 17086 16817 17112 17049 18535 15359 14574 12926 14014 14803 18234 17295 19609 20806 22700 23139 21934 20067 19293 20636 20727 21171 24058 23199 23199 24119 22977 21935 21715 23665 23248 25417 24790 24145 19808 20445 20819 21948 22925 24460 24599 23275 23339 22124 21111 19830 20565 22634 22178 24927 26367 28711 29308 28220 25849 24681 25801 25882 26318 29526 29500 28489 29435 28076 26752 27026 29237 28661 30992 29850 29388 23722 24353 24762 25838 26260 27661 27048 25134 25422 23812 21406 20924 21108 21304 22445 23215 25094 25613 24789 21802 23195 21488 23579 24760 26009 25543 24446 21590 22442 20154 21559 21004 19292 22835 22518 24119 23792 22864 21813 23053 20992 23476 23123 24063 23601 22012 21492 20961 20433 20056 21673 22334 24771 20732 30093 29949 30825 30466 34224 32446

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="RERS17pb113-PT-5"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is RERS17pb113-PT-5, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r330-tall-167889202700033"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RERS17pb113-PT-5.tgz
mv RERS17pb113-PT-5 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;