Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 39M
-rw-r--r-- 1 mcc users 9.3K Feb 26 01:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 01:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 00:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 00:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 01:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 01:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 26 01:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 26 01:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:41 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 39M 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 CANInsertWithFailure-PT-080-ReachabilityCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678665892827

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-080
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-13 00:04:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 00:04:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 00:04:56] [INFO ] Load time of PNML (sax parser for PT used): 1247 ms
[2023-03-13 00:04:56] [INFO ] Transformed 13764 places.
[2023-03-13 00:04:56] [INFO ] Transformed 38880 transitions.
[2023-03-13 00:04:56] [INFO ] Parsed PT model containing 13764 places and 38880 transitions and 104000 arcs in 1508 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 69 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 5 resets, run finished after 941 ms. (steps per millisecond=10 ) properties (out of 16) seen :2
FORMULA CANInsertWithFailure-PT-080-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-080-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) 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 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 22 ms. (steps per millisecond=454 ) 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 36 ms. (steps per millisecond=277 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) 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 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 52 ms. (steps per millisecond=192 ) properties (out of 14) 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 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 38880 rows 13764 cols
[2023-03-13 00:05:07] [INFO ] Computed 83 place invariants in 8905 ms
[2023-03-13 00:05:11] [INFO ] After 4493ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-13 00:05:16] [INFO ] [Nat]Absence check using 81 positive place invariants in 225 ms returned sat
[2023-03-13 00:05:16] [INFO ] [Nat]Absence check using 81 positive and 2 generalized place invariants in 331 ms returned sat
[2023-03-13 00:05:36] [INFO ] After 16993ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-13 00:05:36] [INFO ] State equation strengthened by 12720 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 00:05:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:05:36] [INFO ] After 25239ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 248 out of 13764 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13764/13764 places, 38880/38880 transitions.
Graph (complete) has 52401 edges and 13764 vertex of which 13763 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.39 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 513 transitions
Trivial Post-agglo rules discarded 513 transitions
Performed 513 trivial Post agglomeration. Transition count delta: 513
Iterating post reduction 0 with 513 rules applied. Total rules applied 514 place count 13763 transition count 38367
Reduce places removed 513 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 1 with 528 rules applied. Total rules applied 1042 place count 13250 transition count 38352
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 1057 place count 13235 transition count 38352
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 1057 place count 13235 transition count 38344
Deduced a syphon composed of 8 places in 31 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 1073 place count 13227 transition count 38344
Performed 6107 Post agglomeration using F-continuation condition.Transition count delta: 6107
Deduced a syphon composed of 6107 places in 30 ms
Reduce places removed 6107 places and 0 transitions.
Iterating global reduction 3 with 12214 rules applied. Total rules applied 13287 place count 7120 transition count 32237
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 13296 place count 7120 transition count 32228
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 13305 place count 7111 transition count 32228
Partial Free-agglomeration rule applied 6623 times.
Drop transitions removed 6623 transitions
Iterating global reduction 4 with 6623 rules applied. Total rules applied 19928 place count 7111 transition count 32228
Partial Free-agglomeration rule applied 717 times.
Drop transitions removed 717 transitions
Iterating global reduction 4 with 717 rules applied. Total rules applied 20645 place count 7111 transition count 32228
Applied a total of 20645 rules in 16970 ms. Remains 7111 /13764 variables (removed 6653) and now considering 32228/38880 (removed 6652) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16975 ms. Remains : 7111/13764 places, 32228/38880 transitions.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 668 ms. (steps per millisecond=14 ) properties (out of 14) seen :4
FORMULA CANInsertWithFailure-PT-080-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-080-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-080-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-080-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) 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 10) 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 10) 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 10) 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 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-13 00:05:54] [INFO ] Flow matrix only has 32137 transitions (discarded 91 similar events)
// Phase 1: matrix 32137 rows 7111 cols
[2023-03-13 00:05:57] [INFO ] Computed 82 place invariants in 2536 ms
[2023-03-13 00:05:59] [INFO ] After 2113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-13 00:06:01] [INFO ] [Nat]Absence check using 80 positive place invariants in 116 ms returned sat
[2023-03-13 00:06:01] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 144 ms returned sat
[2023-03-13 00:06:24] [INFO ] After 21092ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-13 00:06:24] [INFO ] State equation strengthened by 30589 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 00:06:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:06:24] [INFO ] After 25097ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Fused 10 Parikh solutions to 1 different solutions.
FORMULA CANInsertWithFailure-PT-080-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 99 ms.
Support contains 129 out of 7111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7111/7111 places, 32228/32228 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 7111 transition count 32225
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 7108 transition count 32225
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 9 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 132 place count 7045 transition count 32162
Partial Free-agglomeration rule applied 53 times.
Drop transitions removed 53 transitions
Iterating global reduction 2 with 53 rules applied. Total rules applied 185 place count 7045 transition count 32162
Applied a total of 185 rules in 7372 ms. Remains 7045 /7111 variables (removed 66) and now considering 32162/32228 (removed 66) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7372 ms. Remains : 7045/7111 places, 32162/32228 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 534 ms. (steps per millisecond=18 ) properties (out of 9) seen :1
FORMULA CANInsertWithFailure-PT-080-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) 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 8) 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 8) 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 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) 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 8) seen :0
Running SMT prover for 8 properties.
[2023-03-13 00:06:32] [INFO ] Flow matrix only has 32121 transitions (discarded 41 similar events)
// Phase 1: matrix 32121 rows 7045 cols
[2023-03-13 00:06:35] [INFO ] Computed 82 place invariants in 2352 ms
[2023-03-13 00:06:36] [INFO ] After 1603ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-13 00:06:38] [INFO ] [Nat]Absence check using 80 positive place invariants in 111 ms returned sat
[2023-03-13 00:06:38] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 130 ms returned sat
[2023-03-13 00:06:58] [INFO ] After 18998ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-13 00:06:59] [INFO ] State equation strengthened by 31130 read => feed constraints.
[2023-03-13 00:07:01] [INFO ] After 2724ms SMT Verify possible using 31130 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-13 00:07:01] [INFO ] After 2726ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-13 00:07:01] [INFO ] After 25064ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 98 ms.
Support contains 124 out of 7045 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7045/7045 places, 32162/32162 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 10 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 7041 transition count 32158
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 7041 transition count 32158
Applied a total of 9 rules in 7301 ms. Remains 7041 /7045 variables (removed 4) and now considering 32158/32162 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7301 ms. Remains : 7041/7045 places, 32158/32162 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 436 ms. (steps per millisecond=22 ) properties (out of 8) seen :2
FORMULA CANInsertWithFailure-PT-080-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-080-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) 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 6) 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 6) 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 6) 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 6) 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 6) seen :0
Running SMT prover for 6 properties.
[2023-03-13 00:07:09] [INFO ] Flow matrix only has 32118 transitions (discarded 40 similar events)
// Phase 1: matrix 32118 rows 7041 cols
[2023-03-13 00:07:12] [INFO ] Computed 82 place invariants in 2406 ms
[2023-03-13 00:07:13] [INFO ] After 1435ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 00:07:15] [INFO ] [Nat]Absence check using 80 positive place invariants in 76 ms returned sat
[2023-03-13 00:07:15] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 127 ms returned sat
[2023-03-13 00:07:38] [INFO ] After 22812ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 00:07:39] [INFO ] State equation strengthened by 31140 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 00:07:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:07:39] [INFO ] After 25382ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 48 ms.
Support contains 109 out of 7041 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7041/7041 places, 32158/32158 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 7041 transition count 32157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7040 transition count 32157
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 2 with 20 rules applied. Total rules applied 22 place count 7030 transition count 32147
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 27 place count 7030 transition count 32147
Applied a total of 27 rules in 6870 ms. Remains 7030 /7041 variables (removed 11) and now considering 32147/32158 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6870 ms. Remains : 7030/7041 places, 32147/32158 transitions.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 416 ms. (steps per millisecond=24 ) properties (out of 6) seen :2
FORMULA CANInsertWithFailure-PT-080-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-080-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) 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 4) 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 4) 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 4) seen :0
Running SMT prover for 4 properties.
[2023-03-13 00:07:46] [INFO ] Flow matrix only has 32112 transitions (discarded 35 similar events)
// Phase 1: matrix 32112 rows 7030 cols
[2023-03-13 00:07:48] [INFO ] Computed 82 place invariants in 2308 ms
[2023-03-13 00:07:50] [INFO ] After 1202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 00:07:51] [INFO ] [Nat]Absence check using 80 positive place invariants in 110 ms returned sat
[2023-03-13 00:07:51] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 127 ms returned sat
[2023-03-13 00:08:09] [INFO ] After 17926ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 00:08:10] [INFO ] State equation strengthened by 31248 read => feed constraints.
[2023-03-13 00:08:15] [INFO ] After 4870ms SMT Verify possible using 31248 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 00:08:15] [INFO ] After 4871ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-13 00:08:15] [INFO ] After 25063ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 74 ms.
Support contains 79 out of 7030 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7030/7030 places, 32147/32147 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 7030 transition count 32146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7029 transition count 32146
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 6 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 38 place count 7011 transition count 32128
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 50 place count 7011 transition count 32128
Applied a total of 50 rules in 7463 ms. Remains 7011 /7030 variables (removed 19) and now considering 32128/32147 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7464 ms. Remains : 7011/7030 places, 32128/32147 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 380 ms. (steps per millisecond=26 ) properties (out of 4) seen :1
FORMULA CANInsertWithFailure-PT-080-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) 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 3) 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 3) seen :0
Running SMT prover for 3 properties.
[2023-03-13 00:08:23] [INFO ] Flow matrix only has 32102 transitions (discarded 26 similar events)
// Phase 1: matrix 32102 rows 7011 cols
[2023-03-13 00:08:25] [INFO ] Computed 82 place invariants in 2205 ms
[2023-03-13 00:08:26] [INFO ] After 1130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 00:08:27] [INFO ] [Nat]Absence check using 80 positive place invariants in 108 ms returned sat
[2023-03-13 00:08:27] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 130 ms returned sat
[2023-03-13 00:08:44] [INFO ] After 16256ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 00:08:44] [INFO ] State equation strengthened by 31383 read => feed constraints.
[2023-03-13 00:08:51] [INFO ] After 6877ms SMT Verify possible using 31383 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 00:08:51] [INFO ] After 6878ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-13 00:08:51] [INFO ] After 25111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 51 out of 7011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7011/7011 places, 32128/32128 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 7011 transition count 32127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7010 transition count 32127
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 7 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 36 place count 6993 transition count 32110
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 46 place count 6993 transition count 32110
Applied a total of 46 rules in 7663 ms. Remains 6993 /7011 variables (removed 18) and now considering 32110/32128 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7663 ms. Remains : 6993/7011 places, 32110/32128 transitions.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 382 ms. (steps per millisecond=26 ) properties (out of 3) 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 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 85923 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 85923 steps, saw 80199 distinct states, run finished after 3004 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-13 00:09:02] [INFO ] Flow matrix only has 32094 transitions (discarded 16 similar events)
// Phase 1: matrix 32094 rows 6993 cols
[2023-03-13 00:09:04] [INFO ] Computed 82 place invariants in 2260 ms
[2023-03-13 00:09:05] [INFO ] After 926ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 00:09:06] [INFO ] [Nat]Absence check using 80 positive place invariants in 58 ms returned sat
[2023-03-13 00:09:06] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 95 ms returned sat
[2023-03-13 00:09:25] [INFO ] After 18317ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 00:09:25] [INFO ] State equation strengthened by 31592 read => feed constraints.
[2023-03-13 00:09:30] [INFO ] After 5242ms SMT Verify possible using 31592 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 00:09:30] [INFO ] After 5243ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-13 00:09:30] [INFO ] After 25055ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 36 ms.
Support contains 51 out of 6993 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6993/6993 places, 32110/32110 transitions.
Applied a total of 0 rules in 2586 ms. Remains 6993 /6993 variables (removed 0) and now considering 32110/32110 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2587 ms. Remains : 6993/6993 places, 32110/32110 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6993/6993 places, 32110/32110 transitions.
Applied a total of 0 rules in 2533 ms. Remains 6993 /6993 variables (removed 0) and now considering 32110/32110 (removed 0) transitions.
[2023-03-13 00:09:36] [INFO ] Flow matrix only has 32094 transitions (discarded 16 similar events)
[2023-03-13 00:09:36] [INFO ] Invariant cache hit.
[2023-03-13 00:09:41] [INFO ] Implicit Places using invariants in 5308 ms returned []
Implicit Place search using SMT only with invariants took 5309 ms to find 0 implicit places.
[2023-03-13 00:09:41] [INFO ] Flow matrix only has 32094 transitions (discarded 16 similar events)
[2023-03-13 00:09:41] [INFO ] Invariant cache hit.
[2023-03-13 00:09:58] [INFO ] Dead Transitions using invariants and state equation in 16803 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24650 ms. Remains : 6993/6993 places, 32110/32110 transitions.
Graph (trivial) has 31121 edges and 6993 vertex of which 6455 / 6993 are part of one of the 2 SCC in 10 ms
Free SCC test removed 6453 places
Drop transitions removed 24378 transitions
Ensure Unique test removed 6463 transitions
Reduce isomorphic transitions removed 30841 transitions.
Graph (complete) has 1755 edges and 540 vertex of which 305 are kept as prefixes of interest. Removing 235 places using SCC suffix rule.0 ms
Discarding 235 places :
Also discarding 77 output transitions
Drop transitions removed 77 transitions
Drop transitions removed 312 transitions
Reduce isomorphic transitions removed 312 transitions.
Iterating post reduction 0 with 312 rules applied. Total rules applied 314 place count 305 transition count 880
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 314 place count 305 transition count 878
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 318 place count 303 transition count 878
Discarding 224 places :
Symmetric choice reduction at 1 with 224 rule applications. Total rules 542 place count 79 transition count 352
Iterating global reduction 1 with 224 rules applied. Total rules applied 766 place count 79 transition count 352
Ensure Unique test removed 151 transitions
Reduce isomorphic transitions removed 151 transitions.
Iterating post reduction 1 with 151 rules applied. Total rules applied 917 place count 79 transition count 201
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 919 place count 78 transition count 200
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 921 place count 77 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 922 place count 77 transition count 198
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 933 place count 77 transition count 187
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 937 place count 75 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 938 place count 75 transition count 184
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 939 place count 75 transition count 183
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 940 place count 75 transition count 182
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 942 place count 74 transition count 181
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 945 place count 74 transition count 181
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 947 place count 74 transition count 179
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 949 place count 72 transition count 177
Applied a total of 949 rules in 324 ms. Remains 72 /6993 variables (removed 6921) and now considering 177/32110 (removed 31933) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 177 rows 72 cols
[2023-03-13 00:09:58] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-13 00:09:58] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 00:09:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-13 00:09:58] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 00:09:58] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-13 00:09:58] [INFO ] After 162ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-13 00:09:58] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-13 00:09:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 6993 places, 32110 transitions and 128235 arcs took 130 ms.
[2023-03-13 00:10:00] [INFO ] Flatten gal took : 1119 ms
Total runtime 305757 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/542/inv_0_ --invariant=/tmp/542/inv_1_ --invariant=/tmp/542/inv_2_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 162396 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16260052 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
mcc2023

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is CANInsertWithFailure-PT-080, 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 r041-tajo-167813695100766"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-080.tgz
mv CANInsertWithFailure-PT-080 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 ;