./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-properties/list_search-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-properties/list_search-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b1ea7ddff382751fa0e11562333bdb4981cac7bdbf1d356a007804e7e2e5a289 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:03:55,199 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:03:55,250 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-03-04 07:03:55,257 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:03:55,257 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:03:55,278 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:03:55,278 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:03:55,278 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:03:55,279 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:03:55,279 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:03:55,279 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:03:55,280 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:03:55,280 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:03:55,280 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:03:55,280 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:03:55,281 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:03:55,281 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 07:03:55,281 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:03:55,281 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:03:55,281 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:03:55,281 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:03:55,281 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 07:03:55,281 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:03:55,281 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:03:55,281 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:03:55,281 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 07:03:55,281 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:03:55,281 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:03:55,281 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:03:55,281 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 07:03:55,282 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:03:55,282 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:03:55,282 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:03:55,282 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:03:55,282 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:03:55,282 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:03:55,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:03:55,282 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:03:55,282 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:03:55,282 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:03:55,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:03:55,282 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:03:55,282 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:03:55,282 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:03:55,282 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:03:55,283 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b1ea7ddff382751fa0e11562333bdb4981cac7bdbf1d356a007804e7e2e5a289 [2025-03-04 07:03:55,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:03:55,508 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:03:55,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:03:55,510 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:03:55,511 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:03:55,514 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list_search-2.i [2025-03-04 07:03:56,662 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3dcda62b/62126cfbb763426ab7069388d1a2fe18/FLAG43c97f6fb [2025-03-04 07:03:56,932 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:03:56,932 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_search-2.i [2025-03-04 07:03:56,943 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3dcda62b/62126cfbb763426ab7069388d1a2fe18/FLAG43c97f6fb [2025-03-04 07:03:57,237 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3dcda62b/62126cfbb763426ab7069388d1a2fe18 [2025-03-04 07:03:57,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:03:57,240 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:03:57,241 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:03:57,241 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:03:57,246 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:03:57,247 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:03:57" (1/1) ... [2025-03-04 07:03:57,248 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5654fd2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:03:57, skipping insertion in model container [2025-03-04 07:03:57,248 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:03:57" (1/1) ... [2025-03-04 07:03:57,268 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:03:57,556 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:03:57,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:03:57,569 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:03:57,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:03:57,630 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:03:57,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:03:57 WrapperNode [2025-03-04 07:03:57,632 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:03:57,632 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:03:57,633 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:03:57,633 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:03:57,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:03:57" (1/1) ... [2025-03-04 07:03:57,655 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:03:57" (1/1) ... [2025-03-04 07:03:57,671 INFO L138 Inliner]: procedures = 226, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 94 [2025-03-04 07:03:57,671 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:03:57,672 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:03:57,672 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:03:57,672 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:03:57,677 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:03:57" (1/1) ... [2025-03-04 07:03:57,678 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:03:57" (1/1) ... [2025-03-04 07:03:57,680 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:03:57" (1/1) ... [2025-03-04 07:03:57,697 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [2, 14]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2025-03-04 07:03:57,697 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:03:57" (1/1) ... [2025-03-04 07:03:57,697 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:03:57" (1/1) ... [2025-03-04 07:03:57,702 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:03:57" (1/1) ... [2025-03-04 07:03:57,703 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:03:57" (1/1) ... [2025-03-04 07:03:57,704 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:03:57" (1/1) ... [2025-03-04 07:03:57,705 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:03:57" (1/1) ... [2025-03-04 07:03:57,706 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:03:57,707 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:03:57,707 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:03:57,707 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:03:57,708 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:03:57" (1/1) ... [2025-03-04 07:03:57,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:03:57,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:03:57,734 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 07:03:57,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 07:03:57,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:03:57,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:03:57,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:03:57,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:03:57,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 07:03:57,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:03:57,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 07:03:57,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:03:57,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:03:57,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:03:57,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:03:57,754 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2025-03-04 07:03:57,754 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2025-03-04 07:03:57,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 07:03:57,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 07:03:57,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:03:57,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:03:57,861 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:03:57,862 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:03:58,009 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2025-03-04 07:03:58,009 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:03:58,016 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:03:58,016 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:03:58,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:03:58 BoogieIcfgContainer [2025-03-04 07:03:58,017 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:03:58,019 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:03:58,019 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:03:58,022 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:03:58,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:03:57" (1/3) ... [2025-03-04 07:03:58,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14a56ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:03:58, skipping insertion in model container [2025-03-04 07:03:58,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:03:57" (2/3) ... [2025-03-04 07:03:58,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14a56ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:03:58, skipping insertion in model container [2025-03-04 07:03:58,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:03:58" (3/3) ... [2025-03-04 07:03:58,026 INFO L128 eAbstractionObserver]: Analyzing ICFG list_search-2.i [2025-03-04 07:03:58,036 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:03:58,038 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG list_search-2.i that has 2 procedures, 38 locations, 1 initial locations, 4 loop locations, and 2 error locations. [2025-03-04 07:03:58,069 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:03:58,077 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@56f2d2d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:03:58,078 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-04 07:03:58,081 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 32 states have internal predecessors, (43), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 07:03:58,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 07:03:58,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:03:58,088 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:03:58,088 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:03:58,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:03:58,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1038609290, now seen corresponding path program 1 times [2025-03-04 07:03:58,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:03:58,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354698071] [2025-03-04 07:03:58,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:03:58,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:03:58,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 07:03:58,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 07:03:58,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:03:58,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:03:58,489 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 07:03:58,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:03:58,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354698071] [2025-03-04 07:03:58,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354698071] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:03:58,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081881707] [2025-03-04 07:03:58,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:03:58,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:03:58,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:03:58,493 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:03:58,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 07:03:58,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 07:03:58,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 07:03:58,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:03:58,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:03:58,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 07:03:58,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:03:58,664 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 07:03:58,665 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:03:58,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081881707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:03:58,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:03:58,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2025-03-04 07:03:58,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82152447] [2025-03-04 07:03:58,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:03:58,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 07:03:58,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:03:58,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 07:03:58,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:03:58,689 INFO L87 Difference]: Start difference. First operand has 38 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 32 states have internal predecessors, (43), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 07:03:58,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:03:58,698 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2025-03-04 07:03:58,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 07:03:58,700 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 38 [2025-03-04 07:03:58,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:03:58,704 INFO L225 Difference]: With dead ends: 37 [2025-03-04 07:03:58,704 INFO L226 Difference]: Without dead ends: 35 [2025-03-04 07:03:58,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:03:58,707 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:03:58,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:03:58,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-04 07:03:58,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-04 07:03:58,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 29 states have internal predecessors, (36), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 07:03:58,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2025-03-04 07:03:58,736 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 38 [2025-03-04 07:03:58,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:03:58,737 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2025-03-04 07:03:58,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 07:03:58,738 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2025-03-04 07:03:58,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 07:03:58,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:03:58,739 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:03:58,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 07:03:58,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 07:03:58,944 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:03:58,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:03:58,945 INFO L85 PathProgramCache]: Analyzing trace with hash 520358131, now seen corresponding path program 1 times [2025-03-04 07:03:58,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:03:58,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573263577] [2025-03-04 07:03:58,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:03:58,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:03:58,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 07:03:58,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 07:03:58,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:03:58,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:03:59,110 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 07:03:59,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:03:59,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573263577] [2025-03-04 07:03:59,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573263577] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:03:59,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19888835] [2025-03-04 07:03:59,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:03:59,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:03:59,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:03:59,114 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:03:59,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 07:03:59,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 07:03:59,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 07:03:59,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:03:59,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:03:59,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 07:03:59,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:03:59,293 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 07:03:59,294 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:03:59,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19888835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:03:59,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:03:59,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2025-03-04 07:03:59,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586311800] [2025-03-04 07:03:59,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:03:59,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:03:59,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:03:59,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:03:59,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:03:59,297 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 07:03:59,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:03:59,367 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2025-03-04 07:03:59,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:03:59,367 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2025-03-04 07:03:59,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:03:59,368 INFO L225 Difference]: With dead ends: 45 [2025-03-04 07:03:59,368 INFO L226 Difference]: Without dead ends: 45 [2025-03-04 07:03:59,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:03:59,368 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 37 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:03:59,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 109 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:03:59,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-04 07:03:59,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2025-03-04 07:03:59,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 07:03:59,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2025-03-04 07:03:59,373 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 40 [2025-03-04 07:03:59,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:03:59,373 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2025-03-04 07:03:59,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 07:03:59,373 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2025-03-04 07:03:59,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-04 07:03:59,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:03:59,374 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:03:59,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 07:03:59,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-04 07:03:59,577 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:03:59,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:03:59,577 INFO L85 PathProgramCache]: Analyzing trace with hash 99159909, now seen corresponding path program 1 times [2025-03-04 07:03:59,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:03:59,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950915720] [2025-03-04 07:03:59,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:03:59,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:03:59,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 07:03:59,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 07:03:59,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:03:59,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:03:59,826 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-04 07:03:59,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:03:59,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950915720] [2025-03-04 07:03:59,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950915720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:03:59,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:03:59,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:03:59,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757685105] [2025-03-04 07:03:59,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:03:59,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:03:59,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:03:59,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:03:59,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:03:59,829 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 07:03:59,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:03:59,893 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2025-03-04 07:03:59,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:03:59,894 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2025-03-04 07:03:59,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:03:59,895 INFO L225 Difference]: With dead ends: 45 [2025-03-04 07:03:59,895 INFO L226 Difference]: Without dead ends: 45 [2025-03-04 07:03:59,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:03:59,895 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 8 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:03:59,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 209 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:03:59,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-04 07:03:59,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-04 07:03:59,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 07:03:59,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2025-03-04 07:03:59,901 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 41 [2025-03-04 07:03:59,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:03:59,901 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2025-03-04 07:03:59,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 07:03:59,901 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2025-03-04 07:03:59,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-04 07:03:59,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:03:59,902 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:03:59,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:03:59,902 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:03:59,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:03:59,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1841970244, now seen corresponding path program 1 times [2025-03-04 07:03:59,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:03:59,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403054] [2025-03-04 07:03:59,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:03:59,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:03:59,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 07:03:59,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 07:03:59,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:03:59,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:04:00,093 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 07:04:00,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:04:00,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403054] [2025-03-04 07:04:00,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403054] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:04:00,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55110730] [2025-03-04 07:04:00,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:04:00,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:04:00,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:04:00,096 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:04:00,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 07:04:00,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 07:04:00,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 07:04:00,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:04:00,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:04:00,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 07:04:00,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:04:00,247 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 07:04:00,247 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:04:00,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55110730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:04:00,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:04:00,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 9 [2025-03-04 07:04:00,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249649954] [2025-03-04 07:04:00,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:04:00,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:04:00,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:04:00,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:04:00,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:04:00,248 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 07:04:00,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:04:00,325 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2025-03-04 07:04:00,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:04:00,326 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2025-03-04 07:04:00,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:04:00,326 INFO L225 Difference]: With dead ends: 53 [2025-03-04 07:04:00,326 INFO L226 Difference]: Without dead ends: 53 [2025-03-04 07:04:00,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:04:00,327 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 43 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:04:00,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 149 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:04:00,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-04 07:04:00,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2025-03-04 07:04:00,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 07:04:00,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2025-03-04 07:04:00,331 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 41 [2025-03-04 07:04:00,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:04:00,331 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2025-03-04 07:04:00,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 07:04:00,331 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2025-03-04 07:04:00,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 07:04:00,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:04:00,332 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:04:00,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 07:04:00,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:04:00,532 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:04:00,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:04:00,534 INFO L85 PathProgramCache]: Analyzing trace with hash -185316592, now seen corresponding path program 1 times [2025-03-04 07:04:00,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:04:00,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171169138] [2025-03-04 07:04:00,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:04:00,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:04:00,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 07:04:00,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 07:04:00,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:04:00,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:04:00,895 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 07:04:00,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:04:00,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171169138] [2025-03-04 07:04:00,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171169138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:04:00,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:04:00,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:04:00,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260243961] [2025-03-04 07:04:00,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:04:00,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:04:00,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:04:00,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:04:00,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:04:00,898 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 07:04:01,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:04:01,056 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2025-03-04 07:04:01,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:04:01,057 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2025-03-04 07:04:01,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:04:01,058 INFO L225 Difference]: With dead ends: 50 [2025-03-04 07:04:01,058 INFO L226 Difference]: Without dead ends: 50 [2025-03-04 07:04:01,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-03-04 07:04:01,059 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 26 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:04:01,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 137 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:04:01,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-04 07:04:01,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2025-03-04 07:04:01,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 41 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 07:04:01,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2025-03-04 07:04:01,065 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 44 [2025-03-04 07:04:01,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:04:01,065 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2025-03-04 07:04:01,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 07:04:01,065 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2025-03-04 07:04:01,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 07:04:01,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:04:01,066 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:04:01,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:04:01,066 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:04:01,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:04:01,066 INFO L85 PathProgramCache]: Analyzing trace with hash -2001284747, now seen corresponding path program 1 times [2025-03-04 07:04:01,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:04:01,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008524691] [2025-03-04 07:04:01,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:04:01,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:04:01,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 07:04:01,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 07:04:01,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:04:01,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:04:01,486 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 07:04:01,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:04:01,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008524691] [2025-03-04 07:04:01,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008524691] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:04:01,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333343829] [2025-03-04 07:04:01,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:04:01,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:04:01,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:04:01,488 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:04:01,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 07:04:01,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 07:04:01,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 07:04:01,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:04:01,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:04:01,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 07:04:01,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:04:01,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 07:04:01,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2025-03-04 07:04:01,761 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 07:04:01,763 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:04:01,895 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 07:04:01,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333343829] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:04:01,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:04:01,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2025-03-04 07:04:01,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180214190] [2025-03-04 07:04:01,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:04:01,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 07:04:01,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:04:01,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 07:04:01,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2025-03-04 07:04:01,897 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 20 states, 20 states have (on average 2.4) internal successors, (48), 17 states have internal predecessors, (48), 3 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 07:04:02,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:04:02,306 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2025-03-04 07:04:02,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 07:04:02,307 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 17 states have internal predecessors, (48), 3 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 44 [2025-03-04 07:04:02,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:04:02,308 INFO L225 Difference]: With dead ends: 61 [2025-03-04 07:04:02,308 INFO L226 Difference]: Without dead ends: 61 [2025-03-04 07:04:02,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=265, Invalid=1067, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 07:04:02,309 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 129 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:04:02,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 300 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:04:02,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-04 07:04:02,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 50. [2025-03-04 07:04:02,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 43 states have internal predecessors, (51), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 07:04:02,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2025-03-04 07:04:02,316 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 44 [2025-03-04 07:04:02,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:04:02,316 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2025-03-04 07:04:02,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 17 states have internal predecessors, (48), 3 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 07:04:02,317 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2025-03-04 07:04:02,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 07:04:02,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:04:02,319 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:04:02,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 07:04:02,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:04:02,523 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:04:02,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:04:02,524 INFO L85 PathProgramCache]: Analyzing trace with hash -2104238586, now seen corresponding path program 2 times [2025-03-04 07:04:02,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:04:02,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165588248] [2025-03-04 07:04:02,524 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:04:02,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:04:02,538 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-04 07:04:02,550 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 07:04:02,550 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:04:02,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:04:02,854 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 07:04:02,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:04:02,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165588248] [2025-03-04 07:04:02,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165588248] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:04:02,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509545641] [2025-03-04 07:04:02,854 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:04:02,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:04:02,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:04:02,858 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:04:02,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 07:04:02,941 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-04 07:04:02,979 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 07:04:02,979 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:04:02,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:04:02,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 07:04:02,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:04:03,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:04:03,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-04 07:04:03,160 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 07:04:03,160 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:04:03,307 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 07:04:03,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509545641] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:04:03,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:04:03,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 11] total 24 [2025-03-04 07:04:03,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463943817] [2025-03-04 07:04:03,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:04:03,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 07:04:03,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:04:03,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 07:04:03,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2025-03-04 07:04:03,310 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 24 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 22 states have internal predecessors, (55), 3 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 07:04:03,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:04:03,853 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2025-03-04 07:04:03,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 07:04:03,853 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 22 states have internal predecessors, (55), 3 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 45 [2025-03-04 07:04:03,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:04:03,854 INFO L225 Difference]: With dead ends: 65 [2025-03-04 07:04:03,854 INFO L226 Difference]: Without dead ends: 65 [2025-03-04 07:04:03,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=318, Invalid=1404, Unknown=0, NotChecked=0, Total=1722 [2025-03-04 07:04:03,856 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 189 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:04:03,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 329 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:04:03,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-04 07:04:03,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 52. [2025-03-04 07:04:03,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 45 states have internal predecessors, (53), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 07:04:03,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2025-03-04 07:04:03,863 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 45 [2025-03-04 07:04:03,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:04:03,863 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2025-03-04 07:04:03,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 22 states have internal predecessors, (55), 3 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 07:04:03,865 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2025-03-04 07:04:03,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 07:04:03,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:04:03,866 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:04:03,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 07:04:04,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:04:04,067 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:04:04,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:04:04,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1663713165, now seen corresponding path program 3 times [2025-03-04 07:04:04,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:04:04,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783902131] [2025-03-04 07:04:04,067 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:04:04,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:04:04,081 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 48 statements into 4 equivalence classes. [2025-03-04 07:04:04,099 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 41 of 48 statements. [2025-03-04 07:04:04,099 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 07:04:04,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:04:04,768 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 07:04:04,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:04:04,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783902131] [2025-03-04 07:04:04,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783902131] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:04:04,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207982742] [2025-03-04 07:04:04,768 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:04:04,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:04:04,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:04:04,771 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:04:04,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 07:04:04,859 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 48 statements into 4 equivalence classes. [2025-03-04 07:04:04,897 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 41 of 48 statements. [2025-03-04 07:04:04,897 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 07:04:04,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:04:04,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 78 conjuncts are in the unsatisfiable core [2025-03-04 07:04:04,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:04:04,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:04:04,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:04:04,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:04:05,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-03-04 07:04:05,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-03-04 07:04:05,172 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-04 07:04:05,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2025-03-04 07:04:05,187 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-04 07:04:05,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 31 [2025-03-04 07:04:05,221 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-04 07:04:05,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-04 07:04:05,733 INFO L349 Elim1Store]: treesize reduction 56, result has 63.4 percent of original size [2025-03-04 07:04:05,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 97 treesize of output 151 [2025-03-04 07:04:05,795 INFO L349 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2025-03-04 07:04:05,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 77 [2025-03-04 07:04:06,300 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 21 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 07:04:06,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:04:06,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:04:06,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2025-03-04 07:04:06,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:04:06,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2025-03-04 07:04:06,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207982742] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:04:06,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:04:06,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 25 [2025-03-04 07:04:06,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416098193] [2025-03-04 07:04:06,729 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:04:06,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 07:04:06,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:04:06,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 07:04:06,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=949, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 07:04:06,730 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 25 states, 25 states have (on average 2.08) internal successors, (52), 22 states have internal predecessors, (52), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 07:04:07,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:04:07,643 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2025-03-04 07:04:07,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 07:04:07,643 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.08) internal successors, (52), 22 states have internal predecessors, (52), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 48 [2025-03-04 07:04:07,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:04:07,644 INFO L225 Difference]: With dead ends: 64 [2025-03-04 07:04:07,644 INFO L226 Difference]: Without dead ends: 64 [2025-03-04 07:04:07,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=263, Invalid=1899, Unknown=0, NotChecked=0, Total=2162 [2025-03-04 07:04:07,646 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 99 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:04:07,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 389 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:04:07,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-04 07:04:07,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2025-03-04 07:04:07,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 45 states have (on average 1.2) internal successors, (54), 46 states have internal predecessors, (54), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 07:04:07,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2025-03-04 07:04:07,650 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 48 [2025-03-04 07:04:07,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:04:07,650 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2025-03-04 07:04:07,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.08) internal successors, (52), 22 states have internal predecessors, (52), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 07:04:07,650 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2025-03-04 07:04:07,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 07:04:07,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:04:07,651 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:04:07,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 07:04:07,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:04:07,852 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:04:07,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:04:07,853 INFO L85 PathProgramCache]: Analyzing trace with hash 289938564, now seen corresponding path program 4 times [2025-03-04 07:04:07,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:04:07,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711659254] [2025-03-04 07:04:07,853 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 07:04:07,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:04:07,868 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 49 statements into 2 equivalence classes. [2025-03-04 07:04:07,879 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 44 of 49 statements. [2025-03-04 07:04:07,879 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 07:04:07,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:04:08,695 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 25 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 07:04:08,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:04:08,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711659254] [2025-03-04 07:04:08,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711659254] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:04:08,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378562970] [2025-03-04 07:04:08,695 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 07:04:08,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:04:08,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:04:08,698 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:04:08,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 07:04:08,806 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 49 statements into 2 equivalence classes. [2025-03-04 07:04:08,849 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 44 of 49 statements. [2025-03-04 07:04:08,849 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 07:04:08,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:04:08,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-04 07:04:08,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:04:08,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:04:08,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:04:08,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2025-03-04 07:04:08,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 07:04:09,065 INFO L349 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2025-03-04 07:04:09,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 28 [2025-03-04 07:04:09,078 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2025-03-04 07:04:09,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2025-03-04 07:04:09,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-04 07:04:09,239 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-04 07:04:09,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 15 [2025-03-04 07:04:09,243 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 23 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 07:04:09,243 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:04:09,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:04:09,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2025-03-04 07:04:09,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378562970] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:04:09,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:04:09,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 24 [2025-03-04 07:04:09,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948426737] [2025-03-04 07:04:09,431 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:04:09,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 07:04:09,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:04:09,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 07:04:09,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=629, Unknown=1, NotChecked=0, Total=702 [2025-03-04 07:04:09,432 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 24 states, 24 states have (on average 2.25) internal successors, (54), 22 states have internal predecessors, (54), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 07:04:10,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:04:10,390 INFO L93 Difference]: Finished difference Result 70 states and 84 transitions. [2025-03-04 07:04:10,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 07:04:10,391 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.25) internal successors, (54), 22 states have internal predecessors, (54), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 49 [2025-03-04 07:04:10,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:04:10,391 INFO L225 Difference]: With dead ends: 70 [2025-03-04 07:04:10,391 INFO L226 Difference]: Without dead ends: 70 [2025-03-04 07:04:10,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=280, Invalid=1699, Unknown=1, NotChecked=0, Total=1980 [2025-03-04 07:04:10,392 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 163 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:04:10,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 342 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:04:10,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-04 07:04:10,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 56. [2025-03-04 07:04:10,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 49 states have internal predecessors, (58), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 07:04:10,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2025-03-04 07:04:10,396 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 49 [2025-03-04 07:04:10,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:04:10,396 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2025-03-04 07:04:10,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.25) internal successors, (54), 22 states have internal predecessors, (54), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 07:04:10,396 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2025-03-04 07:04:10,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 07:04:10,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:04:10,396 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:04:10,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 07:04:10,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:04:10,597 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:04:10,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:04:10,597 INFO L85 PathProgramCache]: Analyzing trace with hash 858599878, now seen corresponding path program 1 times [2025-03-04 07:04:10,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:04:10,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489104696] [2025-03-04 07:04:10,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:04:10,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:04:10,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 07:04:10,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 07:04:10,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:04:10,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:04:10,823 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-04 07:04:10,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:04:10,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489104696] [2025-03-04 07:04:10,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489104696] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:04:10,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058020539] [2025-03-04 07:04:10,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:04:10,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:04:10,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:04:10,826 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:04:10,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 07:04:10,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 07:04:10,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 07:04:10,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:04:10,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:04:10,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 07:04:11,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:04:11,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2025-03-04 07:04:11,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:04:11,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2025-03-04 07:04:11,123 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 07:04:11,123 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:04:11,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058020539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:04:11,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:04:11,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 15 [2025-03-04 07:04:11,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926994443] [2025-03-04 07:04:11,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:04:11,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:04:11,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:04:11,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:04:11,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:04:11,124 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 07:04:11,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:04:11,247 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2025-03-04 07:04:11,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:04:11,247 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 50 [2025-03-04 07:04:11,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:04:11,248 INFO L225 Difference]: With dead ends: 56 [2025-03-04 07:04:11,248 INFO L226 Difference]: Without dead ends: 56 [2025-03-04 07:04:11,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2025-03-04 07:04:11,249 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 16 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:04:11,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 161 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:04:11,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-04 07:04:11,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-04 07:04:11,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 48 states have (on average 1.1875) internal successors, (57), 49 states have internal predecessors, (57), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 07:04:11,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2025-03-04 07:04:11,256 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 50 [2025-03-04 07:04:11,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:04:11,257 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2025-03-04 07:04:11,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 07:04:11,257 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2025-03-04 07:04:11,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 07:04:11,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:04:11,257 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:04:11,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 07:04:11,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 07:04:11,458 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:04:11,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:04:11,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1782864889, now seen corresponding path program 1 times [2025-03-04 07:04:11,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:04:11,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795462454] [2025-03-04 07:04:11,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:04:11,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:04:11,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 07:04:11,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 07:04:11,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:04:11,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:04:12,172 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 07:04:12,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:04:12,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795462454] [2025-03-04 07:04:12,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795462454] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:04:12,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988495515] [2025-03-04 07:04:12,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:04:12,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:04:12,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:04:12,175 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:04:12,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 07:04:12,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 07:04:12,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 07:04:12,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:04:12,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:04:12,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-03-04 07:04:12,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:04:12,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:04:12,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-03-04 07:04:12,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:04:12,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:04:12,593 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-04 07:04:12,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-04 07:04:12,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-04 07:04:12,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-04 07:04:12,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-04 07:04:12,809 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 07:04:12,809 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:04:13,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988495515] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:04:13,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:04:13,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 32 [2025-03-04 07:04:13,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121242081] [2025-03-04 07:04:13,015 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:04:13,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 07:04:13,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:04:13,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 07:04:13,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1230, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 07:04:13,016 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand has 32 states, 32 states have (on average 2.0625) internal successors, (66), 30 states have internal predecessors, (66), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 07:04:13,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:04:13,470 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2025-03-04 07:04:13,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 07:04:13,470 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.0625) internal successors, (66), 30 states have internal predecessors, (66), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 52 [2025-03-04 07:04:13,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:04:13,471 INFO L225 Difference]: With dead ends: 58 [2025-03-04 07:04:13,471 INFO L226 Difference]: Without dead ends: 58 [2025-03-04 07:04:13,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=173, Invalid=1807, Unknown=0, NotChecked=0, Total=1980 [2025-03-04 07:04:13,472 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 54 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:04:13,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 389 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:04:13,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-04 07:04:13,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2025-03-04 07:04:13,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 49 states have internal predecessors, (56), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 07:04:13,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2025-03-04 07:04:13,478 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 52 [2025-03-04 07:04:13,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:04:13,478 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2025-03-04 07:04:13,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.0625) internal successors, (66), 30 states have internal predecessors, (66), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 07:04:13,479 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2025-03-04 07:04:13,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 07:04:13,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:04:13,480 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:04:13,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 07:04:13,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:04:13,681 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:04:13,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:04:13,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1040845109, now seen corresponding path program 5 times [2025-03-04 07:04:13,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:04:13,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783858911] [2025-03-04 07:04:13,682 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 07:04:13,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:04:13,694 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 52 statements into 4 equivalence classes. [2025-03-04 07:04:13,710 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 07:04:13,710 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 07:04:13,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:04:14,940 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 22 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 07:04:14,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:04:14,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783858911] [2025-03-04 07:04:14,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783858911] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:04:14,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454546221] [2025-03-04 07:04:14,941 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 07:04:14,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:04:14,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:04:14,943 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:04:14,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 07:04:15,053 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 52 statements into 4 equivalence classes. [2025-03-04 07:04:15,101 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 07:04:15,101 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 07:04:15,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:04:15,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 98 conjuncts are in the unsatisfiable core [2025-03-04 07:04:15,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:04:15,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:04:15,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:04:15,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-03-04 07:04:15,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:04:15,383 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-04 07:04:15,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2025-03-04 07:04:15,401 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2025-03-04 07:04:15,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2025-03-04 07:04:15,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-03-04 07:04:15,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-03-04 07:04:15,577 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-04 07:04:15,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2025-03-04 07:04:15,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:04:15,593 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-03-04 07:04:15,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 43 [2025-03-04 07:04:15,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:04:15,601 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2025-03-04 07:04:15,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2025-03-04 07:04:15,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:04:15,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-04 07:04:15,764 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2025-03-04 07:04:15,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 26 [2025-03-04 07:04:15,785 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 19 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 07:04:15,785 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:04:15,948 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:04:15,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2025-03-04 07:04:15,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:04:15,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2025-03-04 07:04:16,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454546221] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:04:16,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:04:16,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 39 [2025-03-04 07:04:16,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843030489] [2025-03-04 07:04:16,017 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:04:16,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-04 07:04:16,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:04:16,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-04 07:04:16,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1753, Unknown=0, NotChecked=0, Total=1892 [2025-03-04 07:04:16,018 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 39 states, 39 states have (on average 1.641025641025641) internal successors, (64), 35 states have internal predecessors, (64), 6 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2025-03-04 07:04:17,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:04:17,490 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2025-03-04 07:04:17,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 07:04:17,491 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.641025641025641) internal successors, (64), 35 states have internal predecessors, (64), 6 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 52 [2025-03-04 07:04:17,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:04:17,492 INFO L225 Difference]: With dead ends: 78 [2025-03-04 07:04:17,492 INFO L226 Difference]: Without dead ends: 78 [2025-03-04 07:04:17,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1206 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=604, Invalid=4508, Unknown=0, NotChecked=0, Total=5112 [2025-03-04 07:04:17,493 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 282 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:04:17,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 385 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:04:17,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-04 07:04:17,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 60. [2025-03-04 07:04:17,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 53 states have internal predecessors, (61), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 07:04:17,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2025-03-04 07:04:17,496 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 52 [2025-03-04 07:04:17,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:04:17,496 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2025-03-04 07:04:17,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.641025641025641) internal successors, (64), 35 states have internal predecessors, (64), 6 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2025-03-04 07:04:17,497 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2025-03-04 07:04:17,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 07:04:17,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:04:17,497 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:04:17,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 07:04:17,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 07:04:17,698 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:04:17,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:04:17,698 INFO L85 PathProgramCache]: Analyzing trace with hash -363541371, now seen corresponding path program 2 times [2025-03-04 07:04:17,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:04:17,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802801942] [2025-03-04 07:04:17,698 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:04:17,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:04:17,712 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-04 07:04:17,718 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 07:04:17,719 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:04:17,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:04:18,409 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 07:04:18,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:04:18,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802801942] [2025-03-04 07:04:18,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802801942] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:04:18,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900579381] [2025-03-04 07:04:18,409 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:04:18,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:04:18,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:04:18,411 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:04:18,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 07:04:18,514 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-04 07:04:18,549 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 07:04:18,549 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:04:18,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:04:18,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-03-04 07:04:18,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:04:18,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-03-04 07:04:18,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:04:18,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:04:18,619 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~head~0.offset 0) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (or (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_4| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse0 (select |c_#memory_int#1| .cse0))) (= .cse0 c_~head~0.base) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| .cse1) 0) 1)))) (= (select (select |c_#memory_int#1| .cse1) 0) 1)))) is different from false [2025-03-04 07:04:18,621 WARN L873 $PredicateComparison]: unable to prove that (and (= c_~head~0.offset 0) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (or (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_4| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse0 (select |c_#memory_int#1| .cse0))) (= .cse0 c_~head~0.base) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| .cse1) 0) 1)))) (= (select (select |c_#memory_int#1| .cse1) 0) 1)))) is different from true [2025-03-04 07:04:18,745 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~head~0.offset 0) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (= |c_ULTIMATE.start_search_list_~l#1.base| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)))) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (or (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_4| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse0 (select |c_#memory_int#1| .cse0))) (= .cse0 c_~head~0.base) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| .cse1) 0) 1)))) (= (select (select |c_#memory_int#1| .cse1) 0) 1)))) is different from false [2025-03-04 07:04:18,746 WARN L873 $PredicateComparison]: unable to prove that (and (= c_~head~0.offset 0) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (= |c_ULTIMATE.start_search_list_~l#1.base| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)))) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (or (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_4| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse0 (select |c_#memory_int#1| .cse0))) (= .cse0 c_~head~0.base) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| .cse1) 0) 1)))) (= (select (select |c_#memory_int#1| .cse1) 0) 1)))) is different from true [2025-03-04 07:04:18,798 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~head~0.offset 0) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (or (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_4| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse0 (select |c_#memory_int#1| .cse0))) (= .cse0 c_~head~0.base) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| .cse1) 0) 1)))) (= (select (select |c_#memory_int#1| .cse1) 0) 1))) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)) |c_ULTIMATE.start_search_list_#res#1.base|))) is different from false [2025-03-04 07:04:18,800 WARN L873 $PredicateComparison]: unable to prove that (and (= c_~head~0.offset 0) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (or (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_4| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse0 (select |c_#memory_int#1| .cse0))) (= .cse0 c_~head~0.base) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| .cse1) 0) 1)))) (= (select (select |c_#memory_int#1| .cse1) 0) 1))) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)) |c_ULTIMATE.start_search_list_#res#1.base|))) is different from true [2025-03-04 07:04:18,840 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:04:18,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2025-03-04 07:04:18,854 INFO L349 Elim1Store]: treesize reduction 3, result has 81.3 percent of original size [2025-03-04 07:04:18,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2025-03-04 07:04:18,874 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~head~0.offset 0) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)) |c_ULTIMATE.start_main_~temp~0#1.base|)) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 1) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (or (exists ((|#memory_int#1| (Array Int (Array Int Int)))) (and (= 2 (select (select |#memory_int#1| |c_ULTIMATE.start_main_~temp~0#1.base|) 0)) (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_4| |#memory_int#1|))) (and (= .cse0 c_~head~0.base) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse0 (select |#memory_int#1| .cse0))) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| .cse1) 0) 1)))))) (not (= .cse1 |c_ULTIMATE.start_main_~temp~0#1.base|)) (not (= |c_ULTIMATE.start_main_~temp~0#1.offset| 0))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0)) is different from false [2025-03-04 07:04:18,877 WARN L873 $PredicateComparison]: unable to prove that (and (= c_~head~0.offset 0) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)) |c_ULTIMATE.start_main_~temp~0#1.base|)) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 1) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (or (exists ((|#memory_int#1| (Array Int (Array Int Int)))) (and (= 2 (select (select |#memory_int#1| |c_ULTIMATE.start_main_~temp~0#1.base|) 0)) (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_4| |#memory_int#1|))) (and (= .cse0 c_~head~0.base) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse0 (select |#memory_int#1| .cse0))) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| .cse1) 0) 1)))))) (not (= .cse1 |c_ULTIMATE.start_main_~temp~0#1.base|)) (not (= |c_ULTIMATE.start_main_~temp~0#1.offset| 0))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0)) is different from true [2025-03-04 07:04:18,904 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~head~0.offset 0) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)) |c_ULTIMATE.start_main_~temp~0#1.base|)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (or (exists ((|#memory_int#1| (Array Int (Array Int Int)))) (and (= 2 (select (select |#memory_int#1| |c_ULTIMATE.start_main_~temp~0#1.base|) 0)) (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_4| |#memory_int#1|))) (and (= .cse0 c_~head~0.base) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse0 (select |#memory_int#1| .cse0))) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| .cse1) 0) 1)))))) (not (= .cse1 |c_ULTIMATE.start_main_~temp~0#1.base|)) (not (= |c_ULTIMATE.start_main_~temp~0#1.offset| 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0)) is different from false [2025-03-04 07:04:18,906 WARN L873 $PredicateComparison]: unable to prove that (and (= c_~head~0.offset 0) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)) |c_ULTIMATE.start_main_~temp~0#1.base|)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (or (exists ((|#memory_int#1| (Array Int (Array Int Int)))) (and (= 2 (select (select |#memory_int#1| |c_ULTIMATE.start_main_~temp~0#1.base|) 0)) (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_4| |#memory_int#1|))) (and (= .cse0 c_~head~0.base) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse0 (select |#memory_int#1| .cse0))) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| .cse1) 0) 1)))))) (not (= .cse1 |c_ULTIMATE.start_main_~temp~0#1.base|)) (not (= |c_ULTIMATE.start_main_~temp~0#1.offset| 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0)) is different from true [2025-03-04 07:04:18,955 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~head~0.offset 0) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (or (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)))) (and (not (= .cse0 .cse1)) (= .cse0 |c_ULTIMATE.start_delete_list_~l#1.base|)))) (and (not (= |c_ULTIMATE.start_delete_list_~l#1.offset| 0)) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)) |c_ULTIMATE.start_delete_list_~l#1.base|))) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)))) (and (= .cse2 |c_ULTIMATE.start_delete_list_~l#1.base|) (exists ((|#memory_int#1| (Array Int (Array Int Int)))) (and (= 2 (select (select |#memory_int#1| .cse2) 0)) (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int#1_BEFORE_CALL_4| |#memory_int#1|))) (and (= .cse3 c_~head~0.base) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse3 (select |#memory_int#1| .cse3))) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| .cse1) 0) 1))))))))))) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| c_~head~0.base) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.offset| 0)) is different from false [2025-03-04 07:04:18,957 WARN L873 $PredicateComparison]: unable to prove that (and (= c_~head~0.offset 0) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (or (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)))) (and (not (= .cse0 .cse1)) (= .cse0 |c_ULTIMATE.start_delete_list_~l#1.base|)))) (and (not (= |c_ULTIMATE.start_delete_list_~l#1.offset| 0)) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)) |c_ULTIMATE.start_delete_list_~l#1.base|))) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)))) (and (= .cse2 |c_ULTIMATE.start_delete_list_~l#1.base|) (exists ((|#memory_int#1| (Array Int (Array Int Int)))) (and (= 2 (select (select |#memory_int#1| .cse2) 0)) (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int#1_BEFORE_CALL_4| |#memory_int#1|))) (and (= .cse3 c_~head~0.base) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse3 (select |#memory_int#1| .cse3))) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| .cse1) 0) 1))))))))))) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| c_~head~0.base) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.offset| 0)) is different from true [2025-03-04 07:04:19,004 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (not (= |c_ULTIMATE.start_delete_list_~l#1.offset| 0)))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_delete_list_~tmp~0#1.base|) 4) 0) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_delete_list_~tmp~0#1.base|) 4))) (or (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)))) (and (not (= .cse0 .cse1)) (= .cse0 |c_ULTIMATE.start_delete_list_~l#1.base|)))) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)))) (and (= .cse2 |c_ULTIMATE.start_delete_list_~l#1.base|) (exists ((|#memory_int#1| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int#1_BEFORE_CALL_4| |#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_4| .cse1) 0) 1) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse3 (select |#memory_int#1| .cse3))) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| .cse3)))) (= 2 (select (select |#memory_int#1| .cse2) 0))))))) (and .cse4 (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)) |c_ULTIMATE.start_delete_list_~l#1.base|))))) (or .cse4 (not (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| |c_ULTIMATE.start_delete_list_~l#1.base|))) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.offset| 0))) is different from false [2025-03-04 07:04:19,006 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (not (= |c_ULTIMATE.start_delete_list_~l#1.offset| 0)))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_delete_list_~tmp~0#1.base|) 4) 0) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_delete_list_~tmp~0#1.base|) 4))) (or (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)))) (and (not (= .cse0 .cse1)) (= .cse0 |c_ULTIMATE.start_delete_list_~l#1.base|)))) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)))) (and (= .cse2 |c_ULTIMATE.start_delete_list_~l#1.base|) (exists ((|#memory_int#1| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int#1_BEFORE_CALL_4| |#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_4| .cse1) 0) 1) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse3 (select |#memory_int#1| .cse3))) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| .cse3)))) (= 2 (select (select |#memory_int#1| .cse2) 0))))))) (and .cse4 (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)) |c_ULTIMATE.start_delete_list_~l#1.base|))))) (or .cse4 (not (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| |c_ULTIMATE.start_delete_list_~l#1.base|))) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.offset| 0))) is different from true [2025-03-04 07:04:19,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:04:19,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 128 [2025-03-04 07:04:19,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-04 07:04:19,205 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_delete_list_#t~mem34#1.offset| 0) (or (not (= |c_ULTIMATE.start_delete_list_~l#1.offset| 0)) (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int))) (|#memory_int#1| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_4| |#memory_int#1|))) (and (not (= .cse0 |c_ULTIMATE.start_delete_list_~l#1.base|)) (= 2 (select (select |#memory_int#1| |c_ULTIMATE.start_delete_list_~l#1.base|) 0)) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| |c_ULTIMATE.start_delete_list_#t~mem34#1.base|) 0) 1) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse0 (select |#memory_int#1| .cse0)))))) (not (= |c_ULTIMATE.start_delete_list_~l#1.base| |c_ULTIMATE.start_delete_list_#t~mem34#1.base|)))) is different from false [2025-03-04 07:04:19,207 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_delete_list_#t~mem34#1.offset| 0) (or (not (= |c_ULTIMATE.start_delete_list_~l#1.offset| 0)) (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int))) (|#memory_int#1| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_4| |#memory_int#1|))) (and (not (= .cse0 |c_ULTIMATE.start_delete_list_~l#1.base|)) (= 2 (select (select |#memory_int#1| |c_ULTIMATE.start_delete_list_~l#1.base|) 0)) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| |c_ULTIMATE.start_delete_list_#t~mem34#1.base|) 0) 1) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse0 (select |#memory_int#1| .cse0)))))) (not (= |c_ULTIMATE.start_delete_list_~l#1.base| |c_ULTIMATE.start_delete_list_#t~mem34#1.base|)))) is different from true [2025-03-04 07:04:19,211 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 6 not checked. [2025-03-04 07:04:19,211 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:04:19,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2025-03-04 07:04:19,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900579381] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:04:19,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:04:19,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 28 [2025-03-04 07:04:19,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020548619] [2025-03-04 07:04:19,640 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:04:19,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 07:04:19,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:04:19,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 07:04:19,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=737, Unknown=17, NotChecked=488, Total=1332 [2025-03-04 07:04:19,641 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 07:04:19,842 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4))) (let ((.cse3 (= .cse1 0)) (.cse0 (select |c_#memory_int#1| .cse2))) (and (or (= (select .cse0 .cse1) 1) (and (= .cse2 c_~head~0.base) .cse3)) (= c_~head~0.offset 0) .cse3 (or (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int#1_BEFORE_CALL_4| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse4 (select |c_#memory_int#1| .cse4))) (= .cse4 c_~head~0.base) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| .cse2) 0) 1)))) (= (select .cse0 0) 1))))) is different from false [2025-03-04 07:04:19,843 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4))) (let ((.cse3 (= .cse1 0)) (.cse0 (select |c_#memory_int#1| .cse2))) (and (or (= (select .cse0 .cse1) 1) (and (= .cse2 c_~head~0.base) .cse3)) (= c_~head~0.offset 0) .cse3 (or (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int#1_BEFORE_CALL_4| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse4 (select |c_#memory_int#1| .cse4))) (= .cse4 c_~head~0.base) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| .cse2) 0) 1)))) (= (select .cse0 0) 1))))) is different from true [2025-03-04 07:04:19,846 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4))) (let ((.cse1 (= .cse3 0)) (.cse2 (select |c_#memory_int#1| .cse0))) (and (= c_~head~0.offset 0) (or (and (= .cse0 c_~head~0.base) .cse1) (not (= (select .cse2 .cse3) |c_ULTIMATE.start_search_list_~k#1|))) .cse1 (or (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int#1_BEFORE_CALL_4| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse4 (select |c_#memory_int#1| .cse4))) (= .cse4 c_~head~0.base) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| .cse0) 0) 1)))) (= (select .cse2 0) 1))))) is different from false [2025-03-04 07:04:19,847 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4))) (let ((.cse1 (= .cse3 0)) (.cse2 (select |c_#memory_int#1| .cse0))) (and (= c_~head~0.offset 0) (or (and (= .cse0 c_~head~0.base) .cse1) (not (= (select .cse2 .cse3) |c_ULTIMATE.start_search_list_~k#1|))) .cse1 (or (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int#1_BEFORE_CALL_4| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse4 (select |c_#memory_int#1| .cse4))) (= .cse4 c_~head~0.base) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| .cse0) 0) 1)))) (= (select .cse2 0) 1))))) is different from true [2025-03-04 07:04:19,849 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4))) (let ((.cse1 (= .cse3 0)) (.cse2 (select |c_#memory_int#1| .cse0))) (and (= c_~head~0.offset 0) (or (and (= .cse0 c_~head~0.base) .cse1) (not (= (select .cse2 .cse3) |c_ULTIMATE.start_search_list_~k#1|))) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (= |c_ULTIMATE.start_search_list_~l#1.base| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)))) .cse1 (or (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int#1_BEFORE_CALL_4| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse4 (select |c_#memory_int#1| .cse4))) (= .cse4 c_~head~0.base) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| .cse0) 0) 1)))) (= (select .cse2 0) 1))))) is different from false [2025-03-04 07:04:19,851 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4))) (let ((.cse1 (= .cse3 0)) (.cse2 (select |c_#memory_int#1| .cse0))) (and (= c_~head~0.offset 0) (or (and (= .cse0 c_~head~0.base) .cse1) (not (= (select .cse2 .cse3) |c_ULTIMATE.start_search_list_~k#1|))) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (= |c_ULTIMATE.start_search_list_~l#1.base| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)))) .cse1 (or (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int#1_BEFORE_CALL_4| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse4 (select |c_#memory_int#1| .cse4))) (= .cse4 c_~head~0.base) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| .cse0) 0) 1)))) (= (select .cse2 0) 1))))) is different from true [2025-03-04 07:04:19,854 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4)) (.cse5 (= .cse3 0))) (let ((.cse1 (and (= .cse0 c_~head~0.base) .cse5)) (.cse4 (select |c_#memory_int#1| .cse0))) (and (or (not (= |c_ULTIMATE.start_search_list_~l#1.base| .cse0)) .cse1 (not (let ((.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_search_list_~l#1.base|))) (= (select .cse2 .cse3) (select .cse2 |c_ULTIMATE.start_search_list_~l#1.offset|)))) |c_ULTIMATE.start_search_list_#t~short32#1|) (= c_~head~0.offset 0) (or .cse1 (not (= (select .cse4 .cse3) |c_ULTIMATE.start_search_list_~k#1|))) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (= |c_ULTIMATE.start_search_list_~l#1.base| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)))) .cse5 (or (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |v_#memory_int#1_BEFORE_CALL_4| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse6 (select |c_#memory_int#1| .cse6))) (= .cse6 c_~head~0.base) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| .cse0) 0) 1)))) (= (select .cse4 0) 1)))))) is different from false [2025-03-04 07:04:19,855 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4)) (.cse5 (= .cse3 0))) (let ((.cse1 (and (= .cse0 c_~head~0.base) .cse5)) (.cse4 (select |c_#memory_int#1| .cse0))) (and (or (not (= |c_ULTIMATE.start_search_list_~l#1.base| .cse0)) .cse1 (not (let ((.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_search_list_~l#1.base|))) (= (select .cse2 .cse3) (select .cse2 |c_ULTIMATE.start_search_list_~l#1.offset|)))) |c_ULTIMATE.start_search_list_#t~short32#1|) (= c_~head~0.offset 0) (or .cse1 (not (= (select .cse4 .cse3) |c_ULTIMATE.start_search_list_~k#1|))) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (= |c_ULTIMATE.start_search_list_~l#1.base| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)))) .cse5 (or (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |v_#memory_int#1_BEFORE_CALL_4| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse6 (select |c_#memory_int#1| .cse6))) (= .cse6 c_~head~0.base) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| .cse0) 0) 1)))) (= (select .cse4 0) 1)))))) is different from true [2025-03-04 07:04:19,858 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4))) (let ((.cse1 (= .cse3 0)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (and (= c_~head~0.offset 0) (or (not (= |c_ULTIMATE.start_search_list_~l#1.base| .cse0)) (and (= .cse0 c_~head~0.base) .cse1) (not (let ((.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_search_list_~l#1.base|))) (= (select .cse2 .cse3) (select .cse2 |c_ULTIMATE.start_search_list_~l#1.offset|))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (= |c_ULTIMATE.start_search_list_~l#1.base| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)))) .cse1 (or (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int#1_BEFORE_CALL_4| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse4 (select |c_#memory_int#1| .cse4))) (= .cse4 c_~head~0.base) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| .cse0) 0) 1)))) (= (select (select |c_#memory_int#1| .cse0) 0) 1))))) is different from false [2025-03-04 07:04:19,859 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4))) (let ((.cse1 (= .cse3 0)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (and (= c_~head~0.offset 0) (or (not (= |c_ULTIMATE.start_search_list_~l#1.base| .cse0)) (and (= .cse0 c_~head~0.base) .cse1) (not (let ((.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_search_list_~l#1.base|))) (= (select .cse2 .cse3) (select .cse2 |c_ULTIMATE.start_search_list_~l#1.offset|))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (= |c_ULTIMATE.start_search_list_~l#1.base| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)))) .cse1 (or (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int#1_BEFORE_CALL_4| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse4 (select |c_#memory_int#1| .cse4))) (= .cse4 c_~head~0.base) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| .cse0) 0) 1)))) (= (select (select |c_#memory_int#1| .cse0) 0) 1))))) is different from true [2025-03-04 07:04:19,862 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4))) (let ((.cse1 (= .cse3 0)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (and (= c_~head~0.offset 0) (or (not (= .cse0 |c_ULTIMATE.start_search_list_#res#1.base|)) (and (= .cse0 c_~head~0.base) .cse1) (not (let ((.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_search_list_#res#1.base|))) (= (select .cse2 |c_ULTIMATE.start_search_list_#res#1.offset|) (select .cse2 .cse3))))) .cse1 (or (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int#1_BEFORE_CALL_4| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse4 (select |c_#memory_int#1| .cse4))) (= .cse4 c_~head~0.base) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| .cse0) 0) 1)))) (= (select (select |c_#memory_int#1| .cse0) 0) 1)) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)) |c_ULTIMATE.start_search_list_#res#1.base|))))) is different from false [2025-03-04 07:04:19,864 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4))) (let ((.cse1 (= .cse3 0)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (and (= c_~head~0.offset 0) (or (not (= .cse0 |c_ULTIMATE.start_search_list_#res#1.base|)) (and (= .cse0 c_~head~0.base) .cse1) (not (let ((.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_search_list_#res#1.base|))) (= (select .cse2 |c_ULTIMATE.start_search_list_#res#1.offset|) (select .cse2 .cse3))))) .cse1 (or (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int#1_BEFORE_CALL_4| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse4 (select |c_#memory_int#1| .cse4))) (= .cse4 c_~head~0.base) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| .cse0) 0) 1)))) (= (select (select |c_#memory_int#1| .cse0) 0) 1)) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)) |c_ULTIMATE.start_search_list_#res#1.base|))))) is different from true [2025-03-04 07:04:19,866 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse3 (not (= .cse1 |c_ULTIMATE.start_main_~temp~0#1.base|))) (.cse2 (= .cse0 0))) (and (= c_~head~0.offset 0) (or (not (= .cse0 |c_ULTIMATE.start_main_~temp~0#1.offset|)) (and (= .cse1 c_~head~0.base) .cse2) .cse3) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)) |c_ULTIMATE.start_main_~temp~0#1.base|)) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 1) (or (exists ((|#memory_int#1| (Array Int (Array Int Int)))) (and (= 2 (select (select |#memory_int#1| |c_ULTIMATE.start_main_~temp~0#1.base|) 0)) (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int#1_BEFORE_CALL_4| |#memory_int#1|))) (and (= .cse4 c_~head~0.base) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse4 (select |#memory_int#1| .cse4))) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| .cse1) 0) 1)))))) .cse3 (not (= |c_ULTIMATE.start_main_~temp~0#1.offset| 0)))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) .cse2))) is different from false [2025-03-04 07:04:19,868 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse3 (not (= .cse1 |c_ULTIMATE.start_main_~temp~0#1.base|))) (.cse2 (= .cse0 0))) (and (= c_~head~0.offset 0) (or (not (= .cse0 |c_ULTIMATE.start_main_~temp~0#1.offset|)) (and (= .cse1 c_~head~0.base) .cse2) .cse3) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)) |c_ULTIMATE.start_main_~temp~0#1.base|)) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 1) (or (exists ((|#memory_int#1| (Array Int (Array Int Int)))) (and (= 2 (select (select |#memory_int#1| |c_ULTIMATE.start_main_~temp~0#1.base|) 0)) (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int#1_BEFORE_CALL_4| |#memory_int#1|))) (and (= .cse4 c_~head~0.base) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse4 (select |#memory_int#1| .cse4))) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| .cse1) 0) 1)))))) .cse3 (not (= |c_ULTIMATE.start_main_~temp~0#1.offset| 0)))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) .cse2))) is different from true [2025-03-04 07:04:19,872 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse3 (not (= .cse1 |c_ULTIMATE.start_main_~temp~0#1.base|))) (.cse2 (= .cse0 0))) (and (= c_~head~0.offset 0) (or (not (= .cse0 |c_ULTIMATE.start_main_~temp~0#1.offset|)) (and (= .cse1 c_~head~0.base) .cse2) .cse3) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)) |c_ULTIMATE.start_main_~temp~0#1.base|)) (or (exists ((|#memory_int#1| (Array Int (Array Int Int)))) (and (= 2 (select (select |#memory_int#1| |c_ULTIMATE.start_main_~temp~0#1.base|) 0)) (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int#1_BEFORE_CALL_4| |#memory_int#1|))) (and (= .cse4 c_~head~0.base) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse4 (select |#memory_int#1| .cse4))) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| .cse1) 0) 1)))))) .cse3 (not (= |c_ULTIMATE.start_main_~temp~0#1.offset| 0))) .cse2))) is different from false [2025-03-04 07:04:19,873 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse3 (not (= .cse1 |c_ULTIMATE.start_main_~temp~0#1.base|))) (.cse2 (= .cse0 0))) (and (= c_~head~0.offset 0) (or (not (= .cse0 |c_ULTIMATE.start_main_~temp~0#1.offset|)) (and (= .cse1 c_~head~0.base) .cse2) .cse3) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)) |c_ULTIMATE.start_main_~temp~0#1.base|)) (or (exists ((|#memory_int#1| (Array Int (Array Int Int)))) (and (= 2 (select (select |#memory_int#1| |c_ULTIMATE.start_main_~temp~0#1.base|) 0)) (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int#1_BEFORE_CALL_4| |#memory_int#1|))) (and (= .cse4 c_~head~0.base) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse4 (select |#memory_int#1| .cse4))) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| .cse1) 0) 1)))))) .cse3 (not (= |c_ULTIMATE.start_main_~temp~0#1.offset| 0))) .cse2))) is different from true [2025-03-04 07:04:19,875 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_delete_list_~tmp~0#1.base|) 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_delete_list_~tmp~0#1.base|) 4))) (or (and (= .cse0 c_~head~0.base) (= c_~head~0.offset .cse1)) (not (= |c_ULTIMATE.start_delete_list_~l#1.offset| .cse1)) (not (= .cse0 |c_ULTIMATE.start_delete_list_~l#1.base|)))) (= c_~head~0.offset 0) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (or (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)))) (and (not (= .cse2 .cse3)) (= .cse2 |c_ULTIMATE.start_delete_list_~l#1.base|)))) (and (not (= |c_ULTIMATE.start_delete_list_~l#1.offset| 0)) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)) |c_ULTIMATE.start_delete_list_~l#1.base|))) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)))) (and (= .cse4 |c_ULTIMATE.start_delete_list_~l#1.base|) (exists ((|#memory_int#1| (Array Int (Array Int Int)))) (and (= 2 (select (select |#memory_int#1| .cse4) 0)) (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_#memory_int#1_BEFORE_CALL_4| |#memory_int#1|))) (and (= .cse5 c_~head~0.base) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse5 (select |#memory_int#1| .cse5))) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| .cse3) 0) 1))))))))))) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| c_~head~0.base) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.offset| 0)) is different from false [2025-03-04 07:04:19,877 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_delete_list_~tmp~0#1.base|) 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_delete_list_~tmp~0#1.base|) 4))) (or (and (= .cse0 c_~head~0.base) (= c_~head~0.offset .cse1)) (not (= |c_ULTIMATE.start_delete_list_~l#1.offset| .cse1)) (not (= .cse0 |c_ULTIMATE.start_delete_list_~l#1.base|)))) (= c_~head~0.offset 0) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (or (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)))) (and (not (= .cse2 .cse3)) (= .cse2 |c_ULTIMATE.start_delete_list_~l#1.base|)))) (and (not (= |c_ULTIMATE.start_delete_list_~l#1.offset| 0)) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)) |c_ULTIMATE.start_delete_list_~l#1.base|))) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)))) (and (= .cse4 |c_ULTIMATE.start_delete_list_~l#1.base|) (exists ((|#memory_int#1| (Array Int (Array Int Int)))) (and (= 2 (select (select |#memory_int#1| .cse4) 0)) (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_#memory_int#1_BEFORE_CALL_4| |#memory_int#1|))) (and (= .cse5 c_~head~0.base) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse5 (select |#memory_int#1| .cse5))) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| .cse3) 0) 1))))))))))) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| c_~head~0.base) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.offset| 0)) is different from true [2025-03-04 07:04:19,880 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_delete_list_~tmp~0#1.base|) 4)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_delete_list_~tmp~0#1.base|) 4)) (.cse5 (not (= |c_ULTIMATE.start_delete_list_~l#1.offset| 0)))) (and (= .cse0 0) (or (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)))) (and (not (= .cse1 .cse2)) (= .cse1 |c_ULTIMATE.start_delete_list_~l#1.base|)))) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)))) (and (= .cse3 |c_ULTIMATE.start_delete_list_~l#1.base|) (exists ((|#memory_int#1| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int#1_BEFORE_CALL_4| |#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_4| .cse2) 0) 1) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse4 (select |#memory_int#1| .cse4))) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| .cse4)))) (= 2 (select (select |#memory_int#1| .cse3) 0))))))) (and .cse5 (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)) |c_ULTIMATE.start_delete_list_~l#1.base|)))) (or (not (= |c_ULTIMATE.start_delete_list_~l#1.offset| .cse0)) (not (= .cse2 |c_ULTIMATE.start_delete_list_~l#1.base|))) (or .cse5 (not (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| |c_ULTIMATE.start_delete_list_~l#1.base|))) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.offset| 0))) is different from false [2025-03-04 07:04:19,885 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_delete_list_~tmp~0#1.base|) 4)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_delete_list_~tmp~0#1.base|) 4)) (.cse5 (not (= |c_ULTIMATE.start_delete_list_~l#1.offset| 0)))) (and (= .cse0 0) (or (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)))) (and (not (= .cse1 .cse2)) (= .cse1 |c_ULTIMATE.start_delete_list_~l#1.base|)))) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)))) (and (= .cse3 |c_ULTIMATE.start_delete_list_~l#1.base|) (exists ((|#memory_int#1| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int#1_BEFORE_CALL_4| |#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_4| .cse2) 0) 1) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse4 (select |#memory_int#1| .cse4))) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| .cse4)))) (= 2 (select (select |#memory_int#1| .cse3) 0))))))) (and .cse5 (exists ((|v_ULTIMATE.start_search_list_~l#1.base_39| Int) (|v_ULTIMATE.start_search_list_~l#1.offset_36| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_39|) (+ |v_ULTIMATE.start_search_list_~l#1.offset_36| 4)) |c_ULTIMATE.start_delete_list_~l#1.base|)))) (or (not (= |c_ULTIMATE.start_delete_list_~l#1.offset| .cse0)) (not (= .cse2 |c_ULTIMATE.start_delete_list_~l#1.base|))) (or .cse5 (not (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| |c_ULTIMATE.start_delete_list_~l#1.base|))) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.offset| 0))) is different from true [2025-03-04 07:04:19,891 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_delete_list_~l#1.base| |c_ULTIMATE.start_delete_list_#t~mem34#1.base|)))) (and (or (not (= |c_ULTIMATE.start_delete_list_#t~mem34#1.offset| |c_ULTIMATE.start_delete_list_~l#1.offset|)) .cse0) (= |c_ULTIMATE.start_delete_list_#t~mem34#1.offset| 0) (or (not (= |c_ULTIMATE.start_delete_list_~l#1.offset| 0)) (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int))) (|#memory_int#1| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#1_BEFORE_CALL_4| |#memory_int#1|))) (and (not (= .cse1 |c_ULTIMATE.start_delete_list_~l#1.base|)) (= 2 (select (select |#memory_int#1| |c_ULTIMATE.start_delete_list_~l#1.base|) 0)) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| |c_ULTIMATE.start_delete_list_#t~mem34#1.base|) 0) 1) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse1 (select |#memory_int#1| .cse1)))))) .cse0) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.offset| 0))) is different from false [2025-03-04 07:04:19,892 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_delete_list_~l#1.base| |c_ULTIMATE.start_delete_list_#t~mem34#1.base|)))) (and (or (not (= |c_ULTIMATE.start_delete_list_#t~mem34#1.offset| |c_ULTIMATE.start_delete_list_~l#1.offset|)) .cse0) (= |c_ULTIMATE.start_delete_list_#t~mem34#1.offset| 0) (or (not (= |c_ULTIMATE.start_delete_list_~l#1.offset| 0)) (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int))) (|#memory_int#1| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#1_BEFORE_CALL_4| |#memory_int#1|))) (and (not (= .cse1 |c_ULTIMATE.start_delete_list_~l#1.base|)) (= 2 (select (select |#memory_int#1| |c_ULTIMATE.start_delete_list_~l#1.base|) 0)) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| |c_ULTIMATE.start_delete_list_#t~mem34#1.base|) 0) 1) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse1 (select |#memory_int#1| .cse1)))))) .cse0) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.offset| 0))) is different from true [2025-03-04 07:04:19,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:04:19,947 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2025-03-04 07:04:19,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 07:04:19,947 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2025-03-04 07:04:19,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:04:19,948 INFO L225 Difference]: With dead ends: 72 [2025-03-04 07:04:19,948 INFO L226 Difference]: Without dead ends: 72 [2025-03-04 07:04:19,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=139, Invalid=1020, Unknown=39, NotChecked=1558, Total=2756 [2025-03-04 07:04:19,949 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 1075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 781 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:04:19,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 364 Invalid, 1075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 289 Invalid, 0 Unknown, 781 Unchecked, 0.2s Time] [2025-03-04 07:04:19,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-04 07:04:19,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2025-03-04 07:04:19,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 63 states have internal predecessors, (73), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 07:04:19,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2025-03-04 07:04:19,951 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 56 [2025-03-04 07:04:19,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:04:19,952 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2025-03-04 07:04:19,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 07:04:19,952 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2025-03-04 07:04:19,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 07:04:19,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:04:19,952 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:04:19,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 07:04:20,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 07:04:20,153 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:04:20,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:04:20,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1834798669, now seen corresponding path program 6 times [2025-03-04 07:04:20,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:04:20,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210198299] [2025-03-04 07:04:20,153 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 07:04:20,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:04:20,166 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 5 equivalence classes. [2025-03-04 07:04:20,182 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 07:04:20,182 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-04 07:04:20,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:04:22,079 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 21 proven. 45 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:04:22,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:04:22,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210198299] [2025-03-04 07:04:22,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210198299] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:04:22,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377450267] [2025-03-04 07:04:22,079 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 07:04:22,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:04:22,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:04:22,081 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:04:22,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 07:04:22,201 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 5 equivalence classes. [2025-03-04 07:04:22,258 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 07:04:22,258 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-04 07:04:22,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:04:22,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 155 conjuncts are in the unsatisfiable core [2025-03-04 07:04:22,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:04:22,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:04:22,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-03-04 07:04:22,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:04:22,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:04:22,419 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-04 07:04:22,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2025-03-04 07:04:22,441 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2025-03-04 07:04:22,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2025-03-04 07:04:22,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-03-04 07:04:22,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-03-04 07:04:22,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:04:22,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 36 [2025-03-04 07:04:22,768 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2025-03-04 07:04:22,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 31 [2025-03-04 07:04:22,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:04:22,787 INFO L349 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2025-03-04 07:04:22,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2025-03-04 07:04:22,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:04:22,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-04 07:04:22,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-03-04 07:04:22,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-03-04 07:04:23,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:04:23,033 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-03-04 07:04:23,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 129 treesize of output 76 [2025-03-04 07:04:23,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:04:23,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:04:23,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:04:23,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2025-03-04 07:04:23,054 INFO L349 Elim1Store]: treesize reduction 37, result has 47.1 percent of original size [2025-03-04 07:04:23,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 39 [2025-03-04 07:04:23,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:04:23,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:04:23,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:04:23,069 INFO L349 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2025-03-04 07:04:23,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2025-03-04 07:04:23,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:04:23,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:04:23,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:04:23,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 10 [2025-03-04 07:04:24,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17 [2025-03-04 07:04:24,166 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 21 proven. 45 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:04:24,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:04:24,698 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:04:24,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 156 [2025-03-04 07:04:24,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:04:24,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 138 [2025-03-04 07:04:24,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377450267] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:04:24,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:04:24,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 43 [2025-03-04 07:04:24,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499311689] [2025-03-04 07:04:24,796 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:04:24,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-04 07:04:24,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:04:24,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-04 07:04:24,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2680, Unknown=0, NotChecked=0, Total=2862 [2025-03-04 07:04:24,797 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand has 43 states, 43 states have (on average 1.697674418604651) internal successors, (73), 41 states have internal predecessors, (73), 6 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2025-03-04 07:04:27,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:04:27,220 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2025-03-04 07:04:27,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 07:04:27,221 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.697674418604651) internal successors, (73), 41 states have internal predecessors, (73), 6 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 56 [2025-03-04 07:04:27,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:04:27,221 INFO L225 Difference]: With dead ends: 57 [2025-03-04 07:04:27,221 INFO L226 Difference]: Without dead ends: 57 [2025-03-04 07:04:27,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1151 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=345, Invalid=4767, Unknown=0, NotChecked=0, Total=5112 [2025-03-04 07:04:27,222 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 29 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 1280 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:04:27,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 332 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1280 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-04 07:04:27,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-04 07:04:27,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2025-03-04 07:04:27,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 07:04:27,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2025-03-04 07:04:27,225 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 56 [2025-03-04 07:04:27,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:04:27,225 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2025-03-04 07:04:27,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.697674418604651) internal successors, (73), 41 states have internal predecessors, (73), 6 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2025-03-04 07:04:27,225 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2025-03-04 07:04:27,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-04 07:04:27,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:04:27,226 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:04:27,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 07:04:27,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 07:04:27,427 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:04:27,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:04:27,427 INFO L85 PathProgramCache]: Analyzing trace with hash 560433926, now seen corresponding path program 1 times [2025-03-04 07:04:27,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:04:27,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5039936] [2025-03-04 07:04:27,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:04:27,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:04:27,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 07:04:27,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 07:04:27,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:04:27,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:04:28,261 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 21 proven. 14 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 07:04:28,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:04:28,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5039936] [2025-03-04 07:04:28,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5039936] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:04:28,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219784030] [2025-03-04 07:04:28,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:04:28,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:04:28,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:04:28,264 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:04:28,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 07:04:28,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 07:04:28,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 07:04:28,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:04:28,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:04:28,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 134 conjuncts are in the unsatisfiable core [2025-03-04 07:04:28,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:04:28,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:04:28,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2025-03-04 07:04:28,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:04:28,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:04:28,753 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2025-03-04 07:04:28,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2025-03-04 07:04:28,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-04 07:04:28,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-03-04 07:04:28,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-03-04 07:04:28,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:04:28,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 36 [2025-03-04 07:04:29,006 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2025-03-04 07:04:29,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 31 [2025-03-04 07:04:29,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:04:29,018 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2025-03-04 07:04:29,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2025-03-04 07:04:29,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:04:29,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-04 07:04:29,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2025-03-04 07:04:29,533 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 17 proven. 28 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 07:04:29,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:04:29,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:04:29,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2025-03-04 07:04:29,776 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:04:29,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2025-03-04 07:04:29,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219784030] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:04:29,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:04:29,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 45 [2025-03-04 07:04:29,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173568817] [2025-03-04 07:04:29,854 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:04:29,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-04 07:04:29,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:04:29,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-04 07:04:29,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2466, Unknown=1, NotChecked=0, Total=2652 [2025-03-04 07:04:29,855 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 45 states, 45 states have (on average 1.9111111111111112) internal successors, (86), 42 states have internal predecessors, (86), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-04 07:04:31,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:04:31,423 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2025-03-04 07:04:31,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-04 07:04:31,424 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.9111111111111112) internal successors, (86), 42 states have internal predecessors, (86), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 58 [2025-03-04 07:04:31,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:04:31,424 INFO L225 Difference]: With dead ends: 65 [2025-03-04 07:04:31,424 INFO L226 Difference]: Without dead ends: 62 [2025-03-04 07:04:31,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1471 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=506, Invalid=5655, Unknown=1, NotChecked=0, Total=6162 [2025-03-04 07:04:31,426 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 102 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 1370 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:04:31,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 356 Invalid, 1419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1370 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 07:04:31,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-04 07:04:31,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2025-03-04 07:04:31,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 45 states have internal predecessors, (49), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 07:04:31,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2025-03-04 07:04:31,429 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 58 [2025-03-04 07:04:31,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:04:31,429 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2025-03-04 07:04:31,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.9111111111111112) internal successors, (86), 42 states have internal predecessors, (86), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-04 07:04:31,429 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2025-03-04 07:04:31,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-04 07:04:31,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:04:31,430 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:04:31,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 07:04:31,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 07:04:31,630 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:04:31,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:04:31,630 INFO L85 PathProgramCache]: Analyzing trace with hash -738960839, now seen corresponding path program 2 times [2025-03-04 07:04:31,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:04:31,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969619428] [2025-03-04 07:04:31,631 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:04:31,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:04:31,643 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 61 statements into 2 equivalence classes. [2025-03-04 07:04:31,653 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 07:04:31,653 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:04:31,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:04:32,272 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 19 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 07:04:32,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:04:32,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969619428] [2025-03-04 07:04:32,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969619428] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:04:32,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194231807] [2025-03-04 07:04:32,272 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:04:32,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:04:32,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:04:32,274 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:04:32,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 07:04:32,415 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 61 statements into 2 equivalence classes. [2025-03-04 07:04:32,458 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 07:04:32,458 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:04:32,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:04:32,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-04 07:04:32,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:04:32,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:04:32,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:04:32,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:04:32,540 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-04 07:04:32,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-04 07:04:32,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-04 07:04:32,789 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:04:32,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2025-03-04 07:04:32,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-03-04 07:04:32,815 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 19 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 07:04:32,815 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:04:32,822 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1786 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_delete_list_~tmp~0#1.base| v_ArrVal_1786) c_~head~0.base) (+ c_~head~0.offset 4)) 0))) is different from false [2025-03-04 07:04:32,832 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1786 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_delete_list_~tmp~0#1.base|) (+ |c_ULTIMATE.start_delete_list_~tmp~0#1.offset| 4)) v_ArrVal_1786) c_~head~0.base) (+ c_~head~0.offset 4)) 0))) is different from false [2025-03-04 07:04:32,838 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1786 (Array Int Int))) (not (= (let ((.cse0 (+ c_~head~0.offset 4))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) .cse0) v_ArrVal_1786) c_~head~0.base) .cse0)) 0))) is different from false [2025-03-04 07:04:33,038 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:04:33,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2025-03-04 07:04:33,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2025-03-04 07:04:33,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-03-04 07:04:33,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194231807] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:04:33,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:04:33,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 30 [2025-03-04 07:04:33,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089298053] [2025-03-04 07:04:33,081 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:04:33,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 07:04:33,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:04:33,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 07:04:33,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1054, Unknown=3, NotChecked=204, Total=1406 [2025-03-04 07:04:33,082 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 30 states, 30 states have (on average 2.3666666666666667) internal successors, (71), 29 states have internal predecessors, (71), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 07:04:33,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:04:33,942 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2025-03-04 07:04:33,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-04 07:04:33,943 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.3666666666666667) internal successors, (71), 29 states have internal predecessors, (71), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2025-03-04 07:04:33,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:04:33,943 INFO L225 Difference]: With dead ends: 67 [2025-03-04 07:04:33,943 INFO L226 Difference]: Without dead ends: 67 [2025-03-04 07:04:33,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=540, Invalid=3501, Unknown=3, NotChecked=378, Total=4422 [2025-03-04 07:04:33,944 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 95 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:04:33,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 240 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:04:33,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-04 07:04:33,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 57. [2025-03-04 07:04:33,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 50 states have (on average 1.1) internal successors, (55), 50 states have internal predecessors, (55), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 07:04:33,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2025-03-04 07:04:33,946 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 61 [2025-03-04 07:04:33,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:04:33,946 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2025-03-04 07:04:33,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.3666666666666667) internal successors, (71), 29 states have internal predecessors, (71), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 07:04:33,946 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2025-03-04 07:04:33,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-04 07:04:33,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:04:33,947 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:04:33,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 07:04:34,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:04:34,147 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:04:34,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:04:34,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1432948500, now seen corresponding path program 3 times [2025-03-04 07:04:34,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:04:34,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135102594] [2025-03-04 07:04:34,148 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:04:34,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:04:34,160 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 62 statements into 4 equivalence classes. [2025-03-04 07:04:34,169 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 52 of 62 statements. [2025-03-04 07:04:34,170 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 07:04:34,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:04:35,316 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 19 proven. 19 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 07:04:35,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:04:35,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135102594] [2025-03-04 07:04:35,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135102594] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:04:35,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344907959] [2025-03-04 07:04:35,316 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:04:35,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:04:35,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:04:35,318 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:04:35,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 07:04:35,466 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 62 statements into 4 equivalence classes. [2025-03-04 07:04:35,563 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 52 of 62 statements. [2025-03-04 07:04:35,563 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 07:04:35,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:04:35,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-03-04 07:04:35,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:04:35,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:04:35,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:04:35,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:04:35,622 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-04 07:04:35,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-04 07:04:36,093 INFO L349 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2025-03-04 07:04:36,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 144 treesize of output 93 [2025-03-04 07:04:36,111 INFO L349 Elim1Store]: treesize reduction 44, result has 35.3 percent of original size [2025-03-04 07:04:36,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 129 treesize of output 108 [2025-03-04 07:04:57,586 WARN L286 SmtUtils]: Spent 20.22s on a formula simplification. DAG size of input: 2044 DAG size of output: 1964 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-03-04 07:04:57,586 INFO L349 Elim1Store]: treesize reduction 200, result has 95.8 percent of original size [2025-03-04 07:04:57,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 31 select indices, 31 select index equivalence classes, 0 disjoint index pairs (out of 465 index pairs), introduced 47 new quantified variables, introduced 465 case distinctions, treesize of input 847 treesize of output 5003 [2025-03-04 07:04:59,118 INFO L224 Elim1Store]: Index analysis took 738 ms