/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/weaver/parallel-ticket-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:20:16,843 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:20:16,883 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-12-05 21:20:16,918 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:20:16,918 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:20:16,918 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:20:16,919 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:20:16,919 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:20:16,920 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:20:16,922 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:20:16,923 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:20:16,923 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:20:16,923 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:20:16,924 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:20:16,924 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:20:16,924 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:20:16,924 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:20:16,924 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:20:16,925 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:20:16,925 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:20:16,925 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:20:16,925 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:20:16,926 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:20:16,926 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:20:16,926 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:20:16,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:20:16,926 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:20:16,926 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:20:16,926 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:20:16,927 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:20:16,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:20:16,927 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:20:16,927 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:20:16,928 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-12-05 21:20:17,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:20:17,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:20:17,097 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:20:17,098 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:20:17,099 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:20:17,099 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-ticket-3.wvr.c [2023-12-05 21:20:18,015 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:20:18,166 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:20:18,166 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-3.wvr.c [2023-12-05 21:20:18,172 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0a8b3bab/85fc53830abe42bb87c8c5914cb0f836/FLAG714366227 [2023-12-05 21:20:18,182 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0a8b3bab/85fc53830abe42bb87c8c5914cb0f836 [2023-12-05 21:20:18,183 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:20:18,184 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:20:18,185 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:20:18,185 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:20:18,188 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:20:18,188 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:20:18" (1/1) ... [2023-12-05 21:20:18,190 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b192312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:20:18, skipping insertion in model container [2023-12-05 21:20:18,190 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:20:18" (1/1) ... [2023-12-05 21:20:18,210 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:20:18,310 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:20:18,318 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:20:18,334 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:20:18,339 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:20:18,339 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:20:18,344 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:20:18,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:20:18 WrapperNode [2023-12-05 21:20:18,344 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:20:18,345 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:20:18,345 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:20:18,345 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:20:18,349 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:20:18" (1/1) ... [2023-12-05 21:20:18,356 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:20:18" (1/1) ... [2023-12-05 21:20:18,370 INFO L138 Inliner]: procedures = 22, calls = 56, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 169 [2023-12-05 21:20:18,370 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:20:18,372 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:20:18,372 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:20:18,372 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:20:18,378 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:20:18" (1/1) ... [2023-12-05 21:20:18,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:20:18" (1/1) ... [2023-12-05 21:20:18,380 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:20:18" (1/1) ... [2023-12-05 21:20:18,380 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:20:18" (1/1) ... [2023-12-05 21:20:18,384 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:20:18" (1/1) ... [2023-12-05 21:20:18,385 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:20:18" (1/1) ... [2023-12-05 21:20:18,386 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:20:18" (1/1) ... [2023-12-05 21:20:18,387 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:20:18" (1/1) ... [2023-12-05 21:20:18,388 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:20:18,389 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:20:18,389 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:20:18,389 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:20:18,390 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:20:18" (1/1) ... [2023-12-05 21:20:18,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:20:18,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:20:18,412 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-05 21:20:18,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-05 21:20:18,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:20:18,434 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-05 21:20:18,434 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-05 21:20:18,434 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-05 21:20:18,434 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-05 21:20:18,435 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-12-05 21:20:18,435 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-12-05 21:20:18,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:20:18,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:20:18,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:20:18,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-05 21:20:18,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-05 21:20:18,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:20:18,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:20:18,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:20:18,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:20:18,437 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-05 21:20:18,511 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:20:18,512 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:20:18,767 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:20:18,823 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:20:18,823 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-05 21:20:18,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:20:18 BoogieIcfgContainer [2023-12-05 21:20:18,825 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:20:18,826 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:20:18,826 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:20:18,828 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:20:18,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:20:18" (1/3) ... [2023-12-05 21:20:18,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3751bf12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:20:18, skipping insertion in model container [2023-12-05 21:20:18,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:20:18" (2/3) ... [2023-12-05 21:20:18,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3751bf12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:20:18, skipping insertion in model container [2023-12-05 21:20:18,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:20:18" (3/3) ... [2023-12-05 21:20:18,830 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-ticket-3.wvr.c [2023-12-05 21:20:18,842 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:20:18,842 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2023-12-05 21:20:18,842 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:20:18,893 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-05 21:20:18,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 139 transitions, 299 flow [2023-12-05 21:20:18,992 INFO L124 PetriNetUnfolderBase]: 2/136 cut-off events. [2023-12-05 21:20:18,992 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-05 21:20:18,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 2/136 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2023-12-05 21:20:18,996 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 139 transitions, 299 flow [2023-12-05 21:20:18,998 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 111 transitions, 237 flow [2023-12-05 21:20:19,005 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:20:19,009 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@59dd45ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:20:19,009 INFO L363 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-12-05 21:20:19,018 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:20:19,018 INFO L124 PetriNetUnfolderBase]: 1/56 cut-off events. [2023-12-05 21:20:19,019 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:20:19,019 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:20:19,019 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:20:19,020 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-05 21:20:19,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:20:19,023 INFO L85 PathProgramCache]: Analyzing trace with hash -251204832, now seen corresponding path program 1 times [2023-12-05 21:20:19,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:20:19,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386089586] [2023-12-05 21:20:19,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:20:19,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:20:19,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:20:19,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:20:19,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:20:19,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386089586] [2023-12-05 21:20:19,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386089586] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:20:19,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:20:19,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:20:19,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549879549] [2023-12-05 21:20:19,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:20:19,492 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:20:19,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:20:19,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:20:19,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:20:19,516 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 139 [2023-12-05 21:20:19,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 111 transitions, 237 flow. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:19,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:20:19,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 139 [2023-12-05 21:20:19,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:20:19,726 INFO L124 PetriNetUnfolderBase]: 528/1202 cut-off events. [2023-12-05 21:20:19,726 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2023-12-05 21:20:19,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2114 conditions, 1202 events. 528/1202 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7060 event pairs, 528 based on Foata normal form. 1/1074 useless extension candidates. Maximal degree in co-relation 1712. Up to 841 conditions per place. [2023-12-05 21:20:19,740 INFO L140 encePairwiseOnDemand]: 135/139 looper letters, 31 selfloop transitions, 1 changer transitions 1/108 dead transitions. [2023-12-05 21:20:19,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 108 transitions, 295 flow [2023-12-05 21:20:19,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:20:19,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:20:19,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 320 transitions. [2023-12-05 21:20:19,754 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7673860911270983 [2023-12-05 21:20:19,754 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 320 transitions. [2023-12-05 21:20:19,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 320 transitions. [2023-12-05 21:20:19,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:20:19,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 320 transitions. [2023-12-05 21:20:19,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:19,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:19,765 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:19,770 INFO L308 CegarLoopForPetriNet]: 120 programPoint places, 0 predicate places. [2023-12-05 21:20:19,770 INFO L500 AbstractCegarLoop]: Abstraction has has 120 places, 108 transitions, 295 flow [2023-12-05 21:20:19,770 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:19,771 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:20:19,771 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:20:19,771 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:20:19,772 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-05 21:20:19,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:20:19,773 INFO L85 PathProgramCache]: Analyzing trace with hash -251204831, now seen corresponding path program 1 times [2023-12-05 21:20:19,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:20:19,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972341917] [2023-12-05 21:20:19,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:20:19,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:20:19,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:20:20,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:20:20,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:20:20,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972341917] [2023-12-05 21:20:20,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972341917] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:20:20,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:20:20,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:20:20,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790447121] [2023-12-05 21:20:20,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:20:20,020 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:20:20,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:20:20,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:20:20,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:20:20,023 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 139 [2023-12-05 21:20:20,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 108 transitions, 295 flow. Second operand has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:20,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:20:20,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 139 [2023-12-05 21:20:20,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:20:20,169 INFO L124 PetriNetUnfolderBase]: 438/1030 cut-off events. [2023-12-05 21:20:20,170 INFO L125 PetriNetUnfolderBase]: For 239/303 co-relation queries the response was YES. [2023-12-05 21:20:20,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2518 conditions, 1030 events. 438/1030 cut-off events. For 239/303 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5851 event pairs, 438 based on Foata normal form. 0/956 useless extension candidates. Maximal degree in co-relation 1873. Up to 726 conditions per place. [2023-12-05 21:20:20,177 INFO L140 encePairwiseOnDemand]: 136/139 looper letters, 33 selfloop transitions, 1 changer transitions 1/106 dead transitions. [2023-12-05 21:20:20,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 106 transitions, 355 flow [2023-12-05 21:20:20,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:20:20,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:20:20,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2023-12-05 21:20:20,180 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7410071942446043 [2023-12-05 21:20:20,180 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 309 transitions. [2023-12-05 21:20:20,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 309 transitions. [2023-12-05 21:20:20,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:20:20,180 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 309 transitions. [2023-12-05 21:20:20,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:20,183 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:20,183 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:20,184 INFO L308 CegarLoopForPetriNet]: 120 programPoint places, 0 predicate places. [2023-12-05 21:20:20,184 INFO L500 AbstractCegarLoop]: Abstraction has has 120 places, 106 transitions, 355 flow [2023-12-05 21:20:20,184 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:20,185 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:20:20,185 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:20:20,185 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:20:20,185 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-05 21:20:20,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:20:20,186 INFO L85 PathProgramCache]: Analyzing trace with hash 12341650, now seen corresponding path program 1 times [2023-12-05 21:20:20,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:20:20,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218109943] [2023-12-05 21:20:20,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:20:20,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:20:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:20:20,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:20:20,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:20:20,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218109943] [2023-12-05 21:20:20,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218109943] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:20:20,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:20:20,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:20:20,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906506436] [2023-12-05 21:20:20,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:20:20,291 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:20:20,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:20:20,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:20:20,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:20:20,292 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 139 [2023-12-05 21:20:20,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 106 transitions, 355 flow. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:20,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:20:20,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 139 [2023-12-05 21:20:20,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:20:20,468 INFO L124 PetriNetUnfolderBase]: 411/979 cut-off events. [2023-12-05 21:20:20,468 INFO L125 PetriNetUnfolderBase]: For 565/699 co-relation queries the response was YES. [2023-12-05 21:20:20,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3037 conditions, 979 events. 411/979 cut-off events. For 565/699 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5479 event pairs, 411 based on Foata normal form. 0/925 useless extension candidates. Maximal degree in co-relation 2365. Up to 679 conditions per place. [2023-12-05 21:20:20,476 INFO L140 encePairwiseOnDemand]: 136/139 looper letters, 29 selfloop transitions, 1 changer transitions 1/104 dead transitions. [2023-12-05 21:20:20,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 104 transitions, 403 flow [2023-12-05 21:20:20,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:20:20,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:20:20,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions. [2023-12-05 21:20:20,477 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7601918465227818 [2023-12-05 21:20:20,477 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 317 transitions. [2023-12-05 21:20:20,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 317 transitions. [2023-12-05 21:20:20,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:20:20,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 317 transitions. [2023-12-05 21:20:20,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:20,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:20,479 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:20,481 INFO L308 CegarLoopForPetriNet]: 120 programPoint places, 0 predicate places. [2023-12-05 21:20:20,481 INFO L500 AbstractCegarLoop]: Abstraction has has 120 places, 104 transitions, 403 flow [2023-12-05 21:20:20,481 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:20,481 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:20:20,482 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:20:20,482 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:20:20,482 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-05 21:20:20,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:20:20,482 INFO L85 PathProgramCache]: Analyzing trace with hash 12341651, now seen corresponding path program 1 times [2023-12-05 21:20:20,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:20:20,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352600531] [2023-12-05 21:20:20,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:20:20,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:20:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:20:20,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:20:20,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:20:20,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352600531] [2023-12-05 21:20:20,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352600531] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:20:20,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:20:20,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:20:20,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424005937] [2023-12-05 21:20:20,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:20:20,606 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:20:20,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:20:20,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:20:20,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:20:20,610 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 139 [2023-12-05 21:20:20,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 104 transitions, 403 flow. Second operand has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:20,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:20:20,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 139 [2023-12-05 21:20:20,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:20:20,743 INFO L124 PetriNetUnfolderBase]: 384/928 cut-off events. [2023-12-05 21:20:20,744 INFO L125 PetriNetUnfolderBase]: For 1020/1248 co-relation queries the response was YES. [2023-12-05 21:20:20,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3502 conditions, 928 events. 384/928 cut-off events. For 1020/1248 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5214 event pairs, 384 based on Foata normal form. 18/894 useless extension candidates. Maximal degree in co-relation 2863. Up to 632 conditions per place. [2023-12-05 21:20:20,751 INFO L140 encePairwiseOnDemand]: 136/139 looper letters, 29 selfloop transitions, 1 changer transitions 1/102 dead transitions. [2023-12-05 21:20:20,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 102 transitions, 451 flow [2023-12-05 21:20:20,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:20:20,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:20:20,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 305 transitions. [2023-12-05 21:20:20,753 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7314148681055156 [2023-12-05 21:20:20,753 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 305 transitions. [2023-12-05 21:20:20,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 305 transitions. [2023-12-05 21:20:20,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:20:20,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 305 transitions. [2023-12-05 21:20:20,754 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:20,755 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:20,756 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:20,758 INFO L308 CegarLoopForPetriNet]: 120 programPoint places, 0 predicate places. [2023-12-05 21:20:20,758 INFO L500 AbstractCegarLoop]: Abstraction has has 120 places, 102 transitions, 451 flow [2023-12-05 21:20:20,758 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:20,758 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:20:20,758 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:20:20,759 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:20:20,759 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-05 21:20:20,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:20:20,759 INFO L85 PathProgramCache]: Analyzing trace with hash 80554990, now seen corresponding path program 1 times [2023-12-05 21:20:20,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:20:20,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145189336] [2023-12-05 21:20:20,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:20:20,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:20:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:20:20,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:20:20,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:20:20,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145189336] [2023-12-05 21:20:20,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145189336] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:20:20,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:20:20,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:20:20,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769980620] [2023-12-05 21:20:20,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:20:20,842 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:20:20,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:20:20,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:20:20,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:20:20,843 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 139 [2023-12-05 21:20:20,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 102 transitions, 451 flow. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:20,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:20:20,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 139 [2023-12-05 21:20:20,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:20:20,953 INFO L124 PetriNetUnfolderBase]: 357/869 cut-off events. [2023-12-05 21:20:20,954 INFO L125 PetriNetUnfolderBase]: For 1527/1831 co-relation queries the response was YES. [2023-12-05 21:20:20,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3845 conditions, 869 events. 357/869 cut-off events. For 1527/1831 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4752 event pairs, 357 based on Foata normal form. 4/837 useless extension candidates. Maximal degree in co-relation 3137. Up to 585 conditions per place. [2023-12-05 21:20:20,962 INFO L140 encePairwiseOnDemand]: 136/139 looper letters, 27 selfloop transitions, 1 changer transitions 1/100 dead transitions. [2023-12-05 21:20:20,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 100 transitions, 487 flow [2023-12-05 21:20:20,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:20:20,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:20:20,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2023-12-05 21:20:20,964 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7553956834532374 [2023-12-05 21:20:20,964 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 315 transitions. [2023-12-05 21:20:20,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 315 transitions. [2023-12-05 21:20:20,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:20:20,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 315 transitions. [2023-12-05 21:20:20,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:20,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:20,966 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:20,968 INFO L308 CegarLoopForPetriNet]: 120 programPoint places, 0 predicate places. [2023-12-05 21:20:20,968 INFO L500 AbstractCegarLoop]: Abstraction has has 120 places, 100 transitions, 487 flow [2023-12-05 21:20:20,968 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:20,968 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:20:20,968 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:20:20,969 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:20:20,969 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-05 21:20:20,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:20:20,972 INFO L85 PathProgramCache]: Analyzing trace with hash 80554991, now seen corresponding path program 1 times [2023-12-05 21:20:20,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:20:20,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604518072] [2023-12-05 21:20:20,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:20:20,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:20:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:20:21,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:20:21,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:20:21,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604518072] [2023-12-05 21:20:21,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604518072] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:20:21,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:20:21,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:20:21,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618311574] [2023-12-05 21:20:21,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:20:21,066 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:20:21,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:20:21,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:20:21,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:20:21,067 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 139 [2023-12-05 21:20:21,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 100 transitions, 487 flow. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:21,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:20:21,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 139 [2023-12-05 21:20:21,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:20:21,177 INFO L124 PetriNetUnfolderBase]: 330/810 cut-off events. [2023-12-05 21:20:21,177 INFO L125 PetriNetUnfolderBase]: For 2120/2512 co-relation queries the response was YES. [2023-12-05 21:20:21,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4133 conditions, 810 events. 330/810 cut-off events. For 2120/2512 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4297 event pairs, 330 based on Foata normal form. 12/794 useless extension candidates. Maximal degree in co-relation 3363. Up to 538 conditions per place. [2023-12-05 21:20:21,181 INFO L140 encePairwiseOnDemand]: 136/139 looper letters, 0 selfloop transitions, 0 changer transitions 98/98 dead transitions. [2023-12-05 21:20:21,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 98 transitions, 521 flow [2023-12-05 21:20:21,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:20:21,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:20:21,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2023-12-05 21:20:21,183 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7697841726618705 [2023-12-05 21:20:21,183 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2023-12-05 21:20:21,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2023-12-05 21:20:21,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:20:21,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2023-12-05 21:20:21,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:21,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:21,185 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:21,186 INFO L308 CegarLoopForPetriNet]: 120 programPoint places, 0 predicate places. [2023-12-05 21:20:21,187 INFO L500 AbstractCegarLoop]: Abstraction has has 120 places, 98 transitions, 521 flow [2023-12-05 21:20:21,187 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:21,192 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/parallel-ticket-3.wvr.c_BEv2_AllErrorsAtOnce [2023-12-05 21:20:21,217 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 15 remaining) [2023-12-05 21:20:21,218 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 15 remaining) [2023-12-05 21:20:21,218 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2023-12-05 21:20:21,218 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2023-12-05 21:20:21,218 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2023-12-05 21:20:21,218 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2023-12-05 21:20:21,219 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2023-12-05 21:20:21,219 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2023-12-05 21:20:21,219 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2023-12-05 21:20:21,219 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2023-12-05 21:20:21,219 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2023-12-05 21:20:21,219 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2023-12-05 21:20:21,219 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 15 remaining) [2023-12-05 21:20:21,219 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 15 remaining) [2023-12-05 21:20:21,219 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 15 remaining) [2023-12-05 21:20:21,219 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:20:21,220 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-05 21:20:21,222 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:20:21,222 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:20:21,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:20:21 BasicIcfg [2023-12-05 21:20:21,230 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:20:21,230 INFO L158 Benchmark]: Toolchain (without parser) took 3046.22ms. Allocated memory was 251.7MB in the beginning and 374.3MB in the end (delta: 122.7MB). Free memory was 208.9MB in the beginning and 201.8MB in the end (delta: 7.1MB). Peak memory consumption was 131.3MB. Max. memory is 8.0GB. [2023-12-05 21:20:21,231 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 191.9MB. Free memory is still 143.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:20:21,231 INFO L158 Benchmark]: CACSL2BoogieTranslator took 159.48ms. Allocated memory is still 251.7MB. Free memory was 208.9MB in the beginning and 197.5MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-05 21:20:21,231 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.56ms. Allocated memory is still 251.7MB. Free memory was 197.5MB in the beginning and 195.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:20:21,231 INFO L158 Benchmark]: Boogie Preprocessor took 16.29ms. Allocated memory is still 251.7MB. Free memory was 195.4MB in the beginning and 193.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:20:21,231 INFO L158 Benchmark]: RCFGBuilder took 435.70ms. Allocated memory is still 251.7MB. Free memory was 193.9MB in the beginning and 171.6MB in the end (delta: 22.3MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-12-05 21:20:21,231 INFO L158 Benchmark]: TraceAbstraction took 2404.02ms. Allocated memory was 251.7MB in the beginning and 374.3MB in the end (delta: 122.7MB). Free memory was 170.9MB in the beginning and 201.8MB in the end (delta: -31.0MB). Peak memory consumption was 92.5MB. Max. memory is 8.0GB. [2023-12-05 21:20:21,232 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 191.9MB. Free memory is still 143.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 159.48ms. Allocated memory is still 251.7MB. Free memory was 208.9MB in the beginning and 197.5MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.56ms. Allocated memory is still 251.7MB. Free memory was 197.5MB in the beginning and 195.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.29ms. Allocated memory is still 251.7MB. Free memory was 195.4MB in the beginning and 193.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 435.70ms. Allocated memory is still 251.7MB. Free memory was 193.9MB in the beginning and 171.6MB in the end (delta: 22.3MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 2404.02ms. Allocated memory was 251.7MB in the beginning and 374.3MB in the end (delta: 122.7MB). Free memory was 170.9MB in the beginning and 201.8MB in the end (delta: -31.0MB). Peak memory consumption was 92.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 166 locations, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.3s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 128 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 128 mSDsluCounter, 37 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 180 IncrementalHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 35 mSDtfsCounter, 180 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=521occurred in iteration=6, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 360 NumberOfCodeBlocks, 360 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 354 ConstructedInterpolants, 0 QuantifiedInterpolants, 1912 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-05 21:20:21,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...