/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/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:13:32,408 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:13:32,472 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:13:32,502 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:13:32,503 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:13:32,503 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:13:32,503 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:13:32,504 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:13:32,504 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:13:32,508 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:13:32,509 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:13:32,509 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:13:32,509 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:13:32,510 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:13:32,510 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:13:32,510 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:13:32,510 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:13:32,510 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:13:32,511 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:13:32,511 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:13:32,511 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:13:32,511 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:13:32,512 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:13:32,512 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:13:32,512 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:13:32,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:13:32,512 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:13:32,512 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:13:32,512 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:13:32,513 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:13:32,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:13:32,513 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:13:32,513 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:13:32,514 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:13:32,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:13:32,719 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:13:32,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:13:32,721 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:13:32,722 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:13:32,723 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2023-12-05 21:13:33,762 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:13:33,934 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:13:33,935 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2023-12-05 21:13:33,944 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16694e55f/5d79d26a1366492aa4bc0f4001be7fdc/FLAG5bc458a4d [2023-12-05 21:13:33,954 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16694e55f/5d79d26a1366492aa4bc0f4001be7fdc [2023-12-05 21:13:33,956 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:13:33,957 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:13:33,958 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:13:33,958 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:13:33,961 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:13:33,961 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:13:33" (1/1) ... [2023-12-05 21:13:33,962 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2178847e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:13:33, skipping insertion in model container [2023-12-05 21:13:33,962 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:13:33" (1/1) ... [2023-12-05 21:13:34,002 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:13:34,225 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:13:34,241 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:13:34,286 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:13:34,320 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:13:34,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:13:34 WrapperNode [2023-12-05 21:13:34,321 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:13:34,322 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:13:34,322 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:13:34,322 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:13:34,327 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:13:34" (1/1) ... [2023-12-05 21:13:34,335 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:13:34" (1/1) ... [2023-12-05 21:13:34,351 INFO L138 Inliner]: procedures = 166, calls = 39, calls flagged for inlining = 8, calls inlined = 9, statements flattened = 131 [2023-12-05 21:13:34,352 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:13:34,352 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:13:34,352 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:13:34,352 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:13:34,361 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:13:34" (1/1) ... [2023-12-05 21:13:34,362 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:13:34" (1/1) ... [2023-12-05 21:13:34,376 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:13:34" (1/1) ... [2023-12-05 21:13:34,376 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:13:34" (1/1) ... [2023-12-05 21:13:34,382 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:13:34" (1/1) ... [2023-12-05 21:13:34,384 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:13:34" (1/1) ... [2023-12-05 21:13:34,385 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:13:34" (1/1) ... [2023-12-05 21:13:34,386 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:13:34" (1/1) ... [2023-12-05 21:13:34,388 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:13:34,393 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:13:34,393 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:13:34,393 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:13:34,393 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:13:34" (1/1) ... [2023-12-05 21:13:34,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:13:34,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:13:34,431 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:13:34,464 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:13:34,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:13:34,472 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2023-12-05 21:13:34,472 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2023-12-05 21:13:34,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:13:34,472 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-05 21:13:34,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:13:34,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:13:34,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:13:34,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:13:34,473 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-05 21:13:34,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:13:34,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:13:34,475 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:13:34,576 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:13:34,595 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:13:34,778 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:13:34,794 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:13:34,794 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-05 21:13:34,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:13:34 BoogieIcfgContainer [2023-12-05 21:13:34,796 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:13:34,798 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:13:34,798 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:13:34,800 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:13:34,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:13:33" (1/3) ... [2023-12-05 21:13:34,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b206290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:13:34, skipping insertion in model container [2023-12-05 21:13:34,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:13:34" (2/3) ... [2023-12-05 21:13:34,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b206290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:13:34, skipping insertion in model container [2023-12-05 21:13:34,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:13:34" (3/3) ... [2023-12-05 21:13:34,801 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2023-12-05 21:13:34,812 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:13:34,813 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2023-12-05 21:13:34,813 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:13:34,870 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:13:34,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 172 transitions, 348 flow [2023-12-05 21:13:34,959 INFO L124 PetriNetUnfolderBase]: 12/171 cut-off events. [2023-12-05 21:13:34,960 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:13:34,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 171 events. 12/171 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 420 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 131. Up to 2 conditions per place. [2023-12-05 21:13:34,966 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 172 transitions, 348 flow [2023-12-05 21:13:34,973 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 163 places, 171 transitions, 345 flow [2023-12-05 21:13:34,979 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:13:34,983 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;@666ade5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:13:34,983 INFO L363 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2023-12-05 21:13:34,988 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:13:34,988 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2023-12-05 21:13:34,988 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:13:34,988 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:13:34,988 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] [2023-12-05 21:13:34,989 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-12-05 21:13:34,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:13:34,992 INFO L85 PathProgramCache]: Analyzing trace with hash 282867965, now seen corresponding path program 1 times [2023-12-05 21:13:34,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:13:34,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584150861] [2023-12-05 21:13:34,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:34,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:13:35,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:13:35,350 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:13:35,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:13:35,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584150861] [2023-12-05 21:13:35,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584150861] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:13:35,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:13:35,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:13:35,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315073833] [2023-12-05 21:13:35,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:13:35,358 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:13:35,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:13:35,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:13:35,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:13:35,391 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 172 [2023-12-05 21:13:35,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 171 transitions, 345 flow. Second operand has 6 states, 6 states have (on average 113.83333333333333) internal successors, (683), 6 states have internal predecessors, (683), 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:13:35,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:13:35,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 172 [2023-12-05 21:13:35,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:13:35,730 INFO L124 PetriNetUnfolderBase]: 192/1031 cut-off events. [2023-12-05 21:13:35,730 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:13:35,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1415 conditions, 1031 events. 192/1031 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 7689 event pairs, 144 based on Foata normal form. 80/947 useless extension candidates. Maximal degree in co-relation 1347. Up to 335 conditions per place. [2023-12-05 21:13:35,740 INFO L140 encePairwiseOnDemand]: 156/172 looper letters, 59 selfloop transitions, 7 changer transitions 0/170 dead transitions. [2023-12-05 21:13:35,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 170 transitions, 475 flow [2023-12-05 21:13:35,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-05 21:13:35,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-05 21:13:35,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 748 transitions. [2023-12-05 21:13:35,756 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7248062015503876 [2023-12-05 21:13:35,757 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 748 transitions. [2023-12-05 21:13:35,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 748 transitions. [2023-12-05 21:13:35,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:13:35,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 748 transitions. [2023-12-05 21:13:35,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.66666666666667) internal successors, (748), 6 states have internal predecessors, (748), 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:13:35,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 172.0) internal successors, (1204), 7 states have internal predecessors, (1204), 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:13:35,772 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 172.0) internal successors, (1204), 7 states have internal predecessors, (1204), 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:13:35,775 INFO L308 CegarLoopForPetriNet]: 163 programPoint places, -5 predicate places. [2023-12-05 21:13:35,775 INFO L500 AbstractCegarLoop]: Abstraction has has 158 places, 170 transitions, 475 flow [2023-12-05 21:13:35,776 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.83333333333333) internal successors, (683), 6 states have internal predecessors, (683), 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:13:35,776 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:13:35,776 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] [2023-12-05 21:13:35,776 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:13:35,776 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-12-05 21:13:35,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:13:35,778 INFO L85 PathProgramCache]: Analyzing trace with hash 282867966, now seen corresponding path program 1 times [2023-12-05 21:13:35,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:13:35,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362037830] [2023-12-05 21:13:35,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:35,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:13:35,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:13:35,979 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:13:35,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:13:35,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362037830] [2023-12-05 21:13:35,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362037830] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:13:35,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:13:35,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-05 21:13:35,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088794536] [2023-12-05 21:13:35,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:13:35,982 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-05 21:13:35,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:13:35,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-05 21:13:35,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-05 21:13:35,985 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 172 [2023-12-05 21:13:35,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 170 transitions, 475 flow. Second operand has 7 states, 7 states have (on average 103.42857142857143) internal successors, (724), 7 states have internal predecessors, (724), 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:13:35,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:13:35,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 172 [2023-12-05 21:13:35,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:13:36,281 INFO L124 PetriNetUnfolderBase]: 327/1394 cut-off events. [2023-12-05 21:13:36,281 INFO L125 PetriNetUnfolderBase]: For 192/200 co-relation queries the response was YES. [2023-12-05 21:13:36,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2532 conditions, 1394 events. 327/1394 cut-off events. For 192/200 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 11216 event pairs, 264 based on Foata normal form. 2/1185 useless extension candidates. Maximal degree in co-relation 2441. Up to 588 conditions per place. [2023-12-05 21:13:36,290 INFO L140 encePairwiseOnDemand]: 164/172 looper letters, 74 selfloop transitions, 7 changer transitions 0/175 dead transitions. [2023-12-05 21:13:36,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 175 transitions, 645 flow [2023-12-05 21:13:36,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-05 21:13:36,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-05 21:13:36,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 789 transitions. [2023-12-05 21:13:36,293 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6553156146179402 [2023-12-05 21:13:36,293 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 789 transitions. [2023-12-05 21:13:36,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 789 transitions. [2023-12-05 21:13:36,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:13:36,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 789 transitions. [2023-12-05 21:13:36,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 112.71428571428571) internal successors, (789), 7 states have internal predecessors, (789), 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:13:36,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 172.0) internal successors, (1376), 8 states have internal predecessors, (1376), 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:13:36,298 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 172.0) internal successors, (1376), 8 states have internal predecessors, (1376), 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:13:36,299 INFO L308 CegarLoopForPetriNet]: 163 programPoint places, 0 predicate places. [2023-12-05 21:13:36,299 INFO L500 AbstractCegarLoop]: Abstraction has has 163 places, 175 transitions, 645 flow [2023-12-05 21:13:36,299 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 103.42857142857143) internal successors, (724), 7 states have internal predecessors, (724), 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:13:36,299 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:13:36,300 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] [2023-12-05 21:13:36,300 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:13:36,300 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-12-05 21:13:36,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:13:36,301 INFO L85 PathProgramCache]: Analyzing trace with hash 983282043, now seen corresponding path program 1 times [2023-12-05 21:13:36,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:13:36,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572807705] [2023-12-05 21:13:36,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:36,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:13:36,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:13:36,368 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:13:36,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:13:36,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572807705] [2023-12-05 21:13:36,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572807705] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:13:36,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:13:36,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:13:36,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232779029] [2023-12-05 21:13:36,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:13:36,370 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:13:36,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:13:36,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:13:36,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:13:36,372 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 172 [2023-12-05 21:13:36,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 175 transitions, 645 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 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:13:36,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:13:36,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 172 [2023-12-05 21:13:36,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:13:36,526 INFO L124 PetriNetUnfolderBase]: 359/1436 cut-off events. [2023-12-05 21:13:36,527 INFO L125 PetriNetUnfolderBase]: For 601/610 co-relation queries the response was YES. [2023-12-05 21:13:36,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3134 conditions, 1436 events. 359/1436 cut-off events. For 601/610 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 11693 event pairs, 280 based on Foata normal form. 2/1210 useless extension candidates. Maximal degree in co-relation 3035. Up to 587 conditions per place. [2023-12-05 21:13:36,535 INFO L140 encePairwiseOnDemand]: 169/172 looper letters, 49 selfloop transitions, 2 changer transitions 0/174 dead transitions. [2023-12-05 21:13:36,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 174 transitions, 741 flow [2023-12-05 21:13:36,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:13:36,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:13:36,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2023-12-05 21:13:36,540 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8217054263565892 [2023-12-05 21:13:36,540 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 424 transitions. [2023-12-05 21:13:36,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 424 transitions. [2023-12-05 21:13:36,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:13:36,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 424 transitions. [2023-12-05 21:13:36,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 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:13:36,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 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:13:36,542 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 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:13:36,543 INFO L308 CegarLoopForPetriNet]: 163 programPoint places, 1 predicate places. [2023-12-05 21:13:36,544 INFO L500 AbstractCegarLoop]: Abstraction has has 164 places, 174 transitions, 741 flow [2023-12-05 21:13:36,544 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 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:13:36,544 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:13:36,544 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] [2023-12-05 21:13:36,544 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:13:36,544 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-12-05 21:13:36,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:13:36,545 INFO L85 PathProgramCache]: Analyzing trace with hash 983282044, now seen corresponding path program 1 times [2023-12-05 21:13:36,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:13:36,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958059490] [2023-12-05 21:13:36,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:36,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:13:36,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:13:36,645 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:13:36,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:13:36,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958059490] [2023-12-05 21:13:36,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958059490] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:13:36,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:13:36,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:13:36,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228270745] [2023-12-05 21:13:36,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:13:36,649 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:13:36,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:13:36,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:13:36,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:13:36,651 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 172 [2023-12-05 21:13:36,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 174 transitions, 741 flow. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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:13:36,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:13:36,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 172 [2023-12-05 21:13:36,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:13:36,792 INFO L124 PetriNetUnfolderBase]: 369/1439 cut-off events. [2023-12-05 21:13:36,792 INFO L125 PetriNetUnfolderBase]: For 1504/1514 co-relation queries the response was YES. [2023-12-05 21:13:36,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3651 conditions, 1439 events. 369/1439 cut-off events. For 1504/1514 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 11677 event pairs, 264 based on Foata normal form. 1/1383 useless extension candidates. Maximal degree in co-relation 3546. Up to 586 conditions per place. [2023-12-05 21:13:36,800 INFO L140 encePairwiseOnDemand]: 169/172 looper letters, 62 selfloop transitions, 2 changer transitions 0/188 dead transitions. [2023-12-05 21:13:36,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 188 transitions, 959 flow [2023-12-05 21:13:36,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:13:36,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:13:36,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2023-12-05 21:13:36,802 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8236434108527132 [2023-12-05 21:13:36,802 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2023-12-05 21:13:36,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2023-12-05 21:13:36,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:13:36,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2023-12-05 21:13:36,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 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:13:36,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 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:13:36,804 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 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:13:36,805 INFO L308 CegarLoopForPetriNet]: 163 programPoint places, 2 predicate places. [2023-12-05 21:13:36,806 INFO L500 AbstractCegarLoop]: Abstraction has has 165 places, 188 transitions, 959 flow [2023-12-05 21:13:36,806 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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:13:36,806 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:13:36,807 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] [2023-12-05 21:13:36,807 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:13:36,808 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting workerErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-12-05 21:13:36,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:13:36,808 INFO L85 PathProgramCache]: Analyzing trace with hash 2139338886, now seen corresponding path program 1 times [2023-12-05 21:13:36,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:13:36,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103429063] [2023-12-05 21:13:36,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:36,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:13:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:13:36,928 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:13:36,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:13:36,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103429063] [2023-12-05 21:13:36,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103429063] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:13:36,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:13:36,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-05 21:13:36,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085867250] [2023-12-05 21:13:36,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:13:36,929 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-05 21:13:36,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:13:36,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-05 21:13:36,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-05 21:13:36,930 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 172 [2023-12-05 21:13:36,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 188 transitions, 959 flow. Second operand has 8 states, 8 states have (on average 104.375) internal successors, (835), 8 states have internal predecessors, (835), 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:13:36,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:13:36,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 172 [2023-12-05 21:13:36,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:13:37,279 INFO L124 PetriNetUnfolderBase]: 401/1434 cut-off events. [2023-12-05 21:13:37,279 INFO L125 PetriNetUnfolderBase]: For 3486/3905 co-relation queries the response was YES. [2023-12-05 21:13:37,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4287 conditions, 1434 events. 401/1434 cut-off events. For 3486/3905 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 11074 event pairs, 79 based on Foata normal form. 90/1432 useless extension candidates. Maximal degree in co-relation 4159. Up to 498 conditions per place. [2023-12-05 21:13:37,288 INFO L140 encePairwiseOnDemand]: 150/172 looper letters, 117 selfloop transitions, 25 changer transitions 0/235 dead transitions. [2023-12-05 21:13:37,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 235 transitions, 1617 flow [2023-12-05 21:13:37,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-05 21:13:37,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-05 21:13:37,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1135 transitions. [2023-12-05 21:13:37,290 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6598837209302325 [2023-12-05 21:13:37,291 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1135 transitions. [2023-12-05 21:13:37,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1135 transitions. [2023-12-05 21:13:37,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:13:37,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1135 transitions. [2023-12-05 21:13:37,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 113.5) internal successors, (1135), 10 states have internal predecessors, (1135), 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:13:37,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 172.0) internal successors, (1892), 11 states have internal predecessors, (1892), 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:13:37,297 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 172.0) internal successors, (1892), 11 states have internal predecessors, (1892), 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:13:37,298 INFO L308 CegarLoopForPetriNet]: 163 programPoint places, 11 predicate places. [2023-12-05 21:13:37,299 INFO L500 AbstractCegarLoop]: Abstraction has has 174 places, 235 transitions, 1617 flow [2023-12-05 21:13:37,299 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 104.375) internal successors, (835), 8 states have internal predecessors, (835), 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:13:37,299 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:13:37,299 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] [2023-12-05 21:13:37,299 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:13:37,299 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting workerErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-12-05 21:13:37,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:13:37,300 INFO L85 PathProgramCache]: Analyzing trace with hash 2139338887, now seen corresponding path program 1 times [2023-12-05 21:13:37,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:13:37,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782053172] [2023-12-05 21:13:37,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:37,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:13:37,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:13:37,495 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:13:37,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:13:37,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782053172] [2023-12-05 21:13:37,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782053172] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:13:37,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:13:37,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-05 21:13:37,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705092065] [2023-12-05 21:13:37,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:13:37,496 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-05 21:13:37,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:13:37,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-05 21:13:37,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-05 21:13:37,498 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 172 [2023-12-05 21:13:37,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 235 transitions, 1617 flow. Second operand has 9 states, 9 states have (on average 105.88888888888889) internal successors, (953), 9 states have internal predecessors, (953), 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:13:37,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:13:37,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 172 [2023-12-05 21:13:37,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:13:37,799 INFO L124 PetriNetUnfolderBase]: 305/1287 cut-off events. [2023-12-05 21:13:37,800 INFO L125 PetriNetUnfolderBase]: For 4088/4373 co-relation queries the response was YES. [2023-12-05 21:13:37,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3863 conditions, 1287 events. 305/1287 cut-off events. For 4088/4373 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 9774 event pairs, 38 based on Foata normal form. 118/1323 useless extension candidates. Maximal degree in co-relation 3713. Up to 348 conditions per place. [2023-12-05 21:13:37,808 INFO L140 encePairwiseOnDemand]: 156/172 looper letters, 93 selfloop transitions, 15 changer transitions 0/211 dead transitions. [2023-12-05 21:13:37,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 211 transitions, 1629 flow [2023-12-05 21:13:37,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-05 21:13:37,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-05 21:13:37,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1104 transitions. [2023-12-05 21:13:37,811 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.641860465116279 [2023-12-05 21:13:37,811 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1104 transitions. [2023-12-05 21:13:37,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1104 transitions. [2023-12-05 21:13:37,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:13:37,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1104 transitions. [2023-12-05 21:13:37,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 110.4) internal successors, (1104), 10 states have internal predecessors, (1104), 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:13:37,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 172.0) internal successors, (1892), 11 states have internal predecessors, (1892), 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:13:37,816 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 172.0) internal successors, (1892), 11 states have internal predecessors, (1892), 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:13:37,818 INFO L308 CegarLoopForPetriNet]: 163 programPoint places, 14 predicate places. [2023-12-05 21:13:37,818 INFO L500 AbstractCegarLoop]: Abstraction has has 177 places, 211 transitions, 1629 flow [2023-12-05 21:13:37,819 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 105.88888888888889) internal successors, (953), 9 states have internal predecessors, (953), 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:13:37,819 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:13:37,819 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] [2023-12-05 21:13:37,819 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:13:37,819 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-12-05 21:13:37,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:13:37,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1872614086, now seen corresponding path program 1 times [2023-12-05 21:13:37,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:13:37,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447125538] [2023-12-05 21:13:37,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:37,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:13:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:13:37,982 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:13:37,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:13:37,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447125538] [2023-12-05 21:13:37,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447125538] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:13:37,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:13:37,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-05 21:13:37,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219005524] [2023-12-05 21:13:37,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:13:37,987 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-05 21:13:37,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:13:37,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-05 21:13:37,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-05 21:13:37,990 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 172 [2023-12-05 21:13:37,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 211 transitions, 1629 flow. Second operand has 9 states, 9 states have (on average 108.88888888888889) internal successors, (980), 9 states have internal predecessors, (980), 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:13:37,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:13:37,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 172 [2023-12-05 21:13:37,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:13:38,282 INFO L124 PetriNetUnfolderBase]: 305/1282 cut-off events. [2023-12-05 21:13:38,282 INFO L125 PetriNetUnfolderBase]: For 5168/5268 co-relation queries the response was YES. [2023-12-05 21:13:38,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4197 conditions, 1282 events. 305/1282 cut-off events. For 5168/5268 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 9482 event pairs, 33 based on Foata normal form. 45/1251 useless extension candidates. Maximal degree in co-relation 4025. Up to 314 conditions per place. [2023-12-05 21:13:38,290 INFO L140 encePairwiseOnDemand]: 159/172 looper letters, 105 selfloop transitions, 12 changer transitions 0/222 dead transitions. [2023-12-05 21:13:38,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 222 transitions, 2063 flow [2023-12-05 21:13:38,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-05 21:13:38,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-05 21:13:38,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1127 transitions. [2023-12-05 21:13:38,292 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6552325581395348 [2023-12-05 21:13:38,293 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1127 transitions. [2023-12-05 21:13:38,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1127 transitions. [2023-12-05 21:13:38,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:13:38,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1127 transitions. [2023-12-05 21:13:38,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 112.7) internal successors, (1127), 10 states have internal predecessors, (1127), 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:13:38,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 172.0) internal successors, (1892), 11 states have internal predecessors, (1892), 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:13:38,298 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 172.0) internal successors, (1892), 11 states have internal predecessors, (1892), 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:13:38,299 INFO L308 CegarLoopForPetriNet]: 163 programPoint places, 20 predicate places. [2023-12-05 21:13:38,299 INFO L500 AbstractCegarLoop]: Abstraction has has 183 places, 222 transitions, 2063 flow [2023-12-05 21:13:38,299 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 108.88888888888889) internal successors, (980), 9 states have internal predecessors, (980), 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:13:38,299 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:13:38,300 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] [2023-12-05 21:13:38,300 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:13:38,300 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-12-05 21:13:38,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:13:38,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1872614085, now seen corresponding path program 1 times [2023-12-05 21:13:38,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:13:38,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316307316] [2023-12-05 21:13:38,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:38,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:13:38,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:13:38,382 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:13:38,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:13:38,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316307316] [2023-12-05 21:13:38,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316307316] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:13:38,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:13:38,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-05 21:13:38,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663036973] [2023-12-05 21:13:38,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:13:38,383 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-05 21:13:38,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:13:38,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-05 21:13:38,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-05 21:13:38,385 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 172 [2023-12-05 21:13:38,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 222 transitions, 2063 flow. Second operand has 8 states, 8 states have (on average 107.375) internal successors, (859), 8 states have internal predecessors, (859), 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:13:38,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:13:38,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 172 [2023-12-05 21:13:38,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:13:38,600 INFO L124 PetriNetUnfolderBase]: 219/1018 cut-off events. [2023-12-05 21:13:38,600 INFO L125 PetriNetUnfolderBase]: For 5671/5748 co-relation queries the response was YES. [2023-12-05 21:13:38,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3651 conditions, 1018 events. 219/1018 cut-off events. For 5671/5748 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 7231 event pairs, 30 based on Foata normal form. 52/1013 useless extension candidates. Maximal degree in co-relation 3456. Up to 237 conditions per place. [2023-12-05 21:13:38,608 INFO L140 encePairwiseOnDemand]: 159/172 looper letters, 104 selfloop transitions, 14 changer transitions 0/213 dead transitions. [2023-12-05 21:13:38,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 213 transitions, 2191 flow [2023-12-05 21:13:38,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-05 21:13:38,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-05 21:13:38,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1018 transitions. [2023-12-05 21:13:38,610 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6576227390180879 [2023-12-05 21:13:38,610 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1018 transitions. [2023-12-05 21:13:38,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1018 transitions. [2023-12-05 21:13:38,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:13:38,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1018 transitions. [2023-12-05 21:13:38,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 113.11111111111111) internal successors, (1018), 9 states have internal predecessors, (1018), 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:13:38,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 172.0) internal successors, (1720), 10 states have internal predecessors, (1720), 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:13:38,615 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 172.0) internal successors, (1720), 10 states have internal predecessors, (1720), 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:13:38,616 INFO L308 CegarLoopForPetriNet]: 163 programPoint places, 25 predicate places. [2023-12-05 21:13:38,616 INFO L500 AbstractCegarLoop]: Abstraction has has 188 places, 213 transitions, 2191 flow [2023-12-05 21:13:38,617 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 107.375) internal successors, (859), 8 states have internal predecessors, (859), 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:13:38,617 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:13:38,617 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] [2023-12-05 21:13:38,617 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:13:38,617 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting workerErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-12-05 21:13:38,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:13:38,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1032869605, now seen corresponding path program 1 times [2023-12-05 21:13:38,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:13:38,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884087982] [2023-12-05 21:13:38,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:38,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:13:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:13:38,808 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:13:38,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:13:38,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884087982] [2023-12-05 21:13:38,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884087982] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:13:38,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:13:38,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-05 21:13:38,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863271944] [2023-12-05 21:13:38,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:13:38,809 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-05 21:13:38,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:13:38,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-05 21:13:38,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-12-05 21:13:38,811 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 172 [2023-12-05 21:13:38,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 213 transitions, 2191 flow. Second operand has 12 states, 12 states have (on average 99.41666666666667) internal successors, (1193), 12 states have internal predecessors, (1193), 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:13:38,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:13:38,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 172 [2023-12-05 21:13:38,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:13:39,114 INFO L124 PetriNetUnfolderBase]: 226/1023 cut-off events. [2023-12-05 21:13:39,114 INFO L125 PetriNetUnfolderBase]: For 7159/7281 co-relation queries the response was YES. [2023-12-05 21:13:39,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4029 conditions, 1023 events. 226/1023 cut-off events. For 7159/7281 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 7090 event pairs, 21 based on Foata normal form. 53/1018 useless extension candidates. Maximal degree in co-relation 3810. Up to 227 conditions per place. [2023-12-05 21:13:39,121 INFO L140 encePairwiseOnDemand]: 153/172 looper letters, 108 selfloop transitions, 24 changer transitions 0/219 dead transitions. [2023-12-05 21:13:39,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 219 transitions, 2483 flow [2023-12-05 21:13:39,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-05 21:13:39,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-05 21:13:39,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1062 transitions. [2023-12-05 21:13:39,124 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6174418604651163 [2023-12-05 21:13:39,124 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1062 transitions. [2023-12-05 21:13:39,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1062 transitions. [2023-12-05 21:13:39,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:13:39,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1062 transitions. [2023-12-05 21:13:39,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 106.2) internal successors, (1062), 10 states have internal predecessors, (1062), 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:13:39,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 172.0) internal successors, (1892), 11 states have internal predecessors, (1892), 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:13:39,128 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 172.0) internal successors, (1892), 11 states have internal predecessors, (1892), 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:13:39,128 INFO L308 CegarLoopForPetriNet]: 163 programPoint places, 29 predicate places. [2023-12-05 21:13:39,129 INFO L500 AbstractCegarLoop]: Abstraction has has 192 places, 219 transitions, 2483 flow [2023-12-05 21:13:39,129 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 99.41666666666667) internal successors, (1193), 12 states have internal predecessors, (1193), 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:13:39,129 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:13:39,129 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:13:39,129 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:13:39,130 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting workerErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-12-05 21:13:39,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:13:39,130 INFO L85 PathProgramCache]: Analyzing trace with hash -488159169, now seen corresponding path program 1 times [2023-12-05 21:13:39,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:13:39,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470882591] [2023-12-05 21:13:39,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:39,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:13:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:13:39,319 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:13:39,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:13:39,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470882591] [2023-12-05 21:13:39,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470882591] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:13:39,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:13:39,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-05 21:13:39,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565869082] [2023-12-05 21:13:39,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:13:39,320 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-05 21:13:39,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:13:39,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-05 21:13:39,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-12-05 21:13:39,321 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 172 [2023-12-05 21:13:39,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 219 transitions, 2483 flow. Second operand has 12 states, 12 states have (on average 99.5) internal successors, (1194), 12 states have internal predecessors, (1194), 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:13:39,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:13:39,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 172 [2023-12-05 21:13:39,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:13:39,667 INFO L124 PetriNetUnfolderBase]: 229/1078 cut-off events. [2023-12-05 21:13:39,667 INFO L125 PetriNetUnfolderBase]: For 8685/8758 co-relation queries the response was YES. [2023-12-05 21:13:39,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4535 conditions, 1078 events. 229/1078 cut-off events. For 8685/8758 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 7654 event pairs, 16 based on Foata normal form. 27/1042 useless extension candidates. Maximal degree in co-relation 4292. Up to 231 conditions per place. [2023-12-05 21:13:39,672 INFO L140 encePairwiseOnDemand]: 152/172 looper letters, 0 selfloop transitions, 0 changer transitions 226/226 dead transitions. [2023-12-05 21:13:39,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 226 transitions, 2857 flow [2023-12-05 21:13:39,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-05 21:13:39,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-12-05 21:13:39,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1166 transitions. [2023-12-05 21:13:39,675 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6162790697674418 [2023-12-05 21:13:39,675 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1166 transitions. [2023-12-05 21:13:39,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1166 transitions. [2023-12-05 21:13:39,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:13:39,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1166 transitions. [2023-12-05 21:13:39,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 106.0) internal successors, (1166), 11 states have internal predecessors, (1166), 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:13:39,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 172.0) internal successors, (2064), 12 states have internal predecessors, (2064), 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:13:39,680 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 172.0) internal successors, (2064), 12 states have internal predecessors, (2064), 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:13:39,681 INFO L308 CegarLoopForPetriNet]: 163 programPoint places, 38 predicate places. [2023-12-05 21:13:39,681 INFO L500 AbstractCegarLoop]: Abstraction has has 201 places, 226 transitions, 2857 flow [2023-12-05 21:13:39,681 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 99.5) internal successors, (1194), 12 states have internal predecessors, (1194), 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:13:39,686 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i_BEv2_AllErrorsAtOnce [2023-12-05 21:13:39,727 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 35 remaining) [2023-12-05 21:13:39,727 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 35 remaining) [2023-12-05 21:13:39,727 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 35 remaining) [2023-12-05 21:13:39,727 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 35 remaining) [2023-12-05 21:13:39,727 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 35 remaining) [2023-12-05 21:13:39,727 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 35 remaining) [2023-12-05 21:13:39,727 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 35 remaining) [2023-12-05 21:13:39,728 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 35 remaining) [2023-12-05 21:13:39,728 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 35 remaining) [2023-12-05 21:13:39,728 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 35 remaining) [2023-12-05 21:13:39,728 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 35 remaining) [2023-12-05 21:13:39,728 INFO L810 garLoopResultBuilder]: Registering result SAFE for location workerErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 35 remaining) [2023-12-05 21:13:39,728 INFO L810 garLoopResultBuilder]: Registering result SAFE for location workerErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 35 remaining) [2023-12-05 21:13:39,728 INFO L810 garLoopResultBuilder]: Registering result SAFE for location workerErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 35 remaining) [2023-12-05 21:13:39,728 INFO L810 garLoopResultBuilder]: Registering result SAFE for location workerErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 35 remaining) [2023-12-05 21:13:39,728 INFO L810 garLoopResultBuilder]: Registering result SAFE for location workerErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 35 remaining) [2023-12-05 21:13:39,728 INFO L810 garLoopResultBuilder]: Registering result SAFE for location workerErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 35 remaining) [2023-12-05 21:13:39,728 INFO L810 garLoopResultBuilder]: Registering result SAFE for location workerErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 35 remaining) [2023-12-05 21:13:39,728 INFO L810 garLoopResultBuilder]: Registering result SAFE for location workerErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 35 remaining) [2023-12-05 21:13:39,729 INFO L810 garLoopResultBuilder]: Registering result SAFE for location workerErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 35 remaining) [2023-12-05 21:13:39,729 INFO L810 garLoopResultBuilder]: Registering result SAFE for location workerErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 35 remaining) [2023-12-05 21:13:39,729 INFO L810 garLoopResultBuilder]: Registering result SAFE for location workerErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 35 remaining) [2023-12-05 21:13:39,729 INFO L810 garLoopResultBuilder]: Registering result SAFE for location workerErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 35 remaining) [2023-12-05 21:13:39,729 INFO L810 garLoopResultBuilder]: Registering result SAFE for location workerErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 35 remaining) [2023-12-05 21:13:39,729 INFO L810 garLoopResultBuilder]: Registering result SAFE for location workerErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 35 remaining) [2023-12-05 21:13:39,729 INFO L810 garLoopResultBuilder]: Registering result SAFE for location workerErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 35 remaining) [2023-12-05 21:13:39,729 INFO L810 garLoopResultBuilder]: Registering result SAFE for location workerErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 35 remaining) [2023-12-05 21:13:39,729 INFO L810 garLoopResultBuilder]: Registering result SAFE for location workerErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 35 remaining) [2023-12-05 21:13:39,729 INFO L810 garLoopResultBuilder]: Registering result SAFE for location workerErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 35 remaining) [2023-12-05 21:13:39,729 INFO L810 garLoopResultBuilder]: Registering result SAFE for location workerErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 35 remaining) [2023-12-05 21:13:39,729 INFO L810 garLoopResultBuilder]: Registering result SAFE for location workerErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 35 remaining) [2023-12-05 21:13:39,730 INFO L810 garLoopResultBuilder]: Registering result SAFE for location workerErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 35 remaining) [2023-12-05 21:13:39,730 INFO L810 garLoopResultBuilder]: Registering result SAFE for location workerErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 35 remaining) [2023-12-05 21:13:39,730 INFO L810 garLoopResultBuilder]: Registering result SAFE for location workerErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 35 remaining) [2023-12-05 21:13:39,730 INFO L810 garLoopResultBuilder]: Registering result SAFE for location workerErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 35 remaining) [2023-12-05 21:13:39,730 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:13:39,730 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:13:39,734 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:13:39,734 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:13:39,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:13:39 BasicIcfg [2023-12-05 21:13:39,746 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:13:39,748 INFO L158 Benchmark]: Toolchain (without parser) took 5789.52ms. Allocated memory was 328.2MB in the beginning and 457.2MB in the end (delta: 129.0MB). Free memory was 273.1MB in the beginning and 248.5MB in the end (delta: 24.6MB). Peak memory consumption was 152.5MB. Max. memory is 8.0GB. [2023-12-05 21:13:39,748 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 238.0MB. Free memory is still 186.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:13:39,748 INFO L158 Benchmark]: CACSL2BoogieTranslator took 363.24ms. Allocated memory is still 328.2MB. Free memory was 273.1MB in the beginning and 252.9MB in the end (delta: 20.2MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-05 21:13:39,748 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.57ms. Allocated memory is still 328.2MB. Free memory was 252.9MB in the beginning and 250.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:13:39,748 INFO L158 Benchmark]: Boogie Preprocessor took 36.07ms. Allocated memory is still 328.2MB. Free memory was 250.5MB in the beginning and 248.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:13:39,749 INFO L158 Benchmark]: RCFGBuilder took 403.47ms. Allocated memory is still 328.2MB. Free memory was 248.7MB in the beginning and 278.4MB in the end (delta: -29.7MB). Peak memory consumption was 13.1MB. Max. memory is 8.0GB. [2023-12-05 21:13:39,749 INFO L158 Benchmark]: TraceAbstraction took 4948.52ms. Allocated memory was 328.2MB in the beginning and 457.2MB in the end (delta: 129.0MB). Free memory was 277.8MB in the beginning and 248.5MB in the end (delta: 29.4MB). Peak memory consumption was 156.3MB. Max. memory is 8.0GB. [2023-12-05 21:13:39,750 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.12ms. Allocated memory is still 238.0MB. Free memory is still 186.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 363.24ms. Allocated memory is still 328.2MB. Free memory was 273.1MB in the beginning and 252.9MB in the end (delta: 20.2MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.57ms. Allocated memory is still 328.2MB. Free memory was 252.9MB in the beginning and 250.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.07ms. Allocated memory is still 328.2MB. Free memory was 250.5MB in the beginning and 248.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 403.47ms. Allocated memory is still 328.2MB. Free memory was 248.7MB in the beginning and 278.4MB in the end (delta: -29.7MB). Peak memory consumption was 13.1MB. Max. memory is 8.0GB. * TraceAbstraction took 4948.52ms. Allocated memory was 328.2MB in the beginning and 457.2MB in the end (delta: 129.0MB). Free memory was 277.8MB in the beginning and 248.5MB in the end (delta: 29.4MB). Peak memory consumption was 156.3MB. 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 - 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 3 procedures, 238 locations, 35 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: 4.8s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 981 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 981 mSDsluCounter, 439 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 296 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2231 IncrementalHoareTripleChecker+Invalid, 2305 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 143 mSDtfsCounter, 2231 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2857occurred in iteration=10, InterpolantAutomatonStates: 79, 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, 1.4s InterpolantComputationTime, 413 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 403 ConstructedInterpolants, 0 QuantifiedInterpolants, 2426 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 22 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-05 21:13:39,764 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...