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

About the Execution of Marcie+red for CANConstruction-PT-100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9543.724 3600000.00 3717682.00 750.70 ?FFTTFF?TFT?TFTT normal

Execution Chart

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

Trace from the execution

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

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678742700400

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-100
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 21:25:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 21:25:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 21:25:03] [INFO ] Load time of PNML (sax parser for PT used): 741 ms
[2023-03-13 21:25:03] [INFO ] Transformed 21202 places.
[2023-03-13 21:25:03] [INFO ] Transformed 40800 transitions.
[2023-03-13 21:25:03] [INFO ] Parsed PT model containing 21202 places and 40800 transitions and 122000 arcs in 1019 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 45 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 5 resets, run finished after 922 ms. (steps per millisecond=10 ) properties (out of 16) seen :2
FORMULA CANConstruction-PT-100-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-100-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 40800 rows 21202 cols
[2023-03-13 21:25:05] [INFO ] Computed 201 place invariants in 547 ms
[2023-03-13 21:25:13] [INFO ] After 7750ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-13 21:25:21] [INFO ] [Nat]Absence check using 101 positive place invariants in 597 ms returned sat
[2023-03-13 21:25:21] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 239 ms returned sat
[2023-03-13 21:25:38] [INFO ] After 12828ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :11
[2023-03-13 21:25:38] [INFO ] State equation strengthened by 19900 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java: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.Application.startNoEx(Application.java:902)
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-13 21:25:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 21:25:38] [INFO ] After 25495ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
FORMULA CANConstruction-PT-100-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CANConstruction-PT-100-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 242 out of 21202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 669 transitions
Trivial Post-agglo rules discarded 669 transitions
Performed 669 trivial Post agglomeration. Transition count delta: 669
Iterating post reduction 0 with 669 rules applied. Total rules applied 669 place count 21202 transition count 40131
Reduce places removed 669 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 682 rules applied. Total rules applied 1351 place count 20533 transition count 40118
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 1364 place count 20520 transition count 40118
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 1364 place count 20520 transition count 40111
Deduced a syphon composed of 7 places in 31 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1378 place count 20513 transition count 40111
Discarding 9674 places :
Symmetric choice reduction at 3 with 9674 rule applications. Total rules 11052 place count 10839 transition count 20763
Iterating global reduction 3 with 9674 rules applied. Total rules applied 20726 place count 10839 transition count 20763
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 27 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 20906 place count 10749 transition count 20673
Free-agglomeration rule applied 52 times.
Iterating global reduction 3 with 52 rules applied. Total rules applied 20958 place count 10749 transition count 20621
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 3 with 52 rules applied. Total rules applied 21010 place count 10697 transition count 20621
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 21014 place count 10697 transition count 20617
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 21018 place count 10693 transition count 20617
Partial Free-agglomeration rule applied 149 times.
Drop transitions removed 149 transitions
Iterating global reduction 5 with 149 rules applied. Total rules applied 21167 place count 10693 transition count 20617
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 21168 place count 10693 transition count 20617
Applied a total of 21168 rules in 21350 ms. Remains 10693 /21202 variables (removed 10509) and now considering 20617/40800 (removed 20183) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21356 ms. Remains : 10693/21202 places, 20617/40800 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 980 ms. (steps per millisecond=10 ) properties (out of 12) seen :3
FORMULA CANConstruction-PT-100-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-100-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-100-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 20617 rows 10693 cols
[2023-03-13 21:26:01] [INFO ] Computed 201 place invariants in 162 ms
[2023-03-13 21:26:04] [INFO ] After 2947ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-13 21:26:08] [INFO ] [Nat]Absence check using 101 positive place invariants in 409 ms returned sat
[2023-03-13 21:26:08] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 146 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
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-13 21:26:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 21:26:29] [INFO ] After 25057ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 223 out of 10693 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10693/10693 places, 20617/20617 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 5 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 10683 transition count 20607
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 10683 transition count 20607
Applied a total of 21 rules in 10802 ms. Remains 10683 /10693 variables (removed 10) and now considering 20607/20617 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10802 ms. Remains : 10683/10693 places, 20607/20617 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 966 ms. (steps per millisecond=10 ) properties (out of 9) seen :3
FORMULA CANConstruction-PT-100-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-100-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-100-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 20607 rows 10683 cols
[2023-03-13 21:26:42] [INFO ] Computed 201 place invariants in 357 ms
[2023-03-13 21:26:44] [INFO ] After 2665ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 21:26:48] [INFO ] [Nat]Absence check using 101 positive place invariants in 529 ms returned sat
[2023-03-13 21:26:48] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 254 ms returned sat
[2023-03-13 21:27:09] [INFO ] After 20693ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 21:27:10] [INFO ] State equation strengthened by 20069 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.Application.startNoEx(Application.java:902)
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-13 21:27:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 21:27:10] [INFO ] After 25562ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 187 out of 10683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10683/10683 places, 20607/20607 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 10683 transition count 20606
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 10682 transition count 20606
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 5 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 46 place count 10660 transition count 20584
Applied a total of 46 rules in 8275 ms. Remains 10660 /10683 variables (removed 23) and now considering 20584/20607 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8284 ms. Remains : 10660/10683 places, 20584/20607 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 989 ms. (steps per millisecond=10 ) properties (out of 6) seen :1
FORMULA CANConstruction-PT-100-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 20584 rows 10660 cols
[2023-03-13 21:27:20] [INFO ] Computed 201 place invariants in 218 ms
[2023-03-13 21:27:22] [INFO ] After 2544ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 21:27:25] [INFO ] [Nat]Absence check using 101 positive place invariants in 617 ms returned sat
[2023-03-13 21:27:26] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 332 ms returned sat
[2023-03-13 21:27:47] [INFO ] After 21000ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 21:27:48] [INFO ] State equation strengthened by 20091 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.Application.startNoEx(Application.java:902)
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-13 21:27:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 21:27:48] [INFO ] After 25259ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 186 out of 10660 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10660/10660 places, 20584/20584 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 10659 transition count 20583
Applied a total of 2 rules in 7081 ms. Remains 10659 /10660 variables (removed 1) and now considering 20583/20584 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7084 ms. Remains : 10659/10660 places, 20583/20584 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 973 ms. (steps per millisecond=10 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 95674 steps, run timeout after 3002 ms. (steps per millisecond=31 ) properties seen :{3=1}
Probabilistic random walk after 95674 steps, saw 93811 distinct states, run finished after 3017 ms. (steps per millisecond=31 ) properties seen :1
FORMULA CANConstruction-PT-100-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 4 properties.
// Phase 1: matrix 20583 rows 10659 cols
[2023-03-13 21:27:59] [INFO ] Computed 201 place invariants in 126 ms
[2023-03-13 21:28:01] [INFO ] After 1767ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 21:28:04] [INFO ] [Nat]Absence check using 101 positive place invariants in 362 ms returned sat
[2023-03-13 21:28:04] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 111 ms returned sat
[2023-03-13 21:28:26] [INFO ] After 21480ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 21:28:26] [INFO ] State equation strengthened by 20092 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.Application.startNoEx(Application.java:902)
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-13 21:28:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 21:28:26] [INFO ] After 25356ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 29 ms.
Support contains 121 out of 10659 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10659/10659 places, 20583/20583 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 10659 transition count 20582
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 10658 transition count 20582
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 6 place count 10654 transition count 20574
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 10654 transition count 20574
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 60 place count 10629 transition count 20549
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 66 place count 10626 transition count 20550
Applied a total of 66 rules in 14239 ms. Remains 10626 /10659 variables (removed 33) and now considering 20550/20583 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14240 ms. Remains : 10626/10659 places, 20550/20583 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 493 ms. (steps per millisecond=20 ) properties (out of 4) seen :1
FORMULA CANConstruction-PT-100-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 20550 rows 10626 cols
[2023-03-13 21:28:41] [INFO ] Computed 201 place invariants in 123 ms
[2023-03-13 21:28:43] [INFO ] After 1751ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 21:28:45] [INFO ] [Nat]Absence check using 101 positive place invariants in 288 ms returned sat
[2023-03-13 21:28:46] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 160 ms returned sat
[2023-03-13 21:29:01] [INFO ] After 14890ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 21:29:01] [INFO ] State equation strengthened by 20124 read => feed constraints.
[2023-03-13 21:29:05] [INFO ] After 4280ms SMT Verify possible using 20124 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 21:29:49] [INFO ] Deduced a trap composed of 2 places in 41219 ms of which 21 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java: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.Application.startNoEx(Application.java:902)
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-13 21:29:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 21:29:49] [INFO ] After 66248ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 119 out of 10626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10626/10626 places, 20550/20550 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 10625 transition count 20549
Applied a total of 2 rules in 7333 ms. Remains 10625 /10626 variables (removed 1) and now considering 20549/20550 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7333 ms. Remains : 10625/10626 places, 20549/20550 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 704 ms. (steps per millisecond=14 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 81928 steps, run timeout after 3004 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 81928 steps, saw 80411 distinct states, run finished after 3005 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 20549 rows 10625 cols
[2023-03-13 21:30:01] [INFO ] Computed 201 place invariants in 223 ms
[2023-03-13 21:30:03] [INFO ] After 1853ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 21:30:05] [INFO ] [Nat]Absence check using 101 positive place invariants in 305 ms returned sat
[2023-03-13 21:30:05] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 161 ms returned sat
[2023-03-13 21:30:22] [INFO ] After 16304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 21:30:22] [INFO ] State equation strengthened by 20125 read => feed constraints.
[2023-03-13 21:30:26] [INFO ] After 4082ms SMT Verify possible using 20125 Read/Feed constraints in natural domain returned unsat :0 sat :3
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2023-03-13 21:31:03] [INFO ] Deduced a trap composed of 2 places in 35638 ms of which 10 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java: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.Application.startNoEx(Application.java:902)
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-13 21:31:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 21:31:04] [INFO ] After 60741ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 119 out of 10625 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10625/10625 places, 20549/20549 transitions.
Applied a total of 0 rules in 3304 ms. Remains 10625 /10625 variables (removed 0) and now considering 20549/20549 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3304 ms. Remains : 10625/10625 places, 20549/20549 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10625/10625 places, 20549/20549 transitions.
Applied a total of 0 rules in 3514 ms. Remains 10625 /10625 variables (removed 0) and now considering 20549/20549 (removed 0) transitions.
[2023-03-13 21:31:10] [INFO ] Invariant cache hit.
[2023-03-13 21:31:11] [INFO ] Implicit Places using invariants in 1037 ms returned []
Implicit Place search using SMT only with invariants took 1038 ms to find 0 implicit places.
[2023-03-13 21:31:11] [INFO ] Invariant cache hit.
[2023-03-13 21:31:13] [INFO ] Dead Transitions using invariants and state equation in 1205 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5764 ms. Remains : 10625/10625 places, 20549/20549 transitions.
[2023-03-13 21:31:13] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2023-03-13 21:31:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 10625 places, 20549 transitions and 82004 arcs took 116 ms.
[2023-03-13 21:31:14] [INFO ] Flatten gal took : 936 ms
Total runtime 372319 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=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: gen
(NrP: 10625 NrTr: 20549 NrArc: 82004)

parse formulas
formulas created successfully
place and transition orderings generation:0m32.094sec

net check time: 0m 0.024sec

init dd package: 0m 3.214sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 6580072 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16066680 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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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 0.711sec

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANConstruction-PT-100"
export BK_EXAMINATION="ReachabilityCardinality"
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 CANConstruction-PT-100, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r042-tajo-167813696100694"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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