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-167856422400839.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-S24C06, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r235-tall-167856422400839
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 11K Feb 26 03:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 03:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 03:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 03:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 26 03:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 26 03:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 03:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 03:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K 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 13M 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-S24C06-ReachabilityFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-ReachabilityFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-ReachabilityFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-ReachabilityFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-ReachabilityFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-ReachabilityFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-ReachabilityFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-ReachabilityFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-ReachabilityFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-ReachabilityFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-ReachabilityFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-ReachabilityFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-ReachabilityFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-ReachabilityFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-ReachabilityFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678708167077

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S24C06
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 11:49:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 11:49:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 11:49:29] [INFO ] Load time of PNML (sax parser for PT used): 475 ms
[2023-03-13 11:49:29] [INFO ] Transformed 12464 places.
[2023-03-13 11:49:29] [INFO ] Transformed 18463 transitions.
[2023-03-13 11:49:29] [INFO ] Parsed PT model containing 12464 places and 18463 transitions and 71462 arcs in 617 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 161 resets, run finished after 637 ms. (steps per millisecond=15 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 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 3 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 3 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 3 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 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 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 3 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 3 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 3 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 3 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 3 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 3 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 3 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 3 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 3 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 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 11916 steps, run timeout after 3001 ms. (steps per millisecond=3 ) properties seen :{1=1, 2=1, 14=1}
Probabilistic random walk after 11916 steps, saw 5840 distinct states, run finished after 3002 ms. (steps per millisecond=3 ) properties seen :3
FORMULA MultiCrashLeafsetExtension-PT-S24C06-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C06-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C06-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 13 properties.
[2023-03-13 11:49:33] [INFO ] Flow matrix only has 17863 transitions (discarded 600 similar events)
// Phase 1: matrix 17863 rows 12464 cols
[2023-03-13 11:49:34] [INFO ] Computed 1029 place invariants in 1263 ms
[2023-03-13 11:49:39] [INFO ] [Real]Absence check using 66 positive place invariants in 101 ms returned sat
[2023-03-13 11:49:39] [INFO ] [Real]Absence check using 66 positive and 963 generalized place invariants in 711 ms returned sat
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.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.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 11:50:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 11:50:00] [INFO ] After 25084ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
FORMULA MultiCrashLeafsetExtension-PT-S24C06-ReachabilityFireability-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 205 out of 12464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12464/12464 places, 18463/18463 transitions.
Graph (complete) has 41533 edges and 12464 vertex of which 12424 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.50 ms
Discarding 40 places :
Also discarding 0 output transitions
Drop transitions removed 3343 transitions
Trivial Post-agglo rules discarded 3343 transitions
Performed 3343 trivial Post agglomeration. Transition count delta: 3343
Iterating post reduction 0 with 3343 rules applied. Total rules applied 3344 place count 12424 transition count 15120
Reduce places removed 3343 places and 0 transitions.
Performed 240 Post agglomeration using F-continuation condition.Transition count delta: 240
Iterating post reduction 1 with 3583 rules applied. Total rules applied 6927 place count 9081 transition count 14880
Reduce places removed 240 places and 0 transitions.
Iterating post reduction 2 with 240 rules applied. Total rules applied 7167 place count 8841 transition count 14880
Performed 277 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 277 Pre rules applied. Total rules applied 7167 place count 8841 transition count 14603
Deduced a syphon composed of 277 places in 14 ms
Reduce places removed 277 places and 0 transitions.
Iterating global reduction 3 with 554 rules applied. Total rules applied 7721 place count 8564 transition count 14603
Discarding 3263 places :
Symmetric choice reduction at 3 with 3263 rule applications. Total rules 10984 place count 5301 transition count 11340
Iterating global reduction 3 with 3263 rules applied. Total rules applied 14247 place count 5301 transition count 11340
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 14247 place count 5301 transition count 11339
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14249 place count 5300 transition count 11339
Discarding 489 places :
Symmetric choice reduction at 3 with 489 rule applications. Total rules 14738 place count 4811 transition count 8405
Iterating global reduction 3 with 489 rules applied. Total rules applied 15227 place count 4811 transition count 8405
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 10 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 15259 place count 4795 transition count 8389
Free-agglomeration rule (complex) applied 185 times.
Iterating global reduction 3 with 185 rules applied. Total rules applied 15444 place count 4795 transition count 8204
Reduce places removed 185 places and 0 transitions.
Iterating post reduction 3 with 185 rules applied. Total rules applied 15629 place count 4610 transition count 8204
Partial Free-agglomeration rule applied 255 times.
Drop transitions removed 255 transitions
Iterating global reduction 4 with 255 rules applied. Total rules applied 15884 place count 4610 transition count 8204
Applied a total of 15884 rules in 5258 ms. Remains 4610 /12464 variables (removed 7854) and now considering 8204/18463 (removed 10259) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5261 ms. Remains : 4610/12464 places, 8204/18463 transitions.
Incomplete random walk after 10000 steps, including 224 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 12) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S24C06-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 23380 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{5=1}
Probabilistic random walk after 23380 steps, saw 10943 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :1
FORMULA MultiCrashLeafsetExtension-PT-S24C06-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 10 properties.
[2023-03-13 11:50:09] [INFO ] Flow matrix only has 7419 transitions (discarded 785 similar events)
// Phase 1: matrix 7419 rows 4610 cols
[2023-03-13 11:50:09] [INFO ] Computed 989 place invariants in 190 ms
[2023-03-13 11:50:11] [INFO ] [Real]Absence check using 49 positive place invariants in 87 ms returned sat
[2023-03-13 11:50:11] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 271 ms returned sat
[2023-03-13 11:50:11] [INFO ] After 2021ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-13 11:50:13] [INFO ] [Nat]Absence check using 49 positive place invariants in 83 ms returned sat
[2023-03-13 11:50:13] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 259 ms returned sat
[2023-03-13 11:50:21] [INFO ] After 7757ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :6
[2023-03-13 11:50:21] [INFO ] State equation strengthened by 3157 read => feed constraints.
[2023-03-13 11:50:35] [INFO ] After 13683ms SMT Verify possible using 3157 Read/Feed constraints in natural domain returned unsat :6 sat :4
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.refineResultsWithTraps(DeadlockTester.java:722)
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 11:50:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 11:50:37] [INFO ] After 25068ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
FORMULA MultiCrashLeafsetExtension-PT-S24C06-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C06-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C06-ReachabilityFireability-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C06-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C06-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C06-ReachabilityFireability-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 17 ms.
Support contains 47 out of 4610 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4610/4610 places, 8204/8204 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 4610 transition count 8190
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 4596 transition count 8190
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 28 place count 4596 transition count 8171
Deduced a syphon composed of 19 places in 4 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 66 place count 4577 transition count 8171
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 103 place count 4540 transition count 8029
Iterating global reduction 2 with 37 rules applied. Total rules applied 140 place count 4540 transition count 8029
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 140 place count 4540 transition count 8027
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 144 place count 4538 transition count 8027
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 160 place count 4522 transition count 7931
Iterating global reduction 2 with 16 rules applied. Total rules applied 176 place count 4522 transition count 7931
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 190 place count 4515 transition count 7924
Free-agglomeration rule (complex) applied 140 times.
Iterating global reduction 2 with 140 rules applied. Total rules applied 330 place count 4515 transition count 10359
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 2 with 140 rules applied. Total rules applied 470 place count 4375 transition count 10359
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 476 place count 4369 transition count 10353
Iterating global reduction 3 with 6 rules applied. Total rules applied 482 place count 4369 transition count 10353
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 496 place count 4369 transition count 10353
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 504 place count 4361 transition count 10345
Iterating global reduction 3 with 8 rules applied. Total rules applied 512 place count 4361 transition count 10345
Applied a total of 512 rules in 3530 ms. Remains 4361 /4610 variables (removed 249) and now considering 10345/8204 (removed -2141) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3531 ms. Remains : 4361/4610 places, 10345/8204 transitions.
Incomplete random walk after 10000 steps, including 266 resets, run finished after 421 ms. (steps per millisecond=23 ) properties (out of 4) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S24C06-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-13 11:50:41] [INFO ] Flow matrix only has 9491 transitions (discarded 854 similar events)
// Phase 1: matrix 9491 rows 4361 cols
[2023-03-13 11:50:41] [INFO ] Computed 989 place invariants in 241 ms
[2023-03-13 11:50:42] [INFO ] [Real]Absence check using 47 positive place invariants in 57 ms returned sat
[2023-03-13 11:50:42] [INFO ] [Real]Absence check using 47 positive and 942 generalized place invariants in 254 ms returned sat
[2023-03-13 11:50:42] [INFO ] After 1092ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 11:50:43] [INFO ] [Nat]Absence check using 47 positive place invariants in 92 ms returned sat
[2023-03-13 11:50:43] [INFO ] [Nat]Absence check using 47 positive and 942 generalized place invariants in 265 ms returned sat
[2023-03-13 11:50:49] [INFO ] After 6041ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 11:50:49] [INFO ] State equation strengthened by 5547 read => feed constraints.
[2023-03-13 11:51:02] [INFO ] After 12867ms SMT Verify possible using 5547 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 11:51:09] [INFO ] Deduced a trap composed of 581 places in 4877 ms of which 14 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 11:51:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 11:51:09] [INFO ] After 26717ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 34 ms.
Support contains 45 out of 4361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4361/4361 places, 10345/10345 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 4361 transition count 10344
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 4360 transition count 10344
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 4359 transition count 10343
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 4359 transition count 10343
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 4 place count 4359 transition count 10342
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 4358 transition count 10342
Applied a total of 6 rules in 976 ms. Remains 4358 /4361 variables (removed 3) and now considering 10342/10345 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 976 ms. Remains : 4358/4361 places, 10342/10345 transitions.
Incomplete random walk after 10000 steps, including 266 resets, run finished after 437 ms. (steps per millisecond=22 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 23517 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 23517 steps, saw 10781 distinct states, run finished after 3005 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-13 11:51:14] [INFO ] Flow matrix only has 9488 transitions (discarded 854 similar events)
// Phase 1: matrix 9488 rows 4358 cols
[2023-03-13 11:51:14] [INFO ] Computed 989 place invariants in 238 ms
[2023-03-13 11:51:15] [INFO ] [Real]Absence check using 49 positive place invariants in 60 ms returned sat
[2023-03-13 11:51:15] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 244 ms returned sat
[2023-03-13 11:51:15] [INFO ] After 1261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 11:51:16] [INFO ] [Nat]Absence check using 49 positive place invariants in 55 ms returned sat
[2023-03-13 11:51:16] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 243 ms returned sat
[2023-03-13 11:51:24] [INFO ] After 7865ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 11:51:24] [INFO ] State equation strengthened by 5547 read => feed constraints.
[2023-03-13 11:51:38] [INFO ] After 14067ms SMT Verify possible using 5547 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 11:51:45] [INFO ] Deduced a trap composed of 665 places in 4947 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 11:51:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 11:51:45] [INFO ] After 29997ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 15 ms.
Support contains 45 out of 4358 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4358/4358 places, 10342/10342 transitions.
Applied a total of 0 rules in 598 ms. Remains 4358 /4358 variables (removed 0) and now considering 10342/10342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 598 ms. Remains : 4358/4358 places, 10342/10342 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4358/4358 places, 10342/10342 transitions.
Applied a total of 0 rules in 584 ms. Remains 4358 /4358 variables (removed 0) and now considering 10342/10342 (removed 0) transitions.
[2023-03-13 11:51:46] [INFO ] Flow matrix only has 9488 transitions (discarded 854 similar events)
[2023-03-13 11:51:46] [INFO ] Invariant cache hit.
[2023-03-13 11:51:51] [INFO ] Implicit Places using invariants in 4921 ms returned []
Implicit Place search using SMT only with invariants took 4931 ms to find 0 implicit places.
[2023-03-13 11:51:51] [INFO ] Flow matrix only has 9488 transitions (discarded 854 similar events)
[2023-03-13 11:51:51] [INFO ] Invariant cache hit.
[2023-03-13 11:51:57] [INFO ] Dead Transitions using invariants and state equation in 5691 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11222 ms. Remains : 4358/4358 places, 10342/10342 transitions.
Graph (trivial) has 3281 edges and 4358 vertex of which 23 / 4358 are part of one of the 1 SCC in 9 ms
Free SCC test removed 22 places
Drop transitions removed 526 transitions
Ensure Unique test removed 901 transitions
Reduce isomorphic transitions removed 1427 transitions.
Graph (complete) has 31664 edges and 4336 vertex of which 4317 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.5 ms
Discarding 19 places :
Also discarding 0 output transitions
Ensure Unique test removed 381 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 217 transitions
Trivial Post-agglo rules discarded 217 transitions
Performed 217 trivial Post agglomeration. Transition count delta: 217
Iterating post reduction 0 with 219 rules applied. Total rules applied 221 place count 3935 transition count 8696
Ensure Unique test removed 1 places
Reduce places removed 218 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 201 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 1 with 619 rules applied. Total rules applied 840 place count 3717 transition count 8295
Ensure Unique test removed 1 places
Reduce places removed 201 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 163 transitions
Reduce isomorphic transitions removed 191 transitions.
Drop transitions removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 2 with 553 rules applied. Total rules applied 1393 place count 3516 transition count 7943
Ensure Unique test removed 28 places
Reduce places removed 189 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 150 transitions
Reduce isomorphic transitions removed 152 transitions.
Drop transitions removed 148 transitions
Trivial Post-agglo rules discarded 148 transitions
Performed 148 trivial Post agglomeration. Transition count delta: 148
Iterating post reduction 3 with 489 rules applied. Total rules applied 1882 place count 3327 transition count 7643
Ensure Unique test removed 2 places
Reduce places removed 150 places and 0 transitions.
Drop transitions removed 19 transitions
Ensure Unique test removed 121 transitions
Reduce isomorphic transitions removed 140 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 4 with 408 rules applied. Total rules applied 2290 place count 3177 transition count 7385
Ensure Unique test removed 19 places
Reduce places removed 137 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 109 transitions
Reduce isomorphic transitions removed 110 transitions.
Drop transitions removed 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 5 with 356 rules applied. Total rules applied 2646 place count 3040 transition count 7166
Ensure Unique test removed 1 places
Reduce places removed 110 places and 0 transitions.
Drop transitions removed 14 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 100 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 6 with 295 rules applied. Total rules applied 2941 place count 2930 transition count 6981
Ensure Unique test removed 14 places
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Drop transitions removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 7 with 251 rules applied. Total rules applied 3192 place count 2831 transition count 6829
Reduce places removed 76 places and 0 transitions.
Drop transitions removed 10 transitions
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 67 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 8 with 198 rules applied. Total rules applied 3390 place count 2755 transition count 6707
Ensure Unique test removed 10 places
Reduce places removed 65 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 9 with 159 rules applied. Total rules applied 3549 place count 2690 transition count 6613
Reduce places removed 47 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 38 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 10 with 115 rules applied. Total rules applied 3664 place count 2643 transition count 6545
Ensure Unique test removed 6 places
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 11 with 78 rules applied. Total rules applied 3742 place count 2607 transition count 6503
Reduce places removed 21 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 12 with 42 rules applied. Total rules applied 3784 place count 2586 transition count 6482
Ensure Unique test removed 2 places
Reduce places removed 11 places and 0 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 13 with 28 rules applied. Total rules applied 3812 place count 2575 transition count 6465
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 20 rules applied. Total rules applied 3832 place count 2558 transition count 6462
Performed 298 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 298 Pre rules applied. Total rules applied 3832 place count 2558 transition count 6164
Deduced a syphon composed of 298 places in 1 ms
Ensure Unique test removed 292 places
Reduce places removed 590 places and 0 transitions.
Iterating global reduction 15 with 888 rules applied. Total rules applied 4720 place count 1968 transition count 6164
Discarding 304 places :
Symmetric choice reduction at 15 with 304 rule applications. Total rules 5024 place count 1664 transition count 5860
Iterating global reduction 15 with 304 rules applied. Total rules applied 5328 place count 1664 transition count 5860
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 5328 place count 1664 transition count 5859
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 5330 place count 1663 transition count 5859
Discarding 308 places :
Symmetric choice reduction at 15 with 308 rule applications. Total rules 5638 place count 1355 transition count 4011
Iterating global reduction 15 with 308 rules applied. Total rules applied 5946 place count 1355 transition count 4011
Ensure Unique test removed 308 transitions
Reduce isomorphic transitions removed 308 transitions.
Iterating post reduction 15 with 308 rules applied. Total rules applied 6254 place count 1355 transition count 3703
Performed 729 Post agglomeration using F-continuation condition.Transition count delta: 729
Deduced a syphon composed of 729 places in 1 ms
Reduce places removed 729 places and 0 transitions.
Iterating global reduction 16 with 1458 rules applied. Total rules applied 7712 place count 626 transition count 2974
Drop transitions removed 537 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 587 transitions.
Iterating post reduction 16 with 587 rules applied. Total rules applied 8299 place count 626 transition count 2387
Drop transitions removed 294 transitions
Redundant transition composition rules discarded 294 transitions
Iterating global reduction 17 with 294 rules applied. Total rules applied 8593 place count 626 transition count 2093
Ensure Unique test removed 149 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 17 with 158 rules applied. Total rules applied 8751 place count 477 transition count 2084
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 18 with 10 rules applied. Total rules applied 8761 place count 468 transition count 2083
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 8762 place count 467 transition count 2083
Discarding 125 places :
Symmetric choice reduction at 20 with 125 rule applications. Total rules 8887 place count 342 transition count 1333
Iterating global reduction 20 with 125 rules applied. Total rules applied 9012 place count 342 transition count 1333
Ensure Unique test removed 125 transitions
Reduce isomorphic transitions removed 125 transitions.
Iterating post reduction 20 with 125 rules applied. Total rules applied 9137 place count 342 transition count 1208
Free-agglomeration rule applied 2 times.
Iterating global reduction 21 with 2 rules applied. Total rules applied 9139 place count 342 transition count 1206
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 3 rules applied. Total rules applied 9142 place count 340 transition count 1205
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 22 with 1 rules applied. Total rules applied 9143 place count 340 transition count 1204
Free-agglomeration rule applied 1 times.
Iterating global reduction 22 with 1 rules applied. Total rules applied 9144 place count 340 transition count 1203
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 9145 place count 339 transition count 1203
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 23 with 8 rules applied. Total rules applied 9153 place count 339 transition count 1195
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 23 with 8 rules applied. Total rules applied 9161 place count 331 transition count 1195
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 24 with 2 rules applied. Total rules applied 9163 place count 331 transition count 1193
Free-agglomeration rule applied 1 times.
Iterating global reduction 24 with 1 rules applied. Total rules applied 9164 place count 331 transition count 1192
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 24 with 1 rules applied. Total rules applied 9165 place count 330 transition count 1192
Partial Free-agglomeration rule applied 818 times.
Drop transitions removed 818 transitions
Iterating global reduction 25 with 818 rules applied. Total rules applied 9983 place count 330 transition count 1192
Discarding 22 places :
Symmetric choice reduction at 25 with 22 rule applications. Total rules 10005 place count 308 transition count 1060
Iterating global reduction 25 with 22 rules applied. Total rules applied 10027 place count 308 transition count 1060
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 25 with 22 rules applied. Total rules applied 10049 place count 308 transition count 1038
Partial Post-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 26 with 9 rules applied. Total rules applied 10058 place count 308 transition count 1038
Applied a total of 10058 rules in 8992 ms. Remains 308 /4358 variables (removed 4050) and now considering 1038/10342 (removed 9304) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1038 rows 308 cols
[2023-03-13 11:52:06] [INFO ] Computed 64 place invariants in 20 ms
[2023-03-13 11:52:06] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-13 11:52:06] [INFO ] [Real]Absence check using 7 positive and 57 generalized place invariants in 14 ms returned sat
[2023-03-13 11:52:06] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 11:52:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 21 ms returned sat
[2023-03-13 11:52:06] [INFO ] [Nat]Absence check using 7 positive and 57 generalized place invariants in 8 ms returned sat
[2023-03-13 11:52:07] [INFO ] After 441ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 11:52:07] [INFO ] After 682ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 279 ms.
[2023-03-13 11:52:07] [INFO ] After 1127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-13 11:52:07] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 2 ms.
[2023-03-13 11:52:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 4358 places, 10342 transitions and 61509 arcs took 53 ms.
[2023-03-13 11:52:09] [INFO ] Flatten gal took : 939 ms
Total runtime 160647 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running MultiCrashLeafsetExtension (PT), instance S24C06
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 4358 places, 10342 transitions, 61509 arcs.
Final Score: 1.3154250622E7
Took : 168 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1678708499282

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
ERROR in file model.sm near line 76282:
syntax error

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-S24C06"
export BK_EXAMINATION="ReachabilityFireability"
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-S24C06, examination is ReachabilityFireability"
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-167856422400839"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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