Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r165-tall-167838850300339.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 itstools
Input is FamilyReunion-COL-L00400M0040C020P020G001, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r165-tall-167838850300339
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 5.8K Feb 27 00:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Feb 27 00:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 22:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 22:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Feb 27 12:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 27 12:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 27 09:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 27 09:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 24 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 159K 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 FamilyReunion-COL-L00400M0040C020P020G001-LTLCardinality-00
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-LTLCardinality-01
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-LTLCardinality-02
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-LTLCardinality-03
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-LTLCardinality-04
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-LTLCardinality-05
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-LTLCardinality-06
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-LTLCardinality-07
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-LTLCardinality-08
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-LTLCardinality-09
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-LTLCardinality-10
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-LTLCardinality-11
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-LTLCardinality-12
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-LTLCardinality-13
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-LTLCardinality-14
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679468772957

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-COL-L00400M0040C020P020G001
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202303021504
[2023-03-22 07:06:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-22 07:06:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 07:06:14] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-22 07:06:14] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 07:06:15] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 715 ms
[2023-03-22 07:06:15] [INFO ] Detected 5 constant HL places corresponding to 106 PT places.
[2023-03-22 07:06:15] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 538109 PT places and 508890.0 transition bindings in 46 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2023-03-22 07:06:15] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 9 ms.
[2023-03-22 07:06:15] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 5 formulas.
FORMULA FamilyReunion-COL-L00400M0040C020P020G001-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00400M0040C020P020G001-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00400M0040C020P020G001-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00400M0040C020P020G001-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00400M0040C020P020G001-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 104 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 11 properties that can be checked using skeleton over-approximation.
Reduce places removed 5 places and 0 transitions.
FORMULA FamilyReunion-COL-L00400M0040C020P020G001-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 99 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 99 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10052 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=314 ) properties (out of 24) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 21) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 66 rows 99 cols
[2023-03-22 07:06:15] [INFO ] Computed 33 place invariants in 6 ms
[2023-03-22 07:06:15] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-22 07:06:15] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 8 ms returned sat
[2023-03-22 07:06:15] [INFO ] After 211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-22 07:06:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-22 07:06:16] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2023-03-22 07:06:16] [INFO ] After 120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-03-22 07:06:16] [INFO ] After 305ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 81 ms.
[2023-03-22 07:06:16] [INFO ] After 529ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Fused 19 Parikh solutions to 18 different solutions.
Finished Parikh walk after 360 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=360 )
Parikh walk visited 19 properties in 558 ms.
[2023-03-22 07:06:17] [INFO ] Flatten gal took : 28 ms
[2023-03-22 07:06:17] [INFO ] Flatten gal took : 10 ms
Transition Gate2ANDJoin forces synchronizations/join behavior on parameter l of sort LegalResident
Transition ReceiveLangChoice forces synchronizations/join behavior on parameter m of sort MICSystem
Symmetric sort wr.t. initial and guards and successors and join/free detected :CINFORMI
Symmetric sort wr.t. initial detected :CINFORMI
Symmetric sort wr.t. initial and guards detected :CINFORMI
Applying symmetric unfolding of full symmetric sort :CINFORMI domain size was 21
Transition Gate1ANDJoin forces synchronizations/join behavior on parameter p of sort PublicAdminOffice
Symmetric sort wr.t. initial and guards and successors and join/free detected :GovernmentCommission
Symmetric sort wr.t. initial detected :GovernmentCommission
Symmetric sort wr.t. initial and guards detected :GovernmentCommission
Applying symmetric unfolding of full symmetric sort :GovernmentCommission domain size was 11
Symmetric sort wr.t. initial and guards and successors and join/free detected :Response
Symmetric sort wr.t. initial detected :Response
Transition SendClearanceToRel : guard parameter $r(Response:2) in guard (EQ $r 0)introduces in Response(2) partition with 2 elements
[2023-03-22 07:06:18] [INFO ] Unfolded HLPN to a Petri net with 477829 places and 412249 transitions 1184997 arcs in 1247 ms.
[2023-03-22 07:06:18] [INFO ] Unfolded 10 HLPN properties in 25 ms.
Deduced a syphon composed of 401 places in 1296 ms
Reduce places removed 467 places and 0 transitions.
Support contains 83053 out of 477362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 477362/477362 places, 412249/412249 transitions.
Reduce places removed 886 places and 0 transitions.
Discarding 83408 places :
Implicit places reduction removed 83408 places
Iterating post reduction 0 with 84294 rules applied. Total rules applied 84294 place count 393068 transition count 412249
Applied a total of 84294 rules in 70670 ms. Remains 393068 /477362 variables (removed 84294) and now considering 412249/412249 (removed 0) transitions.
// Phase 1: matrix 412249 rows 393068 cols
[2023-03-22 07:09:35] [WARNING] Invariant computation timed out after 120 seconds.
[2023-03-22 07:10:03] [INFO ] Implicit Places using invariants in 147942 ms returned []
Implicit Place search using SMT only with invariants took 147946 ms to find 0 implicit places.
// Phase 1: matrix 412249 rows 393068 cols
[2023-03-22 07:12:03] [WARNING] Invariant computation timed out after 120 seconds.
[2023-03-22 07:12:31] [INFO ] Dead Transitions using invariants and state equation in 148664 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 393068/477362 places, 412249/412249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 367315 ms. Remains : 393068/477362 places, 412249/412249 transitions.
Support contains 83053 out of 393068 places after structural reductions.
[2023-03-22 07:12:46] [INFO ] Flatten gal took : 11224 ms
[2023-03-22 07:12:59] [INFO ] Flatten gal took : 11570 ms
[2023-03-22 07:13:25] [INFO ] Input system was already deterministic with 412249 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 11897 ms. (steps per millisecond=0 ) properties (out of 24) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=5 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=5 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 321 ms. (steps per millisecond=3 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 322 ms. (steps per millisecond=3 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 310 ms. (steps per millisecond=3 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 412249 rows 393068 cols
[2023-03-22 07:15:06] [INFO ] Computed 29280 place invariants in 450872 ms
[2023-03-22 07:15:44] [WARNING] Invariant computation timed out after 120 seconds.
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:609)
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.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
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-22 07:16:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 07:16:09] [INFO ] After 25040ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 19 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 48165 out of 393068 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393068/393068 places, 412249/412249 transitions.
Graph (complete) has 547365 edges and 393068 vertex of which 392666 are kept as prefixes of interest. Removing 402 places using SCC suffix rule.465 ms
Discarding 402 places :
Also discarding 401 output transitions
Drop transitions removed 401 transitions
Drop transitions removed 124711 transitions
Trivial Post-agglo rules discarded 124711 transitions
Performed 124711 trivial Post agglomeration. Transition count delta: 124711
Iterating post reduction 0 with 124711 rules applied. Total rules applied 124712 place count 392666 transition count 287137
Reduce places removed 124711 places and 0 transitions.
Performed 2857 Post agglomeration using F-continuation condition.
Performed 5308 Post agglomeration using F-continuation condition.
Performed 7889 Post agglomeration using F-continuation condition.
Performed 10462 Post agglomeration using F-continuation condition.
Performed 13104 Post agglomeration using F-continuation condition.
[2023-03-22 07:20:12] [INFO ] Computed 29280 place invariants in 608946 ms
Performed 16061 Post agglomeration using F-continuation condition.
Performed 19641 Post agglomeration using F-continuation condition.
Performed 23372 Post agglomeration using F-continuation condition.
Performed 27204 Post agglomeration using F-continuation condition.
Performed 30734 Post agglomeration using F-continuation condition.
Performed 34510 Post agglomeration using F-continuation condition.
Performed 38197 Post agglomeration using F-continuation condition.
Performed 41877 Post agglomeration using F-continuation condition.
Performed 45663 Post agglomeration using F-continuation condition.
[2023-03-22 07:24:18] [INFO ] Computed 29280 place invariants in 634146 ms
Performed 49323 Post agglomeration using F-continuation condition.Transition count delta: 49323
Iterating post reduction 1 with 174034 rules applied. Total rules applied 298746 place count 267955 transition count 237814
Reduce places removed 49323 places and 0 transitions.
Iterating post reduction 2 with 49323 rules applied. Total rules applied 348069 place count 218632 transition count 237814
Performed 26466 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26466 Pre rules applied. Total rules applied 348069 place count 218632 transition count 211348
Deduced a syphon composed of 26466 places in 315 ms
Ensure Unique test removed 16842 places
Reduce places removed 43308 places and 0 transitions.
Iterating global reduction 3 with 69774 rules applied. Total rules applied 417843 place count 175324 transition count 211348
Discarding 8822 places :
Implicit places reduction removed 8822 places
Iterating post reduction 3 with 8822 rules applied. Total rules applied 426665 place count 166502 transition count 211348
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 401 Pre rules applied. Total rules applied 426665 place count 166502 transition count 210947
Deduced a syphon composed of 401 places in 204 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 4 with 802 rules applied. Total rules applied 427467 place count 166101 transition count 210947
Performed 1203 Post agglomeration using F-continuation condition.Transition count delta: 1203
Deduced a syphon composed of 1203 places in 146 ms
Reduce places removed 1203 places and 0 transitions.
Iterating global reduction 4 with 2406 rules applied. Total rules applied 429873 place count 164898 transition count 209744
Free-agglomeration rule (complex) applied 802 times.
Iterating global reduction 4 with 802 rules applied. Total rules applied 430675 place count 164898 transition count 208942
Reduce places removed 802 places and 0 transitions.
Iterating post reduction 4 with 802 rules applied. Total rules applied 431477 place count 164096 transition count 208942
Applied a total of 431477 rules in 688120 ms. Remains 164096 /393068 variables (removed 228972) and now considering 208942/412249 (removed 203307) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 688128 ms. Remains : 164096/393068 places, 208942/412249 transitions.
Computed a total of 393068 stabilizing places and 412249 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 393068 transition count 412249
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U p1)||G((p2||X(G(p3)))))))'
Support contains 9244 out of 393068 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393068/393068 places, 412249/412249 transitions.
Reduce places removed 2 places and 0 transitions.
Discarding 16842 places :
Implicit places reduction removed 16842 places
Iterating post reduction 0 with 16844 rules applied. Total rules applied 16844 place count 376224 transition count 412249
Applied a total of 16844 rules in 11382 ms. Remains 376224 /393068 variables (removed 16844) and now considering 412249/412249 (removed 0) transitions.
// Phase 1: matrix 412249 rows 376224 cols
[2023-03-22 07:29:52] [WARNING] Invariant computation timed out after 120 seconds.
[2023-03-22 07:30:19] [INFO ] Implicit Places using invariants in 147742 ms returned []
Implicit Place search using SMT only with invariants took 147744 ms to find 0 implicit places.
// Phase 1: matrix 412249 rows 376224 cols
[2023-03-22 07:32:19] [WARNING] Invariant computation timed out after 120 seconds.
[2023-03-22 07:32:32] [INFO ] Computed 12436 place invariants in 280328 ms
[2023-03-22 07:32:47] [INFO ] Dead Transitions using invariants and state equation in 147593 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 376224/393068 places, 412249/412249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 306732 ms. Remains : 376224/393068 places, 412249/412249 transitions.
Stuttering acceptance computed with spot in 486 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00400M0040C020P020G001-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p3), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 5}, { cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (LEQ 1 (ADD s258288 s258289 s258290 s258291 s258292 s258293 s258294 s258295 s258296 s258297 s258298 s258299 s258300 s258301 s258302 s258303 s258304...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration timeout after 3070 steps with 1535 reset in 10003 ms.
Product exploration timeout after 3100 steps with 1550 reset in 10006 ms.
[2023-03-22 07:35:04] [INFO ] Computed 12436 place invariants in 284381 ms
Computed a total of 376224 stabilizing places and 412249 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 376224 transition count 412249
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Could not satisfy deadlock states : solver returned unknown
Knowledge obtained : [(AND p1 p2 (NOT p0) (NOT p3)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p3)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p2 (NOT p0) (NOT p3))
Knowledge based reduction with 21 factoid took 1491 ms. Reduced automaton from 7 states, 16 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00400M0040C020P020G001-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00400M0040C020P020G001-LTLCardinality-00 finished in 708524 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 402 out of 393068 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 393068/393068 places, 412249/412249 transitions.
Graph (complete) has 547365 edges and 393068 vertex of which 386226 are kept as prefixes of interest. Removing 6842 places using SCC suffix rule.716 ms
Discarding 6842 places :
Also discarding 6036 output transitions
Drop transitions removed 6036 transitions
Reduce places removed 401 places and 401 transitions.
Discarding 16842 places :
Implicit places reduction removed 16842 places
Drop transitions removed 259848 transitions
Trivial Post-agglo rules discarded 259848 transitions
Performed 259848 trivial Post agglomeration. Transition count delta: 259848
Iterating post reduction 0 with 276690 rules applied. Total rules applied 276691 place count 368983 transition count 145964
Reduce places removed 259848 places and 0 transitions.
Iterating post reduction 1 with 259848 rules applied. Total rules applied 536539 place count 109135 transition count 145964
Performed 19248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19248 Pre rules applied. Total rules applied 536539 place count 109135 transition count 126716
Deduced a syphon composed of 19248 places in 67 ms
Ensure Unique test removed 9223 places
Reduce places removed 28471 places and 0 transitions.
Iterating global reduction 2 with 47719 rules applied. Total rules applied 584258 place count 80664 transition count 126716
Discarding 401 places :
Implicit places reduction removed 401 places
Drop transitions removed 8421 transitions
Trivial Post-agglo rules discarded 8421 transitions
Performed 8421 trivial Post agglomeration. Transition count delta: 8421
Iterating post reduction 2 with 8822 rules applied. Total rules applied 593080 place count 80263 transition count 118295
Reduce places removed 8421 places and 0 transitions.
Iterating post reduction 3 with 8421 rules applied. Total rules applied 601501 place count 71842 transition count 118295
Performed 17243 Post agglomeration using F-continuation condition.Transition count delta: 17243
Deduced a syphon composed of 17243 places in 47 ms
Reduce places removed 17243 places and 0 transitions.
Iterating global reduction 4 with 34486 rules applied. Total rules applied 635987 place count 54599 transition count 101052
Applied a total of 635987 rules in 123739 ms. Remains 54599 /393068 variables (removed 338469) and now considering 101052/412249 (removed 311197) transitions.
// Phase 1: matrix 101052 rows 54599 cols
[2023-03-22 07:41:41] [INFO ] Computed 1607 place invariants in 8740 ms
[2023-03-22 07:41:45] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 07:41:45] [INFO ] Implicit Places using invariants in 12922 ms returned []
Implicit Place search using SMT only with invariants took 12923 ms to find 0 implicit places.
[2023-03-22 07:41:45] [INFO ] Invariant cache hit.
[2023-03-22 07:41:49] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 07:41:49] [INFO ] Dead Transitions using invariants and state equation in 4067 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 54599/393068 places, 101052/412249 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 140748 ms. Remains : 54599/393068 places, 101052/412249 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00400M0040C020P020G001-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s17644 (ADD s53797 s53798 s53799 s53800 s53801 s53802 s53803 s53804 s53805 s53806 s53807 s53808 s53809 s53810 s53811 s53812 s53813 s53814 s53815 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 58180 steps with 12 reset in 10001 ms.
Product exploration timeout after 57810 steps with 12 reset in 10003 ms.
Computed a total of 54599 stabilizing places and 101052 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 54599 transition count 101052
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 2011 ms. (steps per millisecond=4 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 1) seen :0
Finished probabilistic random walk after 180480 steps, run visited all 1 properties in 4207 ms. (steps per millisecond=42 )
Probabilistic random walk after 180480 steps, saw 180469 distinct states, run finished after 4218 ms. (steps per millisecond=42 ) properties seen :1
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Support contains 402 out of 54599 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54599/54599 places, 101052/101052 transitions.
Applied a total of 0 rules in 1799 ms. Remains 54599 /54599 variables (removed 0) and now considering 101052/101052 (removed 0) transitions.
[2023-03-22 07:42:30] [INFO ] Invariant cache hit.
[2023-03-22 07:42:34] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 07:42:34] [INFO ] Implicit Places using invariants in 4184 ms returned []
Implicit Place search using SMT only with invariants took 4185 ms to find 0 implicit places.
[2023-03-22 07:42:34] [INFO ] Invariant cache hit.
[2023-03-22 07:42:38] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 07:42:38] [INFO ] Dead Transitions using invariants and state equation in 4204 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10194 ms. Remains : 54599/54599 places, 101052/101052 transitions.
Computed a total of 54599 stabilizing places and 101052 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 54599 transition count 101052
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Finished random walk after 1226 steps, including 0 resets, run visited all 1 properties in 412 ms. (steps per millisecond=2 )
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration timeout after 57850 steps with 12 reset in 10007 ms.
Product exploration timeout after 57820 steps with 12 reset in 10008 ms.
Built C files in :
/tmp/ltsmin1726012041194248093
[2023-03-22 07:43:11] [INFO ] Too many transitions (101052) to apply POR reductions. Disabling POR matrices.
[2023-03-22 07:43:12] [INFO ] Built C files in 920ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1726012041194248093
Running compilation step : cd /tmp/ltsmin1726012041194248093;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1726012041194248093;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1726012041194248093;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 402 out of 54599 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54599/54599 places, 101052/101052 transitions.
Applied a total of 0 rules in 1753 ms. Remains 54599 /54599 variables (removed 0) and now considering 101052/101052 (removed 0) transitions.
[2023-03-22 07:43:17] [INFO ] Invariant cache hit.
[2023-03-22 07:43:21] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 07:43:21] [INFO ] Implicit Places using invariants in 4176 ms returned []
Implicit Place search using SMT only with invariants took 4178 ms to find 0 implicit places.
[2023-03-22 07:43:21] [INFO ] Invariant cache hit.
[2023-03-22 07:43:25] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 07:43:25] [INFO ] Dead Transitions using invariants and state equation in 4068 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10002 ms. Remains : 54599/54599 places, 101052/101052 transitions.
Built C files in :
/tmp/ltsmin14706059009901528569
[2023-03-22 07:43:25] [INFO ] Too many transitions (101052) to apply POR reductions. Disabling POR matrices.
[2023-03-22 07:43:26] [INFO ] Built C files in 693ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14706059009901528569
Running compilation step : cd /tmp/ltsmin14706059009901528569;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14706059009901528569;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14706059009901528569;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-22 07:43:41] [INFO ] Flatten gal took : 3361 ms
[2023-03-22 07:43:44] [INFO ] Flatten gal took : 3181 ms
[2023-03-22 07:43:45] [INFO ] Time to serialize gal into /tmp/LTL3538476783522475142.gal : 507 ms
[2023-03-22 07:43:45] [INFO ] Time to serialize properties into /tmp/LTL17849453498172077961.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3538476783522475142.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6913532819575369156.hoa' '-atoms' '/tmp/LTL17849453498172077961.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Detected timeout of ITS tools.
[2023-03-22 07:44:11] [INFO ] Flatten gal took : 3088 ms
[2023-03-22 07:44:14] [INFO ] Flatten gal took : 2785 ms
[2023-03-22 07:44:14] [INFO ] Time to serialize gal into /tmp/LTL4381796863741080714.gal : 378 ms
[2023-03-22 07:44:14] [INFO ] Time to serialize properties into /tmp/LTL4667190307892574691.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4381796863741080714.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4667190307892574691.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Detected timeout of ITS tools.
[2023-03-22 07:44:34] [INFO ] Flatten gal took : 3024 ms
[2023-03-22 07:44:34] [INFO ] Applying decomposition
[2023-03-22 07:44:37] [INFO ] Flatten gal took : 3068 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16842566378670713700.txt' '-o' '/tmp/graph16842566378670713700.bin' '-w' '/tmp/graph16842566378670713700.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16842566378670713700.bin' '-l' '-1' '-v' '-w' '/tmp/graph16842566378670713700.weights' '-q' '0' '-e' '0.001'
[2023-03-22 07:45:17] [INFO ] Decomposing Gal with order
[2023-03-22 07:45:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-22 07:47:54] [INFO ] Removed a total of 116069 redundant transitions.
[2023-03-22 07:47:56] [INFO ] Flatten gal took : 9494 ms
[2023-03-22 07:48:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 31241 labels/synchronizations in 5395 ms.
[2023-03-22 07:48:42] [INFO ] Time to serialize gal into /tmp/LTL7958673403528002012.gal : 666 ms
[2023-03-22 07:48:42] [INFO ] Time to serialize properties into /tmp/LTL8723415184100130571.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7958673403528002012.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8723415184100130571.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18261329651218045994
[2023-03-22 07:48:59] [INFO ] Built C files in 1961ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18261329651218045994
Running compilation step : cd /tmp/ltsmin18261329651218045994;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'

BK_STOP 1679471351396

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="FamilyReunion-COL-L00400M0040C020P020G001"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is FamilyReunion-COL-L00400M0040C020P020G001, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r165-tall-167838850300339"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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