Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 15K Feb 26 03:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 03:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 03:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 03:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 03:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 03:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 03:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 03:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 10M 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 MultiCrashLeafsetExtension-PT-S24C04-ReachabilityCardinality-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityCardinality-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityCardinality-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityCardinality-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityCardinality-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityCardinality-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityCardinality-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityCardinality-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityCardinality-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityCardinality-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityCardinality-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityCardinality-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityCardinality-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityCardinality-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityCardinality-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678704552814

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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S24C04
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 10:49:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 10:49:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 10:49:14] [INFO ] Load time of PNML (sax parser for PT used): 372 ms
[2023-03-13 10:49:14] [INFO ] Transformed 9748 places.
[2023-03-13 10:49:14] [INFO ] Transformed 14659 transitions.
[2023-03-13 10:49:14] [INFO ] Parsed PT model containing 9748 places and 14659 transitions and 58838 arcs in 567 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 240 resets, run finished after 645 ms. (steps per millisecond=15 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 13938 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :{2=1}
Probabilistic random walk after 13938 steps, saw 6707 distinct states, run finished after 3002 ms. (steps per millisecond=4 ) properties seen :1
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 14 properties.
[2023-03-13 10:49:19] [INFO ] Flow matrix only has 14059 transitions (discarded 600 similar events)
// Phase 1: matrix 14059 rows 9748 cols
[2023-03-13 10:49:19] [INFO ] Computed 921 place invariants in 844 ms
[2023-03-13 10:49:22] [INFO ] After 2875ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-13 10:49:25] [INFO ] [Nat]Absence check using 62 positive place invariants in 53 ms returned sat
[2023-03-13 10:49:26] [INFO ] [Nat]Absence check using 62 positive and 859 generalized place invariants in 512 ms returned sat
[2023-03-13 10:49:47] [INFO ] After 21237ms SMT Verify possible using state equation in natural domain returned unsat :10 sat :3
[2023-03-13 10:49:48] [INFO ] State equation strengthened by 4402 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 10:49:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 10:49:48] [INFO ] After 25130ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 9 out of 9748 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9748/9748 places, 14659/14659 transitions.
Graph (complete) has 33897 edges and 9748 vertex of which 9712 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.55 ms
Discarding 36 places :
Also discarding 0 output transitions
Drop transitions removed 2394 transitions
Trivial Post-agglo rules discarded 2394 transitions
Performed 2394 trivial Post agglomeration. Transition count delta: 2394
Iterating post reduction 0 with 2394 rules applied. Total rules applied 2395 place count 9712 transition count 12265
Reduce places removed 2394 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 2398 rules applied. Total rules applied 4793 place count 7318 transition count 12261
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 4797 place count 7314 transition count 12261
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 4797 place count 7314 transition count 12061
Deduced a syphon composed of 200 places in 11 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 5197 place count 7114 transition count 12061
Discarding 2194 places :
Symmetric choice reduction at 3 with 2194 rule applications. Total rules 7391 place count 4920 transition count 9867
Iterating global reduction 3 with 2194 rules applied. Total rules applied 9585 place count 4920 transition count 9867
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 9585 place count 4920 transition count 9864
Deduced a syphon composed of 3 places in 6 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 9591 place count 4917 transition count 9864
Discarding 543 places :
Symmetric choice reduction at 3 with 543 rule applications. Total rules 10134 place count 4374 transition count 7692
Iterating global reduction 3 with 543 rules applied. Total rules applied 10677 place count 4374 transition count 7692
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 3 with 50 rules applied. Total rules applied 10727 place count 4349 transition count 7667
Free-agglomeration rule (complex) applied 342 times.
Iterating global reduction 3 with 342 rules applied. Total rules applied 11069 place count 4349 transition count 8954
Reduce places removed 342 places and 0 transitions.
Iterating post reduction 3 with 342 rules applied. Total rules applied 11411 place count 4007 transition count 8954
Partial Free-agglomeration rule applied 125 times.
Drop transitions removed 125 transitions
Iterating global reduction 4 with 125 rules applied. Total rules applied 11536 place count 4007 transition count 8954
Applied a total of 11536 rules in 5164 ms. Remains 4007 /9748 variables (removed 5741) and now considering 8954/14659 (removed 5705) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5167 ms. Remains : 4007/9748 places, 8954/14659 transitions.
Incomplete random walk after 10000 steps, including 396 resets, run finished after 410 ms. (steps per millisecond=24 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 47 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 25158 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 25158 steps, saw 11398 distinct states, run finished after 3003 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-13 10:49:56] [INFO ] Flow matrix only has 8068 transitions (discarded 886 similar events)
// Phase 1: matrix 8068 rows 4007 cols
[2023-03-13 10:49:57] [INFO ] Computed 885 place invariants in 200 ms
[2023-03-13 10:49:57] [INFO ] After 614ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 10:49:58] [INFO ] [Nat]Absence check using 49 positive place invariants in 58 ms returned sat
[2023-03-13 10:49:58] [INFO ] [Nat]Absence check using 49 positive and 836 generalized place invariants in 236 ms returned sat
[2023-03-13 10:50:03] [INFO ] After 4846ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 10:50:03] [INFO ] State equation strengthened by 4402 read => feed constraints.
[2023-03-13 10:50:08] [INFO ] After 4370ms SMT Verify possible using 4402 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-13 10:50:13] [INFO ] Deduced a trap composed of 303 places in 4078 ms of which 17 ms to minimize.
[2023-03-13 10:50:18] [INFO ] Deduced a trap composed of 348 places in 3926 ms of which 8 ms to minimize.
[2023-03-13 10:50:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 9079 ms
[2023-03-13 10:50:20] [INFO ] After 16761ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 2250 ms.
[2023-03-13 10:50:22] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 20 ms.
Support contains 7 out of 4007 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4007/4007 places, 8954/8954 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 4007 transition count 8953
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 4006 transition count 8953
Applied a total of 2 rules in 990 ms. Remains 4006 /4007 variables (removed 1) and now considering 8953/8954 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 991 ms. Remains : 4006/4007 places, 8953/8954 transitions.
Incomplete random walk after 10000 steps, including 397 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 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 47 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 47 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 25956 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 25956 steps, saw 11751 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-13 10:50:27] [INFO ] Flow matrix only has 8067 transitions (discarded 886 similar events)
// Phase 1: matrix 8067 rows 4006 cols
[2023-03-13 10:50:27] [INFO ] Computed 885 place invariants in 229 ms
[2023-03-13 10:50:28] [INFO ] After 484ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 10:50:28] [INFO ] [Nat]Absence check using 49 positive place invariants in 58 ms returned sat
[2023-03-13 10:50:28] [INFO ] [Nat]Absence check using 49 positive and 836 generalized place invariants in 220 ms returned sat
[2023-03-13 10:50:33] [INFO ] After 4179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 10:50:33] [INFO ] State equation strengthened by 4402 read => feed constraints.
[2023-03-13 10:50:42] [INFO ] After 9258ms SMT Verify possible using 4402 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 10:50:48] [INFO ] Deduced a trap composed of 198 places in 3956 ms of which 4 ms to minimize.
[2023-03-13 10:50:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 4776 ms
[2023-03-13 10:50:56] [INFO ] Deduced a trap composed of 319 places in 3876 ms of which 4 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 10:50:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 10:50:56] [INFO ] After 28708ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 8 ms.
Support contains 7 out of 4006 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4006/4006 places, 8953/8953 transitions.
Applied a total of 0 rules in 480 ms. Remains 4006 /4006 variables (removed 0) and now considering 8953/8953 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 480 ms. Remains : 4006/4006 places, 8953/8953 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4006/4006 places, 8953/8953 transitions.
Applied a total of 0 rules in 495 ms. Remains 4006 /4006 variables (removed 0) and now considering 8953/8953 (removed 0) transitions.
[2023-03-13 10:50:57] [INFO ] Flow matrix only has 8067 transitions (discarded 886 similar events)
[2023-03-13 10:50:57] [INFO ] Invariant cache hit.
[2023-03-13 10:51:04] [INFO ] Implicit Places using invariants in 6849 ms returned [4, 7, 10, 11, 12, 13, 17, 23, 32, 42, 54, 68, 84, 102, 122, 144, 167, 189, 190, 191, 192, 193, 213, 231, 247, 261, 273, 283, 291, 297, 301, 303, 314, 320, 322, 323, 324, 325, 326, 328, 332, 338, 346, 356, 368, 382, 398, 416, 436, 457, 477, 478, 479, 480, 481, 499, 515, 529, 541, 551, 559, 565, 569, 571, 573, 584, 590, 592, 593, 594, 595, 596, 598, 600, 604, 610, 618, 628, 640, 654, 670, 688, 707, 725, 726, 727, 728, 729, 745, 759, 771, 781, 789, 795, 799, 801, 803, 805, 816, 822, 824, 825, 826, 827, 828, 830, 832, 834, 838, 844, 852, 862, 874, 888, 904, 921, 937, 938, 939, 940, 941, 955, 967, 977, 985, 991, 995, 997, 999, 1001, 1003, 1014, 1020, 1022, 1023, 1024, 1025, 1026, 1028, 1030, 1032, 1034, 1038, 1044, 1052, 1062, 1074, 1088, 1103, 1117, 1118, 1119, 1120, 1121, 1133, 1143, 1151, 1157, 1161, 1163, 1165, 1167, 1169, 1171, 1182, 1188, 1190, 1191, 1192, 1193, 1194, 1196, 1198, 1200, 1202, 1204, 1208, 1214, 1222, 1232, 1244, 1257, 1269, 1270, 1271, 1272, 1273, 1283, 1291, 1297, 1301, 1303, 1305, 1307, 1309, 1311, 1313, 1324, 1330, 1332, 1333, 1334, 1335, 1336, 1338, 1340, 1342, 1344, 1346, 1348, 1352, 1358, 1366, 1376, 1387, 1397, 1398, 1399, 1400, 1401, 1409, 1415, 1419, 1421, 1423, 1425, 1427, 1429, 1431, 1433, 1444, 1450, 1452, 1453, 1454, 1455, 1456, 1458, 1460, 1462, 1464, 1466, 1468, 1470, 1474, 1480, 1488, 1497, 1505, 1506, 1507, 1508, 1509, 1515, 1519, 1521, 1523, 1525, 1527, 1529, 1531, 1533, 1535, 1546, 1552, 1554, 1555, 1556, 1557, 1558, 1560, 1562, 1564, 1566, 1568, 1570, 1572, 1574, 1578, 1584, 1591, 1597, 1598, 1599, 1600, 1601, 1605, 1607, 1609, 1611, 1613, 1615, 1617, 1619, 1621, 1623, 1634, 1640, 1642, 1643, 1644, 1645, 1646, 1648, 1650, 1652, 1654, 1656, 1658, 1660, 1662, 1664, 1668, 1673, 1677, 1678, 1679, 1680, 1681, 1683, 1685, 1687, 1689, 1691, 1693, 1695, 1697, 1699, 1701, 1712, 1718, 1720, 1722, 1723, 1724, 1726, 1728, 1730, 1732, 1735, 1737, 1739, 1741, 1743, 1745, 1748, 1750, 1751, 1752, 1753, 1754, 1756, 1758, 1760, 1762, 1764, 1766, 1768, 1770, 1772, 1774, 1785, 1791, 1793, 1794, 1795, 1796, 1797, 1799, 1801, 1803, 1805, 1807, 1809, 1811, 1813, 1815, 1817, 1819, 1821, 1822, 1823, 1824, 1825, 1827, 1829, 1831, 1833, 1835, 1837, 1839, 1841, 1843, 1845, 1856, 1858, 1861, 1863, 1864, 1865, 1866, 1867, 1869, 1871, 1873, 1875, 1877, 1879, 1881, 1883, 1885, 1887, 1889, 1891, 1892, 1893, 1894, 1895, 1897, 1899, 1901, 1903, 1905, 1907, 1909, 1911, 1913, 1915, 1926, 1932, 1934, 1935, 1936, 1937, 1938, 1940, 1942, 1944, 1946, 1948, 1950, 1952, 1954, 1956, 1958, 1960, 1962, 1963, 1964, 1965, 1966, 1968, 1970, 1972, 1974, 1976, 1978, 1980, 1982, 1984, 1986, 1997, 2003, 2005, 2006, 2007, 2009, 2011, 2013, 2015, 2018, 2020, 2022, 2024, 2026, 2028, 2030, 2032, 2035, 2036, 2037, 2038, 2039, 2041, 2043, 2045, 2047, 2049, 2051, 2053, 2055, 2057, 2059, 2070, 2076, 2078, 2079, 2081, 2082, 2084, 2086, 2088, 2090, 2092, 2094, 2096, 2100, 2102, 2104, 2108, 2113, 2114, 2115, 2116, 2117, 2121, 2123, 2125, 2127, 2129, 2131, 2133, 2135, 2137, 2139, 2150, 2156, 2158, 2159, 2160, 2161, 2162, 2164, 2166, 2168, 2170, 2172, 2174, 2176, 2178, 2180, 2184, 2190, 2197, 2198, 2199, 2200, 2201, 2207, 2211, 2213, 2215, 2217, 2219, 2221, 2223, 2225, 2227, 2238, 2244, 2246, 2247, 2248, 2249, 2250, 2252, 2254, 2256, 2258, 2260, 2262, 2264, 2266, 2270, 2276, 2284, 2293, 2294, 2295, 2296, 2297, 2305, 2311, 2315, 2317, 2319, 2321, 2323, 2325, 2327, 2329, 2346, 2348, 2349, 2350, 2351, 2352, 2354, 2356, 2358, 2360, 2362, 2364, 2366, 2370, 2376, 2384, 2394, 2405, 2406, 2407, 2409, 2419, 2427, 2433, 2439, 2441, 2443, 2445, 2447, 2450, 2461, 2467, 2469, 2470, 2471, 2472, 2473, 2475, 2477, 2479, 2481, 2483, 2485, 2489, 2495, 2503, 2513, 2525, 2538, 2539, 2540, 2541, 2542, 2554, 2564, 2572, 2578, 2582, 2584, 2586, 2588, 2590, 2592, 2603, 2609, 2611, 2612, 2613, 2614, 2615, 2617, 2619, 2621, 2623, 2625, 2629, 2635, 2643, 2653, 2665, 2679, 2694, 2695, 2696, 2697, 2698, 2712, 2724, 2734, 2742, 2748, 2752, 2754, 2756, 2758, 2760, 2771, 2777, 2779, 2780, 2781, 2782, 2783, 2785, 2787, 2789, 2791, 2795, 2801, 2809, 2819, 2831, 2845, 2861, 2878, 2879, 2880, 2882, 2898, 2912, 2926, 2936, 2944, 2950, 2954, 2956, 2958, 2960, 2971, 2977, 2979, 2980, 2981, 2982, 2983, 2985, 2987, 2989, 2993, 2999, 3007, 3017, 3029, 3043, 3059, 3077, 3096, 3097, 3098, 3099, 3100, 3118, 3134, 3148, 3160, 3170, 3178, 3184, 3188, 3190, 3192, 3203, 3209, 3211, 3212, 3213, 3214, 3215, 3217, 3219, 3223, 3229, 3237, 3247, 3259, 3273, 3289, 3307, 3327, 3348, 3349, 3350, 3351, 3352, 3372, 3390, 3406, 3420, 3432, 3442, 3450, 3456, 3460, 3462, 3473, 3475, 3478, 3480, 3481, 3482, 3483, 3484, 3486, 3490, 3496, 3504, 3514, 3526, 3540, 3556, 3574, 3594, 3616, 3639, 3640, 3641, 3642, 3643, 3665, 3685, 3703, 3719, 3733, 3745, 3755, 3763, 3769, 3773, 3784]
Discarding 820 places :
Implicit Place search using SMT only with invariants took 6876 ms to find 820 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 3186/4006 places, 8953/8953 transitions.
Discarding 186 places :
Symmetric choice reduction at 0 with 186 rule applications. Total rules 186 place count 3000 transition count 8767
Iterating global reduction 0 with 186 rules applied. Total rules applied 372 place count 3000 transition count 8767
Discarding 186 places :
Symmetric choice reduction at 0 with 186 rule applications. Total rules 558 place count 2814 transition count 8581
Iterating global reduction 0 with 186 rules applied. Total rules applied 744 place count 2814 transition count 8581
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 747 place count 2814 transition count 8578
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 750 place count 2811 transition count 8578
Applied a total of 750 rules in 1367 ms. Remains 2811 /3186 variables (removed 375) and now considering 8578/8953 (removed 375) transitions.
[2023-03-13 10:51:05] [INFO ] Flow matrix only has 7692 transitions (discarded 886 similar events)
// Phase 1: matrix 7692 rows 2811 cols
[2023-03-13 10:51:06] [INFO ] Computed 65 place invariants in 187 ms
[2023-03-13 10:51:10] [INFO ] Implicit Places using invariants in 4285 ms returned [1615, 1688]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 4294 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2809/4006 places, 8578/8953 transitions.
Applied a total of 0 rules in 442 ms. Remains 2809 /2809 variables (removed 0) and now considering 8578/8578 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 13475 ms. Remains : 2809/4006 places, 8578/8953 transitions.
Incomplete random walk after 10000 steps, including 426 resets, run finished after 416 ms. (steps per millisecond=24 ) properties (out of 3) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-13 10:51:11] [INFO ] Flow matrix only has 7692 transitions (discarded 886 similar events)
// Phase 1: matrix 7692 rows 2809 cols
[2023-03-13 10:51:11] [INFO ] Computed 63 place invariants in 136 ms
[2023-03-13 10:51:11] [INFO ] After 305ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 10:51:11] [INFO ] [Nat]Absence check using 47 positive place invariants in 37 ms returned sat
[2023-03-13 10:51:11] [INFO ] [Nat]Absence check using 47 positive and 16 generalized place invariants in 10 ms returned sat
[2023-03-13 10:51:14] [INFO ] After 2893ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 10:51:14] [INFO ] State equation strengthened by 4402 read => feed constraints.
[2023-03-13 10:51:19] [INFO ] After 4043ms SMT Verify possible using 4402 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 10:51:25] [INFO ] After 10494ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3327 ms.
[2023-03-13 10:51:28] [INFO ] After 17177ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 5 out of 2809 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2809/2809 places, 8578/8578 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 2809 transition count 8577
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2808 transition count 8577
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 2808 transition count 8576
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 2807 transition count 8576
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 5 place count 2806 transition count 8575
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 2806 transition count 8575
Applied a total of 6 rules in 1124 ms. Remains 2806 /2809 variables (removed 3) and now considering 8575/8578 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1125 ms. Remains : 2806/2809 places, 8575/8578 transitions.
Incomplete random walk after 10000 steps, including 426 resets, run finished after 342 ms. (steps per millisecond=29 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 29924 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :{1=1}
Probabilistic random walk after 29924 steps, saw 12608 distinct states, run finished after 3001 ms. (steps per millisecond=9 ) properties seen :1
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
[2023-03-13 10:51:33] [INFO ] Flow matrix only has 7689 transitions (discarded 886 similar events)
// Phase 1: matrix 7689 rows 2806 cols
[2023-03-13 10:51:33] [INFO ] Computed 63 place invariants in 137 ms
[2023-03-13 10:51:33] [INFO ] After 262ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 10:51:34] [INFO ] [Nat]Absence check using 47 positive place invariants in 41 ms returned sat
[2023-03-13 10:51:34] [INFO ] [Nat]Absence check using 47 positive and 16 generalized place invariants in 3 ms returned sat
[2023-03-13 10:51:36] [INFO ] After 2103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 10:51:36] [INFO ] State equation strengthened by 4402 read => feed constraints.
[2023-03-13 10:51:37] [INFO ] After 1465ms SMT Verify possible using 4402 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 10:51:38] [INFO ] After 1757ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 183 ms.
[2023-03-13 10:51:38] [INFO ] After 4426ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 2806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2806/2806 places, 8575/8575 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2806 transition count 8573
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 2804 transition count 8573
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 2802 transition count 8571
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 2802 transition count 8571
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 2802 transition count 8571
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 2801 transition count 8570
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 2801 transition count 8570
Applied a total of 11 rules in 1746 ms. Remains 2801 /2806 variables (removed 5) and now considering 8570/8575 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1746 ms. Remains : 2801/2806 places, 8570/8575 transitions.
Incomplete random walk after 10000 steps, including 426 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 30574 steps, run timeout after 3001 ms. (steps per millisecond=10 ) properties seen :{}
Probabilistic random walk after 30574 steps, saw 12870 distinct states, run finished after 3001 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 10:51:43] [INFO ] Flow matrix only has 7684 transitions (discarded 886 similar events)
// Phase 1: matrix 7684 rows 2801 cols
[2023-03-13 10:51:43] [INFO ] Computed 63 place invariants in 128 ms
[2023-03-13 10:51:43] [INFO ] After 266ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 10:51:43] [INFO ] [Nat]Absence check using 47 positive place invariants in 39 ms returned sat
[2023-03-13 10:51:43] [INFO ] [Nat]Absence check using 47 positive and 16 generalized place invariants in 9 ms returned sat
[2023-03-13 10:51:46] [INFO ] After 2783ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 10:51:46] [INFO ] State equation strengthened by 4402 read => feed constraints.
[2023-03-13 10:51:48] [INFO ] After 1269ms SMT Verify possible using 4402 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 10:51:48] [INFO ] After 1578ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 198 ms.
[2023-03-13 10:51:48] [INFO ] After 4961ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 2801 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2801/2801 places, 8570/8570 transitions.
Applied a total of 0 rules in 440 ms. Remains 2801 /2801 variables (removed 0) and now considering 8570/8570 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 441 ms. Remains : 2801/2801 places, 8570/8570 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2801/2801 places, 8570/8570 transitions.
Applied a total of 0 rules in 444 ms. Remains 2801 /2801 variables (removed 0) and now considering 8570/8570 (removed 0) transitions.
[2023-03-13 10:51:49] [INFO ] Flow matrix only has 7684 transitions (discarded 886 similar events)
[2023-03-13 10:51:49] [INFO ] Invariant cache hit.
[2023-03-13 10:51:53] [INFO ] Implicit Places using invariants in 3930 ms returned [7, 1316, 1470, 1658]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 3938 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2797/2801 places, 8570/8570 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2793 transition count 8566
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2793 transition count 8566
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 2789 transition count 8562
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 2789 transition count 8562
Applied a total of 16 rules in 903 ms. Remains 2789 /2797 variables (removed 8) and now considering 8562/8570 (removed 8) transitions.
[2023-03-13 10:51:54] [INFO ] Flow matrix only has 7676 transitions (discarded 886 similar events)
// Phase 1: matrix 7676 rows 2789 cols
[2023-03-13 10:51:54] [INFO ] Computed 59 place invariants in 137 ms
[2023-03-13 10:51:58] [INFO ] Implicit Places using invariants in 3971 ms returned []
[2023-03-13 10:51:58] [INFO ] Flow matrix only has 7676 transitions (discarded 886 similar events)
[2023-03-13 10:51:58] [INFO ] Invariant cache hit.
[2023-03-13 10:51:59] [INFO ] State equation strengthened by 4402 read => feed constraints.
[2023-03-13 10:52:29] [INFO ] Performed 2516/2789 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-13 10:52:32] [INFO ] Implicit Places using invariants and state equation in 34382 ms returned []
Implicit Place search using SMT with State Equation took 38356 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2789/2801 places, 8562/8570 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 43642 ms. Remains : 2789/2801 places, 8562/8570 transitions.
Incomplete random walk after 10000 steps, including 426 resets, run finished after 286 ms. (steps per millisecond=34 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 31355 steps, run timeout after 3001 ms. (steps per millisecond=10 ) properties seen :{}
Probabilistic random walk after 31355 steps, saw 13155 distinct states, run finished after 3001 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 10:52:36] [INFO ] Flow matrix only has 7676 transitions (discarded 886 similar events)
[2023-03-13 10:52:36] [INFO ] Invariant cache hit.
[2023-03-13 10:52:36] [INFO ] After 260ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 10:52:36] [INFO ] [Nat]Absence check using 47 positive place invariants in 38 ms returned sat
[2023-03-13 10:52:36] [INFO ] [Nat]Absence check using 47 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-13 10:52:40] [INFO ] After 3426ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 10:52:40] [INFO ] State equation strengthened by 4402 read => feed constraints.
[2023-03-13 10:52:40] [INFO ] After 744ms SMT Verify possible using 4402 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 10:52:41] [INFO ] After 1038ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 182 ms.
[2023-03-13 10:52:41] [INFO ] After 5024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 2789 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2789/2789 places, 8562/8562 transitions.
Applied a total of 0 rules in 441 ms. Remains 2789 /2789 variables (removed 0) and now considering 8562/8562 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 441 ms. Remains : 2789/2789 places, 8562/8562 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2789/2789 places, 8562/8562 transitions.
Applied a total of 0 rules in 431 ms. Remains 2789 /2789 variables (removed 0) and now considering 8562/8562 (removed 0) transitions.
[2023-03-13 10:52:42] [INFO ] Flow matrix only has 7676 transitions (discarded 886 similar events)
[2023-03-13 10:52:42] [INFO ] Invariant cache hit.
[2023-03-13 10:52:46] [INFO ] Implicit Places using invariants in 3865 ms returned []
[2023-03-13 10:52:46] [INFO ] Flow matrix only has 7676 transitions (discarded 886 similar events)
[2023-03-13 10:52:46] [INFO ] Invariant cache hit.
[2023-03-13 10:52:47] [INFO ] State equation strengthened by 4402 read => feed constraints.
[2023-03-13 10:53:17] [INFO ] Performed 2528/2789 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-13 10:53:20] [INFO ] Implicit Places using invariants and state equation in 34308 ms returned []
Implicit Place search using SMT with State Equation took 38176 ms to find 0 implicit places.
[2023-03-13 10:53:21] [INFO ] Redundant transitions in 1001 ms returned []
[2023-03-13 10:53:21] [INFO ] Flow matrix only has 7676 transitions (discarded 886 similar events)
[2023-03-13 10:53:21] [INFO ] Invariant cache hit.
[2023-03-13 10:53:25] [INFO ] Dead Transitions using invariants and state equation in 4326 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43953 ms. Remains : 2789/2789 places, 8562/8562 transitions.
Graph (trivial) has 3039 edges and 2789 vertex of which 25 / 2789 are part of one of the 1 SCC in 5 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 10344 edges and 2765 vertex of which 2743 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.3 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 24 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition Node10DetectsThatNode13CanReplaceNode12.Node13IsBecomingTheNewNodeMaster and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 2718 transition count 6833
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 1 with 722 rules applied. Total rules applied 967 place count 2477 transition count 6352
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 680 rules applied. Total rules applied 1647 place count 2237 transition count 5912
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 598 rules applied. Total rules applied 2245 place count 2037 transition count 5514
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 558 rules applied. Total rules applied 2803 place count 1839 transition count 5154
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 484 rules applied. Total rules applied 3287 place count 1677 transition count 4832
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 448 rules applied. Total rules applied 3735 place count 1517 transition count 4544
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 382 rules applied. Total rules applied 4117 place count 1389 transition count 4290
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 350 rules applied. Total rules applied 4467 place count 1263 transition count 4066
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 292 rules applied. Total rules applied 4759 place count 1165 transition count 3872
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 264 rules applied. Total rules applied 5023 place count 1069 transition count 3704
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 214 rules applied. Total rules applied 5237 place count 997 transition count 3562
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 190 rules applied. Total rules applied 5427 place count 927 transition count 3442
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 148 rules applied. Total rules applied 5575 place count 877 transition count 3344
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 128 rules applied. Total rules applied 5703 place count 829 transition count 3264
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 94 rules applied. Total rules applied 5797 place count 797 transition count 3202
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 78 rules applied. Total rules applied 5875 place count 767 transition count 3154
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 52 rules applied. Total rules applied 5927 place count 749 transition count 3120
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 40 rules applied. Total rules applied 5967 place count 733 transition count 3096
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 22 rules applied. Total rules applied 5989 place count 725 transition count 3082
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 14 rules applied. Total rules applied 6003 place count 719 transition count 3074
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 5 rules applied. Total rules applied 6008 place count 716 transition count 3072
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 22 with 10 Pre rules applied. Total rules applied 6008 place count 716 transition count 3062
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 22 with 20 rules applied. Total rules applied 6028 place count 706 transition count 3062
Discarding 618 places :
Symmetric choice reduction at 22 with 618 rule applications. Total rules 6646 place count 88 transition count 662
Iterating global reduction 22 with 618 rules applied. Total rules applied 7264 place count 88 transition count 662
Ensure Unique test removed 550 transitions
Reduce isomorphic transitions removed 550 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 22 with 551 rules applied. Total rules applied 7815 place count 88 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 7816 place count 87 transition count 111
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 24 with 1 Pre rules applied. Total rules applied 7816 place count 87 transition count 110
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 24 with 2 rules applied. Total rules applied 7818 place count 86 transition count 110
Discarding 17 places :
Symmetric choice reduction at 24 with 17 rule applications. Total rules 7835 place count 69 transition count 76
Iterating global reduction 24 with 17 rules applied. Total rules applied 7852 place count 69 transition count 76
Discarding 17 places :
Symmetric choice reduction at 24 with 17 rule applications. Total rules 7869 place count 52 transition count 59
Iterating global reduction 24 with 17 rules applied. Total rules applied 7886 place count 52 transition count 59
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 24 with 8 rules applied. Total rules applied 7894 place count 48 transition count 55
Discarding 2 places :
Symmetric choice reduction at 24 with 2 rule applications. Total rules 7896 place count 46 transition count 51
Iterating global reduction 24 with 2 rules applied. Total rules applied 7898 place count 46 transition count 51
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 24 with 8 rules applied. Total rules applied 7906 place count 46 transition count 43
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 24 with 8 rules applied. Total rules applied 7914 place count 38 transition count 43
Applied a total of 7914 rules in 2274 ms. Remains 38 /2789 variables (removed 2751) and now considering 43/8562 (removed 8519) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 43 rows 38 cols
[2023-03-13 10:53:28] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-13 10:53:28] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 10:53:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 10:53:28] [INFO ] [Nat]Absence check using 2 positive and 10 generalized place invariants in 2 ms returned sat
[2023-03-13 10:53:28] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 10:53:28] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-13 10:53:28] [INFO ] After 39ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-13 10:53:28] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-13 10:53:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2789 places, 8562 transitions and 41860 arcs took 42 ms.
[2023-03-13 10:53:28] [INFO ] Flatten gal took : 450 ms
Total runtime 254589 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running MultiCrashLeafsetExtension (PT), instance S24C04
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 2789 places, 8562 transitions, 41860 arcs.
Final Score: 3337079.564
Took : 181 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: MultiCrashLeafsetExtension-PT-S24C04-ReachabilityCardinality-00 (reachable & potential((! ( (tk(P1438)) <= (tk(P2043)) ))))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 15450180 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16084968 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
Caught signal 15, terminating.

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="MultiCrashLeafsetExtension-PT-S24C04"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is MultiCrashLeafsetExtension-PT-S24C04, 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 r235-tall-167856422300822"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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