./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2n_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed 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-simple/dll2n_update_all.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c46cc56772f2c3f0b073640343b328fb3b128ed13803ffe5a04f6290fe624494 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 23:09:27,594 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 23:09:27,648 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-08 23:09:27,652 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 23:09:27,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 23:09:27,671 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 23:09:27,671 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 23:09:27,671 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 23:09:27,671 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 23:09:27,672 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 23:09:27,672 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 23:09:27,672 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 23:09:27,672 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 23:09:27,672 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 23:09:27,672 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 23:09:27,672 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 23:09:27,672 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 23:09:27,672 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 23:09:27,672 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 23:09:27,672 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 23:09:27,674 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 23:09:27,674 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 23:09:27,674 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 23:09:27,674 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 23:09:27,674 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 23:09:27,674 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 23:09:27,674 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 23:09:27,674 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 23:09:27,674 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 23:09:27,674 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 23:09:27,675 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 23:09:27,675 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 23:09:27,675 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 23:09:27,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 23:09:27,675 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 23:09:27,675 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 23:09:27,675 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 23:09:27,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 23:09:27,676 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 23:09:27,676 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 23:09:27,676 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 23:09:27,676 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 23:09:27,676 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> c46cc56772f2c3f0b073640343b328fb3b128ed13803ffe5a04f6290fe624494 [2025-03-08 23:09:27,935 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 23:09:27,944 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 23:09:27,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 23:09:27,947 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 23:09:27,948 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 23:09:27,949 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_update_all.i [2025-03-08 23:09:29,172 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a01a9fe53/dabb26e43429431f844d7d27b64b8730/FLAGeb0598a26 [2025-03-08 23:09:29,410 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 23:09:29,410 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_update_all.i [2025-03-08 23:09:29,419 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a01a9fe53/dabb26e43429431f844d7d27b64b8730/FLAGeb0598a26 [2025-03-08 23:09:29,429 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a01a9fe53/dabb26e43429431f844d7d27b64b8730 [2025-03-08 23:09:29,431 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 23:09:29,432 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 23:09:29,433 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 23:09:29,433 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 23:09:29,436 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 23:09:29,437 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:09:29" (1/1) ... [2025-03-08 23:09:29,437 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@203e2983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:29, skipping insertion in model container [2025-03-08 23:09:29,437 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:09:29" (1/1) ... [2025-03-08 23:09:29,465 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 23:09:29,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 23:09:29,712 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 23:09:29,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 23:09:29,781 INFO L204 MainTranslator]: Completed translation [2025-03-08 23:09:29,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:29 WrapperNode [2025-03-08 23:09:29,782 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 23:09:29,783 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 23:09:29,783 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 23:09:29,783 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 23:09:29,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:29" (1/1) ... [2025-03-08 23:09:29,801 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:29" (1/1) ... [2025-03-08 23:09:29,817 INFO L138 Inliner]: procedures = 126, calls = 28, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 102 [2025-03-08 23:09:29,819 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 23:09:29,820 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 23:09:29,820 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 23:09:29,821 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 23:09:29,826 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:29" (1/1) ... [2025-03-08 23:09:29,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:29" (1/1) ... [2025-03-08 23:09:29,831 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:29" (1/1) ... [2025-03-08 23:09:29,842 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 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-08 23:09:29,842 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:29" (1/1) ... [2025-03-08 23:09:29,843 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:29" (1/1) ... [2025-03-08 23:09:29,848 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:29" (1/1) ... [2025-03-08 23:09:29,849 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:29" (1/1) ... [2025-03-08 23:09:29,850 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:29" (1/1) ... [2025-03-08 23:09:29,850 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:29" (1/1) ... [2025-03-08 23:09:29,852 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 23:09:29,853 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 23:09:29,853 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 23:09:29,854 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 23:09:29,854 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:29" (1/1) ... [2025-03-08 23:09:29,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 23:09:29,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:09:29,878 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-08 23:09:29,880 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-08 23:09:29,895 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-03-08 23:09:29,895 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-03-08 23:09:29,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 23:09:29,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 23:09:29,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 23:09:29,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 23:09:29,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 23:09:29,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 23:09:29,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 23:09:29,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 23:09:29,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 23:09:29,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 23:09:29,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 23:09:29,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 23:09:29,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 23:09:29,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 23:09:29,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 23:09:29,998 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 23:09:29,999 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 23:09:30,020 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-03-08 23:09:30,191 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L615: havoc dll_get_data_at_#t~mem9#1; [2025-03-08 23:09:30,209 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2025-03-08 23:09:30,209 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 23:09:30,220 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 23:09:30,220 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 23:09:30,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:09:30 BoogieIcfgContainer [2025-03-08 23:09:30,220 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 23:09:30,222 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 23:09:30,222 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 23:09:30,225 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 23:09:30,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:09:29" (1/3) ... [2025-03-08 23:09:30,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e4e064e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:09:30, skipping insertion in model container [2025-03-08 23:09:30,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:29" (2/3) ... [2025-03-08 23:09:30,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e4e064e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:09:30, skipping insertion in model container [2025-03-08 23:09:30,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:09:30" (3/3) ... [2025-03-08 23:09:30,227 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2n_update_all.i [2025-03-08 23:09:30,237 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 23:09:30,238 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2n_update_all.i that has 2 procedures, 66 locations, 1 initial locations, 6 loop locations, and 23 error locations. [2025-03-08 23:09:30,262 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 23:09:30,270 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;@37444d30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 23:09:30,270 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-03-08 23:09:30,273 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 40 states have (on average 1.825) internal successors, (73), 63 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:30,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 23:09:30,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:30,278 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 23:09:30,278 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 23:09:30,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:30,283 INFO L85 PathProgramCache]: Analyzing trace with hash 106850348, now seen corresponding path program 1 times [2025-03-08 23:09:30,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:30,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087132097] [2025-03-08 23:09:30,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:30,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:30,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 23:09:30,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 23:09:30,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:30,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:30,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:09:30,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:30,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087132097] [2025-03-08 23:09:30,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087132097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:09:30,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:09:30,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:09:30,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348367115] [2025-03-08 23:09:30,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:09:30,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:09:30,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:30,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:09:30,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:09:30,456 INFO L87 Difference]: Start difference. First operand has 65 states, 40 states have (on average 1.825) internal successors, (73), 63 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:30,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:30,517 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2025-03-08 23:09:30,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:09:30,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-08 23:09:30,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:30,523 INFO L225 Difference]: With dead ends: 61 [2025-03-08 23:09:30,523 INFO L226 Difference]: Without dead ends: 56 [2025-03-08 23:09:30,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:09:30,526 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 9 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:30,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 92 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:09:30,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-08 23:09:30,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-08 23:09:30,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 36 states have (on average 1.7222222222222223) internal successors, (62), 55 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:30,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2025-03-08 23:09:30,548 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 5 [2025-03-08 23:09:30,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:30,549 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2025-03-08 23:09:30,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:30,549 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2025-03-08 23:09:30,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 23:09:30,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:30,550 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 23:09:30,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 23:09:30,550 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 23:09:30,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:30,551 INFO L85 PathProgramCache]: Analyzing trace with hash 106850349, now seen corresponding path program 1 times [2025-03-08 23:09:30,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:30,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155080221] [2025-03-08 23:09:30,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:30,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:30,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 23:09:30,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 23:09:30,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:30,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:30,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:09:30,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:30,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155080221] [2025-03-08 23:09:30,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155080221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:09:30,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:09:30,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:09:30,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106065280] [2025-03-08 23:09:30,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:09:30,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:09:30,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:30,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:09:30,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:09:30,659 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:30,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:30,703 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2025-03-08 23:09:30,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:09:30,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-08 23:09:30,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:30,704 INFO L225 Difference]: With dead ends: 53 [2025-03-08 23:09:30,705 INFO L226 Difference]: Without dead ends: 53 [2025-03-08 23:09:30,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:09:30,705 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 8 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:30,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 87 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:09:30,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-08 23:09:30,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-08 23:09:30,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 52 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:30,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2025-03-08 23:09:30,711 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 5 [2025-03-08 23:09:30,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:30,712 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2025-03-08 23:09:30,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:30,712 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2025-03-08 23:09:30,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 23:09:30,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:30,712 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:30,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 23:09:30,712 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 23:09:30,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:30,714 INFO L85 PathProgramCache]: Analyzing trace with hash -414187942, now seen corresponding path program 1 times [2025-03-08 23:09:30,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:30,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551140629] [2025-03-08 23:09:30,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:30,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:30,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 23:09:30,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 23:09:30,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:30,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:30,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:09:30,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:30,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551140629] [2025-03-08 23:09:30,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551140629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:09:30,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:09:30,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:09:30,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530761322] [2025-03-08 23:09:30,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:09:30,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:09:30,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:30,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:09:30,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:09:30,760 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:30,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:30,779 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2025-03-08 23:09:30,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:09:30,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-08 23:09:30,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:30,783 INFO L225 Difference]: With dead ends: 63 [2025-03-08 23:09:30,783 INFO L226 Difference]: Without dead ends: 63 [2025-03-08 23:09:30,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:09:30,784 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 10 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:30,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 111 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:09:30,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-08 23:09:30,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2025-03-08 23:09:30,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 53 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:30,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2025-03-08 23:09:30,792 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 7 [2025-03-08 23:09:30,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:30,792 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2025-03-08 23:09:30,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:30,793 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2025-03-08 23:09:30,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 23:09:30,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:30,793 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:30,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 23:09:30,793 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 23:09:30,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:30,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1667868806, now seen corresponding path program 1 times [2025-03-08 23:09:30,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:30,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117179460] [2025-03-08 23:09:30,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:30,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:30,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 23:09:30,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 23:09:30,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:30,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:30,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:09:30,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:30,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117179460] [2025-03-08 23:09:30,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117179460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:09:30,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:09:30,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:09:30,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722076408] [2025-03-08 23:09:30,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:09:30,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:09:30,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:30,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:09:30,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:09:30,854 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:30,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:30,874 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2025-03-08 23:09:30,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:09:30,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-08 23:09:30,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:30,877 INFO L225 Difference]: With dead ends: 59 [2025-03-08 23:09:30,877 INFO L226 Difference]: Without dead ends: 59 [2025-03-08 23:09:30,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:09:30,878 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:30,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:09:30,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-08 23:09:30,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-08 23:09:30,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 58 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:30,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2025-03-08 23:09:30,884 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 9 [2025-03-08 23:09:30,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:30,884 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2025-03-08 23:09:30,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:30,885 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2025-03-08 23:09:30,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 23:09:30,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:30,885 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:30,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 23:09:30,885 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 23:09:30,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:30,886 INFO L85 PathProgramCache]: Analyzing trace with hash 503091607, now seen corresponding path program 1 times [2025-03-08 23:09:30,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:30,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011961470] [2025-03-08 23:09:30,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:30,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:30,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 23:09:30,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 23:09:30,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:30,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:30,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:09:30,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:30,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011961470] [2025-03-08 23:09:30,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011961470] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:30,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616305110] [2025-03-08 23:09:30,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:30,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:30,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:09:30,995 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-08 23:09:30,997 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-08 23:09:31,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 23:09:31,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 23:09:31,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:31,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:31,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 23:09:31,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:09:31,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:09:31,142 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:09:31,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:09:31,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616305110] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:09:31,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:09:31,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-03-08 23:09:31,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101656045] [2025-03-08 23:09:31,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:09:31,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 23:09:31,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:31,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 23:09:31,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:09:31,183 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:31,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:31,203 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2025-03-08 23:09:31,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 23:09:31,206 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-08 23:09:31,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:31,206 INFO L225 Difference]: With dead ends: 61 [2025-03-08 23:09:31,206 INFO L226 Difference]: Without dead ends: 61 [2025-03-08 23:09:31,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:09:31,207 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 10 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:31,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 165 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:09:31,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-08 23:09:31,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-08 23:09:31,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 60 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:31,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2025-03-08 23:09:31,213 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 14 [2025-03-08 23:09:31,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:31,213 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2025-03-08 23:09:31,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:31,213 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2025-03-08 23:09:31,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 23:09:31,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:31,214 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:31,222 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-08 23:09:31,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:31,415 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 23:09:31,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:31,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1589747581, now seen corresponding path program 1 times [2025-03-08 23:09:31,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:31,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941214238] [2025-03-08 23:09:31,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:31,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:31,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 23:09:31,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 23:09:31,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:31,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:31,576 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:09:31,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:31,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941214238] [2025-03-08 23:09:31,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941214238] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:31,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993311527] [2025-03-08 23:09:31,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:31,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:31,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:09:31,580 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-08 23:09:31,582 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-08 23:09:31,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 23:09:31,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 23:09:31,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:31,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:31,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 23:09:31,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:09:31,683 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-08 23:09:31,711 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-08 23:09:31,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2025-03-08 23:09:31,726 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:09:31,727 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:09:31,754 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:09:31,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993311527] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:09:31,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:09:31,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2025-03-08 23:09:31,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422146760] [2025-03-08 23:09:31,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:09:31,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 23:09:31,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:31,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 23:09:31,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:09:31,756 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:31,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:31,818 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2025-03-08 23:09:31,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 23:09:31,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-08 23:09:31,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:31,819 INFO L225 Difference]: With dead ends: 60 [2025-03-08 23:09:31,819 INFO L226 Difference]: Without dead ends: 60 [2025-03-08 23:09:31,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:09:31,819 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 3 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:31,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 142 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:09:31,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-08 23:09:31,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-08 23:09:31,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 44 states have (on average 1.5) internal successors, (66), 59 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:31,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2025-03-08 23:09:31,822 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 16 [2025-03-08 23:09:31,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:31,823 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2025-03-08 23:09:31,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:31,823 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2025-03-08 23:09:31,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 23:09:31,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:31,823 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:31,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 23:09:32,023 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,SelfDestructingSolverStorable5 [2025-03-08 23:09:32,024 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 23:09:32,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:32,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1589747580, now seen corresponding path program 1 times [2025-03-08 23:09:32,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:32,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408484343] [2025-03-08 23:09:32,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:32,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:32,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 23:09:32,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 23:09:32,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:32,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:32,203 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:09:32,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:32,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408484343] [2025-03-08 23:09:32,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408484343] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:32,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604363313] [2025-03-08 23:09:32,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:32,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:32,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:09:32,206 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-08 23:09:32,208 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-08 23:09:32,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 23:09:32,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 23:09:32,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:32,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:32,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 23:09:32,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:09:32,286 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-08 23:09:32,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:09:32,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-03-08 23:09:32,346 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:09:32,346 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 11 treesize of output 11 [2025-03-08 23:09:32,376 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:09:32,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:09:32,511 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 49 treesize of output 45 [2025-03-08 23:09:32,572 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:09:32,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604363313] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:09:32,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:09:32,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2025-03-08 23:09:32,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285999444] [2025-03-08 23:09:32,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:09:32,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 23:09:32,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:32,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 23:09:32,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-08 23:09:32,575 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:32,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:32,674 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2025-03-08 23:09:32,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 23:09:32,675 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-08 23:09:32,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:32,675 INFO L225 Difference]: With dead ends: 59 [2025-03-08 23:09:32,675 INFO L226 Difference]: Without dead ends: 59 [2025-03-08 23:09:32,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-08 23:09:32,676 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 24 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:32,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 185 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:09:32,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-08 23:09:32,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-08 23:09:32,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 58 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:32,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2025-03-08 23:09:32,678 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 16 [2025-03-08 23:09:32,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:32,679 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2025-03-08 23:09:32,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:32,679 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2025-03-08 23:09:32,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 23:09:32,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:32,679 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:32,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 23:09:32,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:32,884 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 23:09:32,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:32,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1530679226, now seen corresponding path program 2 times [2025-03-08 23:09:32,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:32,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963084170] [2025-03-08 23:09:32,884 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 23:09:32,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:32,894 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-08 23:09:32,895 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 21 statements. [2025-03-08 23:09:32,896 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 23:09:32,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:32,910 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 23:09:32,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:32,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963084170] [2025-03-08 23:09:32,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963084170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:09:32,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:09:32,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 23:09:32,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494566030] [2025-03-08 23:09:32,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:09:32,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 23:09:32,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:32,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 23:09:32,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 23:09:32,912 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:32,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:32,932 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2025-03-08 23:09:32,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 23:09:32,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-08 23:09:32,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:32,933 INFO L225 Difference]: With dead ends: 81 [2025-03-08 23:09:32,933 INFO L226 Difference]: Without dead ends: 81 [2025-03-08 23:09:32,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:09:32,934 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 21 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:32,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 147 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:09:32,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-08 23:09:32,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 61. [2025-03-08 23:09:32,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 60 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:32,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2025-03-08 23:09:32,939 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 21 [2025-03-08 23:09:32,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:32,939 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2025-03-08 23:09:32,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:32,939 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2025-03-08 23:09:32,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 23:09:32,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:32,939 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:32,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 23:09:32,939 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 23:09:32,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:32,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1530679253, now seen corresponding path program 1 times [2025-03-08 23:09:32,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:32,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401180051] [2025-03-08 23:09:32,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:32,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:32,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 23:09:32,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 23:09:32,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:32,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:33,010 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:09:33,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:33,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401180051] [2025-03-08 23:09:33,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401180051] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:33,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909889572] [2025-03-08 23:09:33,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:33,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:33,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:09:33,014 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-08 23:09:33,015 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-08 23:09:33,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 23:09:33,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 23:09:33,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:33,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:33,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 23:09:33,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:09:33,106 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:09:33,107 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:09:33,124 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:09:33,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909889572] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:09:33,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:09:33,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-03-08 23:09:33,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649975224] [2025-03-08 23:09:33,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:09:33,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 23:09:33,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:33,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 23:09:33,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 23:09:33,126 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:33,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:33,153 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2025-03-08 23:09:33,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 23:09:33,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-08 23:09:33,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:33,153 INFO L225 Difference]: With dead ends: 61 [2025-03-08 23:09:33,153 INFO L226 Difference]: Without dead ends: 61 [2025-03-08 23:09:33,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:09:33,154 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 3 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:33,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 141 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:09:33,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-08 23:09:33,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-08 23:09:33,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 60 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:33,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2025-03-08 23:09:33,157 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 21 [2025-03-08 23:09:33,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:33,157 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2025-03-08 23:09:33,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:33,157 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2025-03-08 23:09:33,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 23:09:33,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:33,158 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:33,164 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-08 23:09:33,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:33,359 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 23:09:33,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:33,359 INFO L85 PathProgramCache]: Analyzing trace with hash -618382855, now seen corresponding path program 1 times [2025-03-08 23:09:33,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:33,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072416676] [2025-03-08 23:09:33,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:33,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:33,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 23:09:33,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 23:09:33,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:33,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:33,459 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 23:09:33,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:33,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072416676] [2025-03-08 23:09:33,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072416676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:09:33,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:09:33,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 23:09:33,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884869165] [2025-03-08 23:09:33,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:09:33,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 23:09:33,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:33,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 23:09:33,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 23:09:33,462 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:33,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:33,561 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2025-03-08 23:09:33,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 23:09:33,562 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-08 23:09:33,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:33,562 INFO L225 Difference]: With dead ends: 64 [2025-03-08 23:09:33,562 INFO L226 Difference]: Without dead ends: 64 [2025-03-08 23:09:33,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 23:09:33,563 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 43 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:33,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 149 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:09:33,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-08 23:09:33,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-08 23:09:33,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.489795918367347) internal successors, (73), 63 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:33,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2025-03-08 23:09:33,565 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 22 [2025-03-08 23:09:33,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:33,565 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2025-03-08 23:09:33,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:33,565 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2025-03-08 23:09:33,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 23:09:33,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:33,568 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:33,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 23:09:33,568 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 23:09:33,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:33,569 INFO L85 PathProgramCache]: Analyzing trace with hash -618382854, now seen corresponding path program 1 times [2025-03-08 23:09:33,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:33,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936862795] [2025-03-08 23:09:33,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:33,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:33,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 23:09:33,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 23:09:33,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:33,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:33,718 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:09:33,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:33,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936862795] [2025-03-08 23:09:33,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936862795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:09:33,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:09:33,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 23:09:33,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035487727] [2025-03-08 23:09:33,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:09:33,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 23:09:33,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:33,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 23:09:33,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 23:09:33,720 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:33,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:33,817 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2025-03-08 23:09:33,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 23:09:33,818 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-08 23:09:33,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:33,818 INFO L225 Difference]: With dead ends: 64 [2025-03-08 23:09:33,818 INFO L226 Difference]: Without dead ends: 64 [2025-03-08 23:09:33,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 23:09:33,819 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 40 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:33,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 173 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:09:33,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-08 23:09:33,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-08 23:09:33,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 63 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:33,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2025-03-08 23:09:33,821 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 22 [2025-03-08 23:09:33,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:33,821 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2025-03-08 23:09:33,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:33,821 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2025-03-08 23:09:33,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 23:09:33,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:33,821 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:33,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 23:09:33,821 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 23:09:33,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:33,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1990356604, now seen corresponding path program 1 times [2025-03-08 23:09:33,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:33,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384471432] [2025-03-08 23:09:33,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:33,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:33,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 23:09:33,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 23:09:33,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:33,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:33,881 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 23:09:33,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:33,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384471432] [2025-03-08 23:09:33,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384471432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:09:33,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:09:33,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 23:09:33,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435778828] [2025-03-08 23:09:33,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:09:33,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 23:09:33,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:33,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 23:09:33,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 23:09:33,882 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:33,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:33,894 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2025-03-08 23:09:33,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 23:09:33,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-08 23:09:33,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:33,895 INFO L225 Difference]: With dead ends: 82 [2025-03-08 23:09:33,895 INFO L226 Difference]: Without dead ends: 82 [2025-03-08 23:09:33,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 23:09:33,896 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 69 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:33,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 100 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:09:33,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-08 23:09:33,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 65. [2025-03-08 23:09:33,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.42) internal successors, (71), 64 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:33,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2025-03-08 23:09:33,898 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 23 [2025-03-08 23:09:33,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:33,898 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2025-03-08 23:09:33,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:33,898 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2025-03-08 23:09:33,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 23:09:33,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:33,899 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:33,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 23:09:33,899 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 23:09:33,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:33,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1770240213, now seen corresponding path program 1 times [2025-03-08 23:09:33,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:33,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235357712] [2025-03-08 23:09:33,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:33,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:33,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 23:09:33,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 23:09:33,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:33,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:33,958 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 23:09:33,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:33,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235357712] [2025-03-08 23:09:33,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235357712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:09:33,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:09:33,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 23:09:33,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498772934] [2025-03-08 23:09:33,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:09:33,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 23:09:33,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:33,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 23:09:33,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 23:09:33,960 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:33,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:33,979 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2025-03-08 23:09:33,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 23:09:33,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-08 23:09:33,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:33,980 INFO L225 Difference]: With dead ends: 78 [2025-03-08 23:09:33,980 INFO L226 Difference]: Without dead ends: 78 [2025-03-08 23:09:33,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:09:33,981 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 14 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:33,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 150 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:09:33,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-08 23:09:33,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 66. [2025-03-08 23:09:33,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.411764705882353) internal successors, (72), 65 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:33,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2025-03-08 23:09:33,983 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 27 [2025-03-08 23:09:33,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:33,983 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2025-03-08 23:09:33,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:33,984 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2025-03-08 23:09:33,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 23:09:33,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:33,986 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:33,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 23:09:33,986 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 23:09:33,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:33,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1770240240, now seen corresponding path program 1 times [2025-03-08 23:09:33,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:33,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504160154] [2025-03-08 23:09:33,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:33,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:33,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 23:09:34,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 23:09:34,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:34,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:34,075 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 23:09:34,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:34,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504160154] [2025-03-08 23:09:34,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504160154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:09:34,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:09:34,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 23:09:34,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737132232] [2025-03-08 23:09:34,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:09:34,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 23:09:34,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:34,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 23:09:34,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 23:09:34,077 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:34,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:34,177 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2025-03-08 23:09:34,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 23:09:34,178 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-08 23:09:34,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:34,178 INFO L225 Difference]: With dead ends: 69 [2025-03-08 23:09:34,178 INFO L226 Difference]: Without dead ends: 69 [2025-03-08 23:09:34,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 23:09:34,179 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 38 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:34,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 149 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:09:34,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-08 23:09:34,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-08 23:09:34,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 68 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:34,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2025-03-08 23:09:34,181 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 27 [2025-03-08 23:09:34,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:34,181 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2025-03-08 23:09:34,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:34,181 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2025-03-08 23:09:34,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 23:09:34,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:34,181 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:34,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 23:09:34,181 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 23:09:34,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:34,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1770240241, now seen corresponding path program 1 times [2025-03-08 23:09:34,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:34,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938044638] [2025-03-08 23:09:34,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:34,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:34,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 23:09:34,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 23:09:34,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:34,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:34,252 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 23:09:34,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:34,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938044638] [2025-03-08 23:09:34,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938044638] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:34,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492611490] [2025-03-08 23:09:34,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:34,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:34,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:09:34,254 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-08 23:09:34,256 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-08 23:09:34,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 23:09:34,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 23:09:34,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:34,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:34,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 23:09:34,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:09:34,407 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 23:09:34,407 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:09:34,448 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 23:09:34,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492611490] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:09:34,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:09:34,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-08 23:09:34,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037135587] [2025-03-08 23:09:34,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:09:34,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 23:09:34,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:34,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 23:09:34,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-08 23:09:34,449 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:34,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:34,475 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2025-03-08 23:09:34,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 23:09:34,476 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-08 23:09:34,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:34,476 INFO L225 Difference]: With dead ends: 82 [2025-03-08 23:09:34,476 INFO L226 Difference]: Without dead ends: 82 [2025-03-08 23:09:34,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-08 23:09:34,477 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 58 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:34,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 229 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:09:34,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-08 23:09:34,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2025-03-08 23:09:34,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 76 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:34,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2025-03-08 23:09:34,481 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 27 [2025-03-08 23:09:34,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:34,481 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2025-03-08 23:09:34,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:34,481 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2025-03-08 23:09:34,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 23:09:34,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:34,482 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:34,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 23:09:34,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 23:09:34,682 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 23:09:34,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:34,683 INFO L85 PathProgramCache]: Analyzing trace with hash 718230867, now seen corresponding path program 1 times [2025-03-08 23:09:34,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:34,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224096957] [2025-03-08 23:09:34,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:34,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:34,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 23:09:34,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 23:09:34,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:34,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:34,773 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 23:09:34,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:34,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224096957] [2025-03-08 23:09:34,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224096957] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:34,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389177939] [2025-03-08 23:09:34,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:34,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:34,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:09:34,775 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-08 23:09:34,777 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-08 23:09:34,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 23:09:34,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 23:09:34,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:34,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:34,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 23:09:34,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:09:34,889 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 23:09:34,889 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:09:34,907 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 23:09:34,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389177939] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:09:34,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:09:34,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2025-03-08 23:09:34,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61076504] [2025-03-08 23:09:34,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:09:34,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 23:09:34,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:34,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 23:09:34,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 23:09:34,909 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:34,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:34,948 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2025-03-08 23:09:34,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 23:09:34,949 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-08 23:09:34,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:34,949 INFO L225 Difference]: With dead ends: 109 [2025-03-08 23:09:34,949 INFO L226 Difference]: Without dead ends: 109 [2025-03-08 23:09:34,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-08 23:09:34,950 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 34 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:34,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 264 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:09:34,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-08 23:09:34,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 81. [2025-03-08 23:09:34,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 80 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:34,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2025-03-08 23:09:34,952 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 29 [2025-03-08 23:09:34,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:34,952 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2025-03-08 23:09:34,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:34,952 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2025-03-08 23:09:34,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 23:09:34,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:34,953 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:34,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 23:09:35,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 23:09:35,157 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 23:09:35,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:35,157 INFO L85 PathProgramCache]: Analyzing trace with hash 718230894, now seen corresponding path program 1 times [2025-03-08 23:09:35,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:35,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397962029] [2025-03-08 23:09:35,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:35,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:35,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 23:09:35,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 23:09:35,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:35,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:35,619 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:09:35,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:35,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397962029] [2025-03-08 23:09:35,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397962029] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:35,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476865054] [2025-03-08 23:09:35,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:35,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:35,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:09:35,622 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-08 23:09:35,624 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-08 23:09:35,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 23:09:35,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 23:09:35,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:35,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:35,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-08 23:09:35,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:09:35,750 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-08 23:09:35,777 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:09:35,777 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 11 treesize of output 11 [2025-03-08 23:09:35,794 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 13 treesize of output 9 [2025-03-08 23:09:35,813 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 29 treesize of output 13 [2025-03-08 23:09:35,834 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-08 23:09:35,834 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 42 treesize of output 41 [2025-03-08 23:09:35,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:09:35,958 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 37 treesize of output 19 [2025-03-08 23:09:35,995 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 31 treesize of output 13 [2025-03-08 23:09:35,999 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:09:35,999 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:09:48,213 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-03-08 23:09:48,213 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 21 treesize of output 20 [2025-03-08 23:09:48,217 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_907 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_907) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from false [2025-03-08 23:09:48,225 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_906 Int) (v_ArrVal_907 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_906)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_907) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from false [2025-03-08 23:09:48,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:09:48,232 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 2 case distinctions, treesize of input 27 treesize of output 33 [2025-03-08 23:09:48,235 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 36 treesize of output 24 [2025-03-08 23:09:48,238 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 7 treesize of output 3 [2025-03-08 23:09:48,291 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2025-03-08 23:09:48,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476865054] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:09:48,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:09:48,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 32 [2025-03-08 23:09:48,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097021281] [2025-03-08 23:09:48,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:09:48,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-08 23:09:48,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:48,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-08 23:09:48,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=842, Unknown=5, NotChecked=118, Total=1056 [2025-03-08 23:09:48,293 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand has 33 states, 32 states have (on average 2.28125) internal successors, (73), 33 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:49,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:49,013 INFO L93 Difference]: Finished difference Result 130 states and 155 transitions. [2025-03-08 23:09:49,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 23:09:49,013 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.28125) internal successors, (73), 33 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-08 23:09:49,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:49,014 INFO L225 Difference]: With dead ends: 130 [2025-03-08 23:09:49,014 INFO L226 Difference]: Without dead ends: 130 [2025-03-08 23:09:49,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=207, Invalid=1518, Unknown=5, NotChecked=162, Total=1892 [2025-03-08 23:09:49,015 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 87 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 134 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:49,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 659 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 814 Invalid, 0 Unknown, 134 Unchecked, 0.4s Time] [2025-03-08 23:09:49,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-08 23:09:49,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 90. [2025-03-08 23:09:49,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 89 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:49,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 107 transitions. [2025-03-08 23:09:49,021 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 107 transitions. Word has length 29 [2025-03-08 23:09:49,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:49,021 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 107 transitions. [2025-03-08 23:09:49,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.28125) internal successors, (73), 33 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:49,022 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 107 transitions. [2025-03-08 23:09:49,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 23:09:49,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:49,023 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:49,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 23:09:49,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:49,224 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 23:09:49,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:49,224 INFO L85 PathProgramCache]: Analyzing trace with hash 718230895, now seen corresponding path program 1 times [2025-03-08 23:09:49,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:49,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948637702] [2025-03-08 23:09:49,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:49,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:49,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 23:09:49,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 23:09:49,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:49,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:49,848 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:09:49,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:49,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948637702] [2025-03-08 23:09:49,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948637702] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:49,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364572804] [2025-03-08 23:09:49,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:49,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:49,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:09:49,850 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-08 23:09:49,852 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-08 23:09:49,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 23:09:49,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 23:09:49,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:49,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:49,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-03-08 23:09:49,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:09:49,970 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-08 23:09:50,032 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:09:50,032 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 11 treesize of output 11 [2025-03-08 23:09:50,059 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 13 treesize of output 9 [2025-03-08 23:09:50,065 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 13 treesize of output 9 [2025-03-08 23:09:50,094 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 29 treesize of output 13 [2025-03-08 23:09:50,099 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 29 treesize of output 13 [2025-03-08 23:09:50,117 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-08 23:09:50,118 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 70 treesize of output 65 [2025-03-08 23:09:50,125 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 49 treesize of output 30 [2025-03-08 23:09:50,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:09:50,332 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 45 treesize of output 27 [2025-03-08 23:09:50,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:09:50,338 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 44 treesize of output 26 [2025-03-08 23:09:50,408 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 39 treesize of output 21 [2025-03-08 23:09:50,411 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 32 treesize of output 14 [2025-03-08 23:09:50,462 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:09:50,462 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:09:50,615 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1024 (Array Int Int))) (or (not (= v_ArrVal_1024 (store .cse0 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_1024 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1024) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 1)))) (forall ((v_ArrVal_1024 (Array Int Int))) (or (not (= v_ArrVal_1024 (store .cse0 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_1024 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_1026 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1024) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_1026)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))))) is different from false [2025-03-08 23:09:50,811 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:09:50,811 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 46 treesize of output 50 [2025-03-08 23:09:50,837 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1022 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1022) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_1023 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1023) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0))) (forall ((v_prenex_2 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 9))))) is different from false [2025-03-08 23:09:50,861 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse0 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1020 Int) (v_ArrVal_1022 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0 v_ArrVal_1020)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1022) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_1021 Int) (v_ArrVal_1023 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse2 .cse0 v_ArrVal_1021)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1023) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1))) (forall ((v_ArrVal_1021 Int) (v_prenex_2 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse2 .cse0 v_ArrVal_1021)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 9))))) is different from false [2025-03-08 23:09:50,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:09:50,871 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 2 case distinctions, treesize of input 27 treesize of output 33 [2025-03-08 23:09:50,873 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 36 treesize of output 24 [2025-03-08 23:09:50,875 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 7 treesize of output 3 [2025-03-08 23:09:50,882 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:09:50,882 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2025-03-08 23:09:50,885 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:09:50,887 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 22 treesize of output 10 [2025-03-08 23:09:50,891 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2025-03-08 23:09:50,892 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 1 [2025-03-08 23:09:51,003 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2025-03-08 23:09:51,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364572804] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:09:51,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:09:51,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 38 [2025-03-08 23:09:51,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572597399] [2025-03-08 23:09:51,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:09:51,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-08 23:09:51,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:51,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-08 23:09:51,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1162, Unknown=3, NotChecked=210, Total=1482 [2025-03-08 23:09:51,005 INFO L87 Difference]: Start difference. First operand 90 states and 107 transitions. Second operand has 39 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 39 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:51,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:51,835 INFO L93 Difference]: Finished difference Result 139 states and 167 transitions. [2025-03-08 23:09:51,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 23:09:51,836 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 39 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-08 23:09:51,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:51,836 INFO L225 Difference]: With dead ends: 139 [2025-03-08 23:09:51,836 INFO L226 Difference]: Without dead ends: 139 [2025-03-08 23:09:51,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=232, Invalid=1939, Unknown=3, NotChecked=276, Total=2450 [2025-03-08 23:09:51,838 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 103 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 216 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:51,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 692 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 731 Invalid, 0 Unknown, 216 Unchecked, 0.4s Time] [2025-03-08 23:09:51,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-08 23:09:51,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 97. [2025-03-08 23:09:51,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 82 states have (on average 1.4268292682926829) internal successors, (117), 96 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:51,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 117 transitions. [2025-03-08 23:09:51,840 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 117 transitions. Word has length 29 [2025-03-08 23:09:51,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:51,840 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 117 transitions. [2025-03-08 23:09:51,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 39 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:51,840 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2025-03-08 23:09:51,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 23:09:51,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:51,841 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:51,847 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-08 23:09:52,045 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,SelfDestructingSolverStorable17 [2025-03-08 23:09:52,045 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 23:09:52,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:52,046 INFO L85 PathProgramCache]: Analyzing trace with hash -500852849, now seen corresponding path program 2 times [2025-03-08 23:09:52,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:52,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700446041] [2025-03-08 23:09:52,046 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 23:09:52,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:52,055 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-08 23:09:52,062 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 23:09:52,062 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 23:09:52,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:52,258 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 23:09:52,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:52,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700446041] [2025-03-08 23:09:52,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700446041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:09:52,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:09:52,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 23:09:52,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173181260] [2025-03-08 23:09:52,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:09:52,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 23:09:52,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:52,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 23:09:52,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 23:09:52,265 INFO L87 Difference]: Start difference. First operand 97 states and 117 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:52,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:52,372 INFO L93 Difference]: Finished difference Result 97 states and 114 transitions. [2025-03-08 23:09:52,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 23:09:52,373 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-08 23:09:52,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:52,373 INFO L225 Difference]: With dead ends: 97 [2025-03-08 23:09:52,373 INFO L226 Difference]: Without dead ends: 97 [2025-03-08 23:09:52,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 23:09:52,374 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 35 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:52,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 173 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:09:52,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-08 23:09:52,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-08 23:09:52,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 96 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:52,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 114 transitions. [2025-03-08 23:09:52,376 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 114 transitions. Word has length 31 [2025-03-08 23:09:52,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:52,376 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 114 transitions. [2025-03-08 23:09:52,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:52,376 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 114 transitions. [2025-03-08 23:09:52,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 23:09:52,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:52,376 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:52,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 23:09:52,377 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 23:09:52,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:52,377 INFO L85 PathProgramCache]: Analyzing trace with hash 778656830, now seen corresponding path program 2 times [2025-03-08 23:09:52,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:52,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746339407] [2025-03-08 23:09:52,377 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 23:09:52,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:52,391 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-08 23:09:52,396 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 23:09:52,396 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 23:09:52,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:52,459 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 23:09:52,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:52,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746339407] [2025-03-08 23:09:52,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746339407] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:52,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801695434] [2025-03-08 23:09:52,459 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 23:09:52,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:52,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:09:52,465 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-08 23:09:52,467 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-08 23:09:52,560 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-08 23:09:52,591 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 23:09:52,592 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 23:09:52,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:52,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 23:09:52,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:09:52,670 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 23:09:52,670 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:09:52,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801695434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:09:52,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 23:09:52,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-03-08 23:09:52,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048272482] [2025-03-08 23:09:52,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:09:52,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 23:09:52,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:52,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 23:09:52,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-03-08 23:09:52,671 INFO L87 Difference]: Start difference. First operand 97 states and 114 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:52,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:52,693 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2025-03-08 23:09:52,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 23:09:52,694 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-08 23:09:52,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:52,694 INFO L225 Difference]: With dead ends: 78 [2025-03-08 23:09:52,694 INFO L226 Difference]: Without dead ends: 78 [2025-03-08 23:09:52,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-03-08 23:09:52,695 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 25 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:52,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 152 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:09:52,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-08 23:09:52,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 71. [2025-03-08 23:09:52,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 70 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:52,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2025-03-08 23:09:52,696 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 36 [2025-03-08 23:09:52,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:52,697 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2025-03-08 23:09:52,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:52,697 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2025-03-08 23:09:52,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 23:09:52,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:52,697 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:52,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-08 23:09:52,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:52,901 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 23:09:52,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:52,901 INFO L85 PathProgramCache]: Analyzing trace with hash 561269078, now seen corresponding path program 1 times [2025-03-08 23:09:52,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:52,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555145149] [2025-03-08 23:09:52,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:52,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:52,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 23:09:52,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 23:09:52,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:52,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:52,970 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 23:09:52,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:52,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555145149] [2025-03-08 23:09:52,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555145149] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:52,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425199150] [2025-03-08 23:09:52,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:52,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:52,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:09:52,972 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-08 23:09:52,974 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-08 23:09:53,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 23:09:53,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 23:09:53,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:53,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:53,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 23:09:53,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:09:53,131 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 23:09:53,131 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:09:53,151 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 23:09:53,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425199150] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:09:53,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:09:53,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-03-08 23:09:53,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409184261] [2025-03-08 23:09:53,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:09:53,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 23:09:53,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:53,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 23:09:53,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:09:53,153 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:53,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:53,176 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2025-03-08 23:09:53,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 23:09:53,176 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-08 23:09:53,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:53,176 INFO L225 Difference]: With dead ends: 75 [2025-03-08 23:09:53,176 INFO L226 Difference]: Without dead ends: 75 [2025-03-08 23:09:53,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-08 23:09:53,177 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 33 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:53,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 210 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:09:53,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-08 23:09:53,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2025-03-08 23:09:53,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 60 states have (on average 1.25) internal successors, (75), 70 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:53,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2025-03-08 23:09:53,178 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 37 [2025-03-08 23:09:53,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:53,178 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2025-03-08 23:09:53,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:53,178 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2025-03-08 23:09:53,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-08 23:09:53,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:53,178 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:53,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-08 23:09:53,379 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,SelfDestructingSolverStorable20 [2025-03-08 23:09:53,379 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 23:09:53,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:53,379 INFO L85 PathProgramCache]: Analyzing trace with hash 539947683, now seen corresponding path program 1 times [2025-03-08 23:09:53,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:53,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509374256] [2025-03-08 23:09:53,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:53,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:53,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 23:09:53,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 23:09:53,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:53,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:54,054 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:09:54,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:54,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509374256] [2025-03-08 23:09:54,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509374256] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:54,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492615126] [2025-03-08 23:09:54,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:54,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:54,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:09:54,056 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-08 23:09:54,057 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-08 23:09:54,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 23:09:54,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 23:09:54,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:54,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:54,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-03-08 23:09:54,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:09:54,206 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-08 23:09:54,264 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:09:54,265 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 11 treesize of output 11 [2025-03-08 23:09:54,293 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 13 treesize of output 9 [2025-03-08 23:09:54,323 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 29 treesize of output 13 [2025-03-08 23:09:54,340 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-08 23:09:54,340 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 31 treesize of output 32 [2025-03-08 23:09:54,483 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-08 23:09:54,487 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 26 treesize of output 14 [2025-03-08 23:09:54,563 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-08 23:09:54,630 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 16 treesize of output 11 [2025-03-08 23:09:54,779 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:09:54,779 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:09:54,815 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1442 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1442) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2025-03-08 23:09:54,820 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1442 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1442) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2025-03-08 23:09:54,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:09:54,902 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 32 treesize of output 33 [2025-03-08 23:09:54,910 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:09:54,910 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 58 treesize of output 61 [2025-03-08 23:09:54,913 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 23 treesize of output 21 [2025-03-08 23:09:55,124 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1437 (Array Int Int)) (v_ArrVal_1436 Int)) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1436)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1437) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) is different from false [2025-03-08 23:09:55,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:09:55,132 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 2 case distinctions, treesize of input 28 treesize of output 34 [2025-03-08 23:09:55,133 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 39 treesize of output 27 [2025-03-08 23:09:55,135 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 8 treesize of output 4 [2025-03-08 23:09:55,211 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-03-08 23:09:55,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492615126] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:09:55,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:09:55,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 58 [2025-03-08 23:09:55,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348232322] [2025-03-08 23:09:55,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:09:55,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-03-08 23:09:55,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:55,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-03-08 23:09:55,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2745, Unknown=36, NotChecked=324, Total=3306 [2025-03-08 23:09:55,213 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 58 states, 58 states have (on average 1.8103448275862069) internal successors, (105), 58 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:56,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:56,124 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2025-03-08 23:09:56,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 23:09:56,125 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 1.8103448275862069) internal successors, (105), 58 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-08 23:09:56,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:56,125 INFO L225 Difference]: With dead ends: 77 [2025-03-08 23:09:56,125 INFO L226 Difference]: Without dead ends: 77 [2025-03-08 23:09:56,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1341 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=472, Invalid=4906, Unknown=36, NotChecked=438, Total=5852 [2025-03-08 23:09:56,127 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 127 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 179 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:56,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 882 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 985 Invalid, 0 Unknown, 179 Unchecked, 0.4s Time] [2025-03-08 23:09:56,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-08 23:09:56,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2025-03-08 23:09:56,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 70 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:56,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2025-03-08 23:09:56,131 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 40 [2025-03-08 23:09:56,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:56,131 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2025-03-08 23:09:56,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 1.8103448275862069) internal successors, (105), 58 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:56,132 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2025-03-08 23:09:56,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 23:09:56,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:56,133 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:56,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-08 23:09:56,333 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,SelfDestructingSolverStorable21 [2025-03-08 23:09:56,333 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 23:09:56,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:56,334 INFO L85 PathProgramCache]: Analyzing trace with hash -586198716, now seen corresponding path program 1 times [2025-03-08 23:09:56,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:56,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342710723] [2025-03-08 23:09:56,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:56,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:56,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 23:09:56,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 23:09:56,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:56,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:56,420 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 23:09:56,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:56,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342710723] [2025-03-08 23:09:56,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342710723] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:56,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026702737] [2025-03-08 23:09:56,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:56,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:56,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:09:56,422 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-08 23:09:56,424 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-08 23:09:56,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 23:09:56,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 23:09:56,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:56,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:56,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 23:09:56,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:09:56,588 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 23:09:56,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:09:56,610 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 23:09:56,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026702737] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:09:56,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:09:56,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2025-03-08 23:09:56,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353511801] [2025-03-08 23:09:56,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:09:56,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 23:09:56,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:56,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 23:09:56,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 23:09:56,612 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:56,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:56,647 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2025-03-08 23:09:56,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 23:09:56,648 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-03-08 23:09:56,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:56,648 INFO L225 Difference]: With dead ends: 68 [2025-03-08 23:09:56,648 INFO L226 Difference]: Without dead ends: 68 [2025-03-08 23:09:56,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-08 23:09:56,649 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 23 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:56,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 209 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:09:56,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-08 23:09:56,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-08 23:09:56,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 59 states have (on average 1.1864406779661016) internal successors, (70), 67 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:56,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2025-03-08 23:09:56,650 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 43 [2025-03-08 23:09:56,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:56,651 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2025-03-08 23:09:56,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:56,651 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2025-03-08 23:09:56,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 23:09:56,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:56,651 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:56,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-08 23:09:56,851 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,SelfDestructingSolverStorable22 [2025-03-08 23:09:56,852 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 23:09:56,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:56,852 INFO L85 PathProgramCache]: Analyzing trace with hash -586198689, now seen corresponding path program 1 times [2025-03-08 23:09:56,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:56,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449267346] [2025-03-08 23:09:56,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:56,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:56,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 23:09:56,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 23:09:56,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:56,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:57,432 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 23:09:57,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:57,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449267346] [2025-03-08 23:09:57,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449267346] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:57,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204946854] [2025-03-08 23:09:57,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:57,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:57,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:09:57,434 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-08 23:09:57,434 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-08 23:09:57,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 23:09:57,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 23:09:57,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:57,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:57,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-08 23:09:57,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:09:57,579 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-08 23:09:57,601 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:09:57,601 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 11 treesize of output 11 [2025-03-08 23:09:57,616 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 13 treesize of output 9 [2025-03-08 23:09:57,642 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 29 treesize of output 13 [2025-03-08 23:09:57,654 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-08 23:09:57,654 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 42 treesize of output 41 [2025-03-08 23:09:57,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:09:57,772 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 37 treesize of output 19 [2025-03-08 23:09:57,879 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-08 23:09:57,879 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 42 treesize of output 41 [2025-03-08 23:09:57,931 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 31 treesize of output 13 [2025-03-08 23:09:57,934 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 23:09:57,935 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:09:57,986 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1682 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1682) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) 1)) is different from false [2025-03-08 23:09:58,034 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1682 (Array Int Int))) (= 1 (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1682) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) is different from false [2025-03-08 23:09:58,101 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1681 Int) (v_ArrVal_1682 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_1681)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) v_ArrVal_1682)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) 1)) is different from false [2025-03-08 23:09:58,113 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1681 Int) (v_ArrVal_1682 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_46| Int)) (or (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_46| v_ArrVal_1681)) (select .cse0 .cse1) v_ArrVal_1682)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) 1) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|))) is different from false [2025-03-08 23:09:58,122 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1681 Int) (v_ArrVal_1682 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_46| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (select (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|))) (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_46| v_ArrVal_1681)) (select .cse0 .cse1) v_ArrVal_1682)) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse1))) 1))) is different from false [2025-03-08 23:09:58,129 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1681 Int) (v_ArrVal_1682 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_46| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (select (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_46| v_ArrVal_1681)) (select .cse0 .cse1) v_ArrVal_1682)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1))) 1))) is different from false [2025-03-08 23:09:58,136 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1681 Int) (v_ArrVal_1682 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_46| Int)) (or (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (select (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_46| v_ArrVal_1681)) (select .cse0 .cse1) v_ArrVal_1682)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1))) 1) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|))) is different from false [2025-03-08 23:09:58,147 INFO L349 Elim1Store]: treesize reduction 5, result has 87.5 percent of original size [2025-03-08 23:09:58,147 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 44 treesize of output 43 [2025-03-08 23:09:59,048 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1679 (Array Int Int)) (v_ArrVal_1681 Int) (v_ArrVal_1682 (Array Int Int)) (v_ArrVal_1678 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_46| Int)) (or (= (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (select (select (let ((.cse0 (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1678)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1679) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1679) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_46| v_ArrVal_1681)) (select .cse0 .cse1) v_ArrVal_1682)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|))) is different from false [2025-03-08 23:09:59,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:09:59,061 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 70 [2025-03-08 23:09:59,064 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 105 treesize of output 97 [2025-03-08 23:09:59,067 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:09:59,069 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 86 treesize of output 74 [2025-03-08 23:09:59,072 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:09:59,073 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 79 treesize of output 63 [2025-03-08 23:09:59,078 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 14 treesize of output 10 [2025-03-08 23:09:59,133 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 9 not checked. [2025-03-08 23:09:59,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204946854] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:09:59,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:09:59,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 19] total 45 [2025-03-08 23:09:59,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028216945] [2025-03-08 23:09:59,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:09:59,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-08 23:09:59,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:59,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-08 23:09:59,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1254, Unknown=58, NotChecked=632, Total=2070 [2025-03-08 23:09:59,135 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand has 46 states, 45 states have (on average 2.577777777777778) internal successors, (116), 46 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:59,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:59,922 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2025-03-08 23:09:59,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 23:09:59,922 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.577777777777778) internal successors, (116), 46 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-03-08 23:09:59,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:59,923 INFO L225 Difference]: With dead ends: 73 [2025-03-08 23:09:59,923 INFO L226 Difference]: Without dead ends: 73 [2025-03-08 23:09:59,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=276, Invalid=2349, Unknown=59, NotChecked=856, Total=3540 [2025-03-08 23:09:59,925 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 81 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 446 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:59,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 760 Invalid, 1338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 877 Invalid, 0 Unknown, 446 Unchecked, 0.4s Time] [2025-03-08 23:09:59,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-08 23:09:59,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2025-03-08 23:09:59,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 66 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:59,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2025-03-08 23:09:59,926 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 43 [2025-03-08 23:09:59,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:59,926 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2025-03-08 23:09:59,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.577777777777778) internal successors, (116), 46 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:59,927 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2025-03-08 23:09:59,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 23:09:59,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:59,927 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:59,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-08 23:10:00,127 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,SelfDestructingSolverStorable23 [2025-03-08 23:10:00,127 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 23:10:00,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:00,128 INFO L85 PathProgramCache]: Analyzing trace with hash -586198688, now seen corresponding path program 1 times [2025-03-08 23:10:00,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:00,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268323871] [2025-03-08 23:10:00,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:00,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:00,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 23:10:00,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 23:10:00,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:00,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:00,984 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 23:10:00,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:00,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268323871] [2025-03-08 23:10:00,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268323871] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:00,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410032648] [2025-03-08 23:10:00,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:00,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:00,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:10:00,987 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-08 23:10:00,988 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-08 23:10:01,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 23:10:01,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 23:10:01,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:01,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:01,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-03-08 23:10:01,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:10:01,140 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-08 23:10:01,200 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:10:01,200 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 11 treesize of output 11 [2025-03-08 23:10:01,231 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 13 treesize of output 9 [2025-03-08 23:10:01,235 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 13 treesize of output 9 [2025-03-08 23:10:01,272 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 29 treesize of output 13 [2025-03-08 23:10:01,277 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 29 treesize of output 13 [2025-03-08 23:10:01,306 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-08 23:10:01,307 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 70 treesize of output 65 [2025-03-08 23:10:01,311 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 49 treesize of output 30 [2025-03-08 23:10:01,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:10:01,508 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 45 treesize of output 27 [2025-03-08 23:10:01,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:10:01,512 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 44 treesize of output 26 [2025-03-08 23:10:01,660 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-08 23:10:01,660 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 70 treesize of output 65 [2025-03-08 23:10:01,662 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 49 treesize of output 30 [2025-03-08 23:10:01,745 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 39 treesize of output 21 [2025-03-08 23:10:01,748 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 32 treesize of output 14 [2025-03-08 23:10:01,805 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 23:10:01,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:10:01,937 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1813 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1813) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (forall ((v_ArrVal_1813 (Array Int Int)) (v_ArrVal_1812 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1813) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1812) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)))))) is different from false [2025-03-08 23:10:02,031 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1813 (Array Int Int)) (v_ArrVal_1812 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1813) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1812) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))) (forall ((v_ArrVal_1813 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1813) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))) is different from false [2025-03-08 23:10:02,137 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_1809 (Array Int Int))) (or (forall ((v_ArrVal_1813 (Array Int Int)) (v_ArrVal_1810 Int)) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1809) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store .cse0 |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_1810)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) v_ArrVal_1813) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (not (= (store .cse2 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_1809 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_1809)))) (forall ((v_ArrVal_1809 (Array Int Int))) (or (forall ((v_ArrVal_1813 (Array Int Int)) (v_ArrVal_1812 (Array Int Int)) (v_ArrVal_1810 Int)) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store .cse0 |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_1810)))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1809) .cse3 v_ArrVal_1813) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_1812) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))) (not (= (store .cse2 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_1809 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_1809)))))) is different from false [2025-03-08 23:10:02,177 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse1 (select .cse3 .cse2))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_53| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_53|) (forall ((v_ArrVal_1809 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_53| (select v_ArrVal_1809 |v_ULTIMATE.start_dll_update_at_~head#1.offset_53|)) v_ArrVal_1809)) (forall ((v_ArrVal_1813 (Array Int Int)) (v_ArrVal_1812 (Array Int Int)) (v_ArrVal_1810 Int)) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1809) .cse1 v_ArrVal_1813) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_53| v_ArrVal_1810)) .cse1 v_ArrVal_1812) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)))))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_53| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_53|) (forall ((v_ArrVal_1809 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_53| (select v_ArrVal_1809 |v_ULTIMATE.start_dll_update_at_~head#1.offset_53|)) v_ArrVal_1809)) (forall ((v_ArrVal_1813 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1809) .cse1 v_ArrVal_1813) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)))))))))) is different from false [2025-03-08 23:10:02,198 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse1 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (let ((.cse0 (select .cse2 .cse1)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_53| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_53|) (forall ((v_ArrVal_1809 (Array Int Int))) (or (forall ((v_ArrVal_1813 (Array Int Int)) (v_ArrVal_1812 (Array Int Int)) (v_ArrVal_1810 Int)) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_1809) .cse0 v_ArrVal_1813) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse1) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_53| v_ArrVal_1810)) .cse0 v_ArrVal_1812) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse1)))) (not (= v_ArrVal_1809 (store .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_53| (select v_ArrVal_1809 |v_ULTIMATE.start_dll_update_at_~head#1.offset_53|)))))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_53| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_53|) (forall ((v_ArrVal_1809 (Array Int Int))) (or (forall ((v_ArrVal_1813 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_1809) .cse0 v_ArrVal_1813) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse1))) (not (= v_ArrVal_1809 (store .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_53| (select v_ArrVal_1809 |v_ULTIMATE.start_dll_update_at_~head#1.offset_53|))))))))))) is different from false [2025-03-08 23:10:02,234 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (let ((.cse1 (select .cse3 .cse2)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_53| Int)) (or (forall ((v_ArrVal_1809 (Array Int Int))) (or (not (= v_ArrVal_1809 (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_53| (select v_ArrVal_1809 |v_ULTIMATE.start_dll_update_at_~head#1.offset_53|)))) (forall ((v_ArrVal_1813 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1809) .cse1 v_ArrVal_1813) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2))))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_53|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_53| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_53|) (forall ((v_ArrVal_1809 (Array Int Int))) (or (forall ((v_ArrVal_1813 (Array Int Int)) (v_ArrVal_1812 (Array Int Int)) (v_ArrVal_1810 Int)) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1809) .cse1 v_ArrVal_1813) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_53| v_ArrVal_1810)) .cse1 v_ArrVal_1812) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2)))) (not (= v_ArrVal_1809 (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_53| (select v_ArrVal_1809 |v_ULTIMATE.start_dll_update_at_~head#1.offset_53|))))))))))) is different from false [2025-03-08 23:10:02,255 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse1 (select .cse3 .cse2))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_53| Int)) (or (forall ((v_ArrVal_1809 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_53| (select v_ArrVal_1809 |v_ULTIMATE.start_dll_update_at_~head#1.offset_53|)) v_ArrVal_1809)) (forall ((v_ArrVal_1813 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1809) .cse1 v_ArrVal_1813) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_53|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_53| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_53|) (forall ((v_ArrVal_1809 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_53| (select v_ArrVal_1809 |v_ULTIMATE.start_dll_update_at_~head#1.offset_53|)) v_ArrVal_1809)) (forall ((v_ArrVal_1813 (Array Int Int)) (v_ArrVal_1812 (Array Int Int)) (v_ArrVal_1810 Int)) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1809) .cse1 v_ArrVal_1813) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_53| v_ArrVal_1810)) .cse1 v_ArrVal_1812) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))))))))))) is different from false [2025-03-08 23:10:02,277 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:10:02,277 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 135 treesize of output 139 [2025-03-08 23:10:02,367 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_53| Int)) (or (forall ((v_ArrVal_1809 (Array Int Int)) (v_ArrVal_1808 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1808))) (or (not (= (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_53| (select v_ArrVal_1809 |v_ULTIMATE.start_dll_update_at_~head#1.offset_53|)) v_ArrVal_1809)) (forall ((v_ArrVal_1813 (Array Int Int)) (v_ArrVal_1807 (Array Int Int))) (< (select (select (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1809) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1807) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1813) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 9)))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_53|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_53| Int)) (or (forall ((v_ArrVal_1812 (Array Int Int)) (v_ArrVal_1807 (Array Int Int)) (v_ArrVal_1810 Int)) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1807))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (store (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_53| v_ArrVal_1810)) (select .cse3 .cse1) v_ArrVal_1812))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_53|))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_prenex_7 Int) (v_prenex_10 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_9))) (or (not (= (store (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_7 (select v_prenex_8 v_prenex_7)) v_prenex_8)) (< 0 (+ (select (select (store (store .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_prenex_8) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_10) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_prenex_6) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) 1)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_7)))))) is different from false [2025-03-08 23:10:02,431 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_prenex_8 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_prenex_7 Int) (v_ArrVal_1806 Int) (v_ArrVal_1805 Int) (v_prenex_10 (Array Int Int)) (v_prenex_6 (Array Int Int))) (or (< 0 (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_9) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_prenex_8) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_1805)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_10) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) v_prenex_6) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) 1)) (not (= (store (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse1 v_ArrVal_1806)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_9) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_7 (select v_prenex_8 v_prenex_7)) v_prenex_8)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_7))) (forall ((v_ArrVal_1806 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_53| Int) (v_ArrVal_1805 Int)) (or (forall ((v_ArrVal_1809 (Array Int Int)) (v_ArrVal_1808 (Array Int Int))) (or (not (= (store (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse1 v_ArrVal_1806)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1808) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_53| (select v_ArrVal_1809 |v_ULTIMATE.start_dll_update_at_~head#1.offset_53|)) v_ArrVal_1809)) (forall ((v_ArrVal_1813 (Array Int Int)) (v_ArrVal_1807 (Array Int Int))) (< (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1808) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1809) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_1805)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1807) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) v_ArrVal_1813) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 9))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_53|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_53| Int) (v_ArrVal_1805 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_53|) (forall ((v_ArrVal_1812 (Array Int Int)) (v_ArrVal_1807 (Array Int Int)) (v_ArrVal_1810 Int)) (= (select (select (let ((.cse4 (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_1805)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1807) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1807) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_53| v_ArrVal_1810)) (select .cse4 .cse2) v_ArrVal_1812)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))) is different from false [2025-03-08 23:10:02,450 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:10:02,450 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 50 [2025-03-08 23:10:02,459 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:10:02,459 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 80 [2025-03-08 23:10:02,468 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 41 treesize of output 37 [2025-03-08 23:10:02,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:10:02,476 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 28 treesize of output 32 [2025-03-08 23:10:02,481 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:10:02,486 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:10:02,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 39 [2025-03-08 23:10:02,493 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 80 treesize of output 62 [2025-03-08 23:10:02,501 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 40 treesize of output 32 [2025-03-08 23:10:02,505 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 14 treesize of output 10 [2025-03-08 23:10:02,513 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 8 treesize of output 6 [2025-03-08 23:10:02,529 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:10:02,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 15 [2025-03-08 23:10:02,535 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 21 treesize of output 13 [2025-03-08 23:10:02,546 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2025-03-08 23:10:02,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 1 [2025-03-08 23:10:02,548 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:10:02,552 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2025-03-08 23:10:02,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 1 [2025-03-08 23:10:02,676 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 10 not checked. [2025-03-08 23:10:02,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410032648] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:10:02,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:10:02,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 19] total 50 [2025-03-08 23:10:02,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953709460] [2025-03-08 23:10:02,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:10:02,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-08 23:10:02,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:02,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-08 23:10:02,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1548, Unknown=55, NotChecked=792, Total=2550 [2025-03-08 23:10:02,678 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand has 51 states, 50 states have (on average 2.44) internal successors, (122), 51 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:10:03,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:03,970 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2025-03-08 23:10:03,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 23:10:03,970 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.44) internal successors, (122), 51 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-03-08 23:10:03,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:03,973 INFO L225 Difference]: With dead ends: 72 [2025-03-08 23:10:03,974 INFO L226 Difference]: Without dead ends: 72 [2025-03-08 23:10:03,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 55 SyntacticMatches, 6 SemanticMatches, 61 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=289, Invalid=2554, Unknown=55, NotChecked=1008, Total=3906 [2025-03-08 23:10:03,975 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 44 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 1356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 465 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:03,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 801 Invalid, 1356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 880 Invalid, 0 Unknown, 465 Unchecked, 0.5s Time] [2025-03-08 23:10:03,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-08 23:10:03,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2025-03-08 23:10:03,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 64 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:10:03,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2025-03-08 23:10:03,977 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 43 [2025-03-08 23:10:03,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:03,977 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2025-03-08 23:10:03,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.44) internal successors, (122), 51 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:10:03,977 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2025-03-08 23:10:03,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 23:10:03,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:03,977 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:03,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-08 23:10:04,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:04,178 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 23:10:04,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:04,179 INFO L85 PathProgramCache]: Analyzing trace with hash -2041073709, now seen corresponding path program 1 times [2025-03-08 23:10:04,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:04,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639447553] [2025-03-08 23:10:04,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:04,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:04,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 23:10:04,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 23:10:04,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:04,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:04,253 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 23:10:04,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:04,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639447553] [2025-03-08 23:10:04,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639447553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:10:04,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:10:04,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 23:10:04,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992663024] [2025-03-08 23:10:04,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:10:04,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 23:10:04,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:04,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 23:10:04,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 23:10:04,254 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:10:04,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:04,352 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2025-03-08 23:10:04,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 23:10:04,353 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-03-08 23:10:04,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:04,353 INFO L225 Difference]: With dead ends: 66 [2025-03-08 23:10:04,353 INFO L226 Difference]: Without dead ends: 66 [2025-03-08 23:10:04,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 23:10:04,354 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 19 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:04,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 104 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:10:04,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-08 23:10:04,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-03-08 23:10:04,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 60 states have (on average 1.1666666666666667) internal successors, (70), 65 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:10:04,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2025-03-08 23:10:04,356 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 46 [2025-03-08 23:10:04,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:04,356 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2025-03-08 23:10:04,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:10:04,356 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2025-03-08 23:10:04,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 23:10:04,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:04,356 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:04,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 23:10:04,356 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 23:10:04,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:04,357 INFO L85 PathProgramCache]: Analyzing trace with hash -2041073708, now seen corresponding path program 1 times [2025-03-08 23:10:04,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:04,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136310393] [2025-03-08 23:10:04,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:04,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:04,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 23:10:04,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 23:10:04,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:04,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:04,407 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 23:10:04,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:04,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136310393] [2025-03-08 23:10:04,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136310393] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:04,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816697884] [2025-03-08 23:10:04,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:04,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:04,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:10:04,410 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-08 23:10:04,411 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-08 23:10:04,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 23:10:04,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 23:10:04,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:04,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:04,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 23:10:04,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:10:04,577 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 23:10:04,577 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:10:04,594 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 23:10:04,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816697884] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:10:04,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:10:04,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-03-08 23:10:04,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895296571] [2025-03-08 23:10:04,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:10:04,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 23:10:04,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:04,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 23:10:04,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:10:04,595 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:10:04,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:04,622 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2025-03-08 23:10:04,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 23:10:04,622 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-03-08 23:10:04,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:04,623 INFO L225 Difference]: With dead ends: 66 [2025-03-08 23:10:04,623 INFO L226 Difference]: Without dead ends: 66 [2025-03-08 23:10:04,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 88 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-08 23:10:04,623 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 26 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:04,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 155 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:10:04,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-08 23:10:04,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-03-08 23:10:04,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 60 states have (on average 1.15) internal successors, (69), 65 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:10:04,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2025-03-08 23:10:04,625 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 46 [2025-03-08 23:10:04,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:04,625 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2025-03-08 23:10:04,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:10:04,625 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2025-03-08 23:10:04,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 23:10:04,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:04,625 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:04,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-08 23:10:04,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-08 23:10:04,826 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 23:10:04,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:04,826 INFO L85 PathProgramCache]: Analyzing trace with hash 442942773, now seen corresponding path program 1 times [2025-03-08 23:10:04,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:04,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415190402] [2025-03-08 23:10:04,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:04,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:04,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 23:10:04,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 23:10:04,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:04,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:04,964 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 23:10:04,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:04,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415190402] [2025-03-08 23:10:04,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415190402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:10:04,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:10:04,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 23:10:04,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025094675] [2025-03-08 23:10:04,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:10:04,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 23:10:04,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:04,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 23:10:04,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 23:10:04,966 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:10:05,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:05,063 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2025-03-08 23:10:05,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 23:10:05,063 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-03-08 23:10:05,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:05,063 INFO L225 Difference]: With dead ends: 68 [2025-03-08 23:10:05,063 INFO L226 Difference]: Without dead ends: 68 [2025-03-08 23:10:05,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 23:10:05,064 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 12 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:05,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 126 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:10:05,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-08 23:10:05,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-08 23:10:05,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 62 states have (on average 1.1290322580645162) internal successors, (70), 67 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:10:05,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2025-03-08 23:10:05,065 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 49 [2025-03-08 23:10:05,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:05,065 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2025-03-08 23:10:05,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:10:05,065 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2025-03-08 23:10:05,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 23:10:05,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:05,066 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:05,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 23:10:05,066 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 23:10:05,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:05,066 INFO L85 PathProgramCache]: Analyzing trace with hash 442868327, now seen corresponding path program 1 times [2025-03-08 23:10:05,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:05,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438271984] [2025-03-08 23:10:05,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:05,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:05,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 23:10:05,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 23:10:05,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:05,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:05,873 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:10:05,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:05,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438271984] [2025-03-08 23:10:05,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438271984] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:05,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47954943] [2025-03-08 23:10:05,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:05,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:05,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:10:05,875 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:10:05,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-08 23:10:05,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 23:10:06,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 23:10:06,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:06,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:06,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 99 conjuncts are in the unsatisfiable core [2025-03-08 23:10:06,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:10:06,061 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-08 23:10:06,128 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:10:06,128 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 11 treesize of output 11 [2025-03-08 23:10:06,157 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 13 treesize of output 9 [2025-03-08 23:10:06,186 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 29 treesize of output 13 [2025-03-08 23:10:06,200 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-08 23:10:06,200 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 31 treesize of output 32 [2025-03-08 23:10:06,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:10:06,342 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 26 treesize of output 14 [2025-03-08 23:10:06,529 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-08 23:10:06,529 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 80 treesize of output 73 [2025-03-08 23:10:06,532 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 29 treesize of output 19 [2025-03-08 23:10:06,534 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 40 treesize of output 23 [2025-03-08 23:10:06,754 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 39 treesize of output 21 [2025-03-08 23:10:06,757 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 23 treesize of output 11 [2025-03-08 23:10:06,916 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:10:06,916 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:10:07,067 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 86 treesize of output 64 [2025-03-08 23:10:07,173 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_2169 (Array Int Int))) (= |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2169) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (= |c_ULTIMATE.start_dll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1)) (forall ((v_ArrVal_2170 (Array Int Int))) (= |c_ULTIMATE.start_dll_update_at_#t~mem10#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2170) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))))) is different from false [2025-03-08 23:10:07,184 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:10:07,184 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 50 treesize of output 43 [2025-03-08 23:10:07,187 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 17 treesize of output 13 [2025-03-08 23:10:07,563 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2166 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2166) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) is different from false [2025-03-08 23:10:07,569 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2164 Int) (v_ArrVal_2166 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_2164)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2166) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) is different from false [2025-03-08 23:10:07,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:10:07,576 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 2 case distinctions, treesize of input 28 treesize of output 34 [2025-03-08 23:10:07,578 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 39 treesize of output 27 [2025-03-08 23:10:07,581 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 8 treesize of output 4 [2025-03-08 23:10:07,685 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-03-08 23:10:07,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47954943] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:10:07,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:10:07,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 66 [2025-03-08 23:10:07,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779043781] [2025-03-08 23:10:07,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:10:07,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-03-08 23:10:07,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:07,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-03-08 23:10:07,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=3693, Unknown=18, NotChecked=372, Total=4290 [2025-03-08 23:10:07,687 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand has 66 states, 66 states have (on average 2.0) internal successors, (132), 66 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:10:08,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:08,985 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2025-03-08 23:10:08,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-08 23:10:08,986 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.0) internal successors, (132), 66 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-03-08 23:10:08,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:08,986 INFO L225 Difference]: With dead ends: 70 [2025-03-08 23:10:08,986 INFO L226 Difference]: Without dead ends: 70 [2025-03-08 23:10:08,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 87 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1585 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=509, Invalid=6795, Unknown=18, NotChecked=510, Total=7832 [2025-03-08 23:10:08,988 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 94 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 1409 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 1579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:08,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 774 Invalid, 1579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1409 Invalid, 0 Unknown, 155 Unchecked, 0.5s Time] [2025-03-08 23:10:08,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-08 23:10:08,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2025-03-08 23:10:08,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.11864406779661) internal successors, (66), 63 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:10:08,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2025-03-08 23:10:08,989 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 49 [2025-03-08 23:10:08,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:08,989 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2025-03-08 23:10:08,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 2.0) internal successors, (132), 66 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:10:08,989 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2025-03-08 23:10:08,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 23:10:08,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:08,992 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:09,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-08 23:10:09,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-08 23:10:09,192 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 23:10:09,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:09,193 INFO L85 PathProgramCache]: Analyzing trace with hash 846324731, now seen corresponding path program 1 times [2025-03-08 23:10:09,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:09,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337364265] [2025-03-08 23:10:09,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:09,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:09,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 23:10:09,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 23:10:09,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:09,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:09,258 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 23:10:09,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:09,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337364265] [2025-03-08 23:10:09,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337364265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:10:09,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:10:09,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 23:10:09,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588852216] [2025-03-08 23:10:09,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:10:09,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 23:10:09,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:09,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 23:10:09,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 23:10:09,259 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:10:09,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:09,322 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2025-03-08 23:10:09,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 23:10:09,322 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-08 23:10:09,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:09,323 INFO L225 Difference]: With dead ends: 66 [2025-03-08 23:10:09,323 INFO L226 Difference]: Without dead ends: 66 [2025-03-08 23:10:09,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 23:10:09,324 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 12 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:09,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 140 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:10:09,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-08 23:10:09,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2025-03-08 23:10:09,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 63 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:10:09,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2025-03-08 23:10:09,325 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 50 [2025-03-08 23:10:09,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:09,325 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2025-03-08 23:10:09,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:10:09,325 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2025-03-08 23:10:09,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 23:10:09,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:09,326 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:09,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 23:10:09,326 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 23:10:09,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:09,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1568578337, now seen corresponding path program 1 times [2025-03-08 23:10:09,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:09,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442237333] [2025-03-08 23:10:09,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:09,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:09,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 23:10:09,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 23:10:09,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:09,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:09,402 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 23:10:09,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:09,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442237333] [2025-03-08 23:10:09,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442237333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:10:09,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:10:09,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 23:10:09,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66713286] [2025-03-08 23:10:09,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:10:09,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 23:10:09,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:09,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 23:10:09,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 23:10:09,404 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:10:09,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:09,480 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2025-03-08 23:10:09,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 23:10:09,480 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-03-08 23:10:09,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:09,481 INFO L225 Difference]: With dead ends: 65 [2025-03-08 23:10:09,481 INFO L226 Difference]: Without dead ends: 65 [2025-03-08 23:10:09,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 23:10:09,481 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 8 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:09,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 128 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:10:09,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-08 23:10:09,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-08 23:10:09,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.1) internal successors, (66), 64 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:10:09,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2025-03-08 23:10:09,482 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 52 [2025-03-08 23:10:09,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:09,482 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2025-03-08 23:10:09,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:10:09,483 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2025-03-08 23:10:09,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 23:10:09,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:09,483 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:09,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 23:10:09,483 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 23:10:09,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:09,483 INFO L85 PathProgramCache]: Analyzing trace with hash 273042509, now seen corresponding path program 1 times [2025-03-08 23:10:09,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:09,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279458321] [2025-03-08 23:10:09,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:09,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:09,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 23:10:09,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 23:10:09,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:09,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:10,186 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 23:10:10,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:10,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279458321] [2025-03-08 23:10:10,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279458321] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:10,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097159034] [2025-03-08 23:10:10,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:10,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:10,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:10:10,189 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:10:10,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-08 23:10:10,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 23:10:10,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 23:10:10,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:10,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:10,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-03-08 23:10:10,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:10:10,360 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-08 23:10:10,383 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:10:10,383 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 11 treesize of output 11 [2025-03-08 23:10:10,405 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 11 treesize of output 7 [2025-03-08 23:10:10,432 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 23 treesize of output 11 [2025-03-08 23:10:10,445 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 23:10:10,446 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 34 treesize of output 33 [2025-03-08 23:10:10,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:10:10,499 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 33 treesize of output 17 [2025-03-08 23:10:10,584 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 23:10:10,584 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 34 treesize of output 33 [2025-03-08 23:10:10,673 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:10:10,674 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 27 treesize of output 21 [2025-03-08 23:10:10,792 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-08 23:10:10,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 13 [2025-03-08 23:10:10,795 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 23:10:10,796 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:10:10,975 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2414 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2414) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 1)) (forall ((v_ArrVal_2414 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2414) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))) is different from false [2025-03-08 23:10:10,979 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)))) (and (forall ((v_ArrVal_2414 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2414) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 1)) (forall ((v_ArrVal_2414 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2414) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))) is different from false [2025-03-08 23:10:11,116 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse1 (select .cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_68| Int)) (or (forall ((v_ArrVal_2414 (Array Int Int)) (v_ArrVal_2412 Int)) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_68| v_ArrVal_2412)) .cse1 v_ArrVal_2414) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 1)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_68|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_68| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_68|) (forall ((v_ArrVal_2414 (Array Int Int)) (v_ArrVal_2412 Int)) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_68| v_ArrVal_2412)) .cse1 v_ArrVal_2414) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|)))))))) is different from false [2025-03-08 23:10:11,222 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse1 (select .cse0 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_68| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_68|) (forall ((v_ArrVal_2414 (Array Int Int)) (v_ArrVal_2412 Int)) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_68| v_ArrVal_2412)) .cse1 v_ArrVal_2414) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) 1)))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_68| Int)) (or (forall ((v_ArrVal_2414 (Array Int Int)) (v_ArrVal_2412 Int)) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_68| v_ArrVal_2412)) .cse1 v_ArrVal_2414) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_68|)))))) is different from false [2025-03-08 23:10:11,234 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse1 (select .cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_68| Int)) (or (forall ((v_ArrVal_2414 (Array Int Int)) (v_ArrVal_2412 Int)) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_68| v_ArrVal_2412)) .cse1 v_ArrVal_2414) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_68|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_68| Int)) (or (forall ((v_ArrVal_2414 (Array Int Int)) (v_ArrVal_2412 Int)) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_68| v_ArrVal_2412)) .cse1 v_ArrVal_2414) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) 1)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_68|)))))) is different from false [2025-03-08 23:10:11,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:10:11,246 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 85 treesize of output 89 [2025-03-08 23:10:11,590 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:10:11,590 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 69 [2025-03-08 23:10:11,593 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 103 treesize of output 95 [2025-03-08 23:10:11,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:10:11,603 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 106 treesize of output 100 [2025-03-08 23:10:11,612 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:10:11,612 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 80 treesize of output 79 [2025-03-08 23:10:11,617 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 70 treesize of output 68 [2025-03-08 23:10:11,660 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:10:11,663 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2025-03-08 23:10:11,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 1 [2025-03-08 23:10:11,728 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 6 not checked. [2025-03-08 23:10:11,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097159034] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:10:11,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:10:11,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 21] total 46 [2025-03-08 23:10:11,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565930747] [2025-03-08 23:10:11,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:10:11,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-08 23:10:11,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:11,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-08 23:10:11,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1491, Unknown=101, NotChecked=420, Total=2162 [2025-03-08 23:10:11,730 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand has 47 states, 46 states have (on average 2.5217391304347827) internal successors, (116), 47 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:10:12,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:12,551 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2025-03-08 23:10:12,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 23:10:12,551 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.5217391304347827) internal successors, (116), 47 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-08 23:10:12,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:12,551 INFO L225 Difference]: With dead ends: 74 [2025-03-08 23:10:12,551 INFO L226 Difference]: Without dead ends: 74 [2025-03-08 23:10:12,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 82 SyntacticMatches, 6 SemanticMatches, 57 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=274, Invalid=2499, Unknown=109, NotChecked=540, Total=3422 [2025-03-08 23:10:12,552 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 31 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 1300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 328 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:12,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 363 Invalid, 1300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 965 Invalid, 0 Unknown, 328 Unchecked, 0.5s Time] [2025-03-08 23:10:12,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-08 23:10:12,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2025-03-08 23:10:12,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 63 states have (on average 1.126984126984127) internal successors, (71), 67 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:10:12,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2025-03-08 23:10:12,555 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 55 [2025-03-08 23:10:12,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:12,555 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2025-03-08 23:10:12,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.5217391304347827) internal successors, (116), 47 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:10:12,555 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2025-03-08 23:10:12,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 23:10:12,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:12,555 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:12,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-08 23:10:12,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:12,756 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 23:10:12,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:12,756 INFO L85 PathProgramCache]: Analyzing trace with hash 273042510, now seen corresponding path program 1 times [2025-03-08 23:10:12,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:12,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669447520] [2025-03-08 23:10:12,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:12,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:12,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 23:10:12,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 23:10:12,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:12,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:13,984 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 23:10:13,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:13,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669447520] [2025-03-08 23:10:13,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669447520] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:13,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315808672] [2025-03-08 23:10:13,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:13,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:13,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:10:13,986 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:10:13,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-08 23:10:14,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 23:10:14,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 23:10:14,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:14,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:14,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 87 conjuncts are in the unsatisfiable core [2025-03-08 23:10:14,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:10:14,161 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 8 treesize of output 1 [2025-03-08 23:10:14,164 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-08 23:10:14,241 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:10:14,242 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 11 treesize of output 11 [2025-03-08 23:10:14,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-03-08 23:10:14,283 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 11 treesize of output 7 [2025-03-08 23:10:14,290 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 15 treesize of output 1 [2025-03-08 23:10:14,321 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 23 treesize of output 11 [2025-03-08 23:10:14,324 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 23 treesize of output 11 [2025-03-08 23:10:14,339 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 23:10:14,339 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 50 treesize of output 45 [2025-03-08 23:10:14,342 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 24 treesize of output 11 [2025-03-08 23:10:14,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:10:14,513 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 33 treesize of output 17 [2025-03-08 23:10:14,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:10:14,518 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 23 treesize of output 11 [2025-03-08 23:10:14,653 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 23:10:14,653 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 50 treesize of output 45 [2025-03-08 23:10:14,656 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 24 treesize of output 11 [2025-03-08 23:10:14,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:10:14,778 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 17 treesize of output 15 [2025-03-08 23:10:14,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:10:14,784 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 27 treesize of output 21 [2025-03-08 23:10:14,879 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 23:10:14,880 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:10:15,375 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_2547 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2547))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 0) (forall ((v_ArrVal_2549 (Array Int Int)) (v_ArrVal_2550 (Array Int Int)) (v_ArrVal_2548 Int)) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store .cse4 |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_2548)))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (<= (+ (select (select (store .cse0 .cse2 v_ArrVal_2549) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_2550) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))) (not (= v_ArrVal_2547 (store .cse5 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_2547 |c_ULTIMATE.start_dll_update_at_~head#1.offset|))))))) (forall ((v_ArrVal_2547 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2547))) (or (forall ((v_ArrVal_2549 (Array Int Int)) (v_ArrVal_2548 Int)) (<= 0 (+ (select (select (store .cse6 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store .cse4 |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_2548)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) v_ArrVal_2549) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4))) (< (select (select .cse6 |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 0) (not (= v_ArrVal_2547 (store .cse5 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_2547 |c_ULTIMATE.start_dll_update_at_~head#1.offset|))))))))) is different from false [2025-03-08 23:10:15,432 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse2 (select .cse3 .cse0)) (.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_76| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_76|) (forall ((v_ArrVal_2547 (Array Int Int))) (or (< (select v_ArrVal_2547 .cse0) 0) (not (= v_ArrVal_2547 (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_76| (select v_ArrVal_2547 |v_ULTIMATE.start_dll_update_at_~head#1.offset_76|)))) (forall ((v_ArrVal_2549 (Array Int Int)) (v_ArrVal_2550 (Array Int Int)) (v_ArrVal_2548 Int)) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2547) .cse2 v_ArrVal_2549) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_76| v_ArrVal_2548)) .cse2 v_ArrVal_2550) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_76| Int)) (or (forall ((v_ArrVal_2547 (Array Int Int))) (or (< (select v_ArrVal_2547 .cse0) 0) (forall ((v_ArrVal_2549 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2547) .cse2 v_ArrVal_2549) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4))) (not (= v_ArrVal_2547 (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_76| (select v_ArrVal_2547 |v_ULTIMATE.start_dll_update_at_~head#1.offset_76|)))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_76|)))))) is different from false [2025-03-08 23:10:15,456 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse3 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse0 (select .cse1 .cse3))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_76| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_76|) (forall ((v_ArrVal_2547 (Array Int Int))) (or (forall ((v_ArrVal_2549 (Array Int Int)) (v_ArrVal_2550 (Array Int Int)) (v_ArrVal_2548 Int)) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_2547) .cse0 v_ArrVal_2549) |c_ULTIMATE.start_dll_create_#res#1.base|) 4)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_76| v_ArrVal_2548)) .cse0 v_ArrVal_2550) |c_ULTIMATE.start_dll_create_#res#1.base|) 4)))) (not (= v_ArrVal_2547 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_76| (select v_ArrVal_2547 |v_ULTIMATE.start_dll_update_at_~head#1.offset_76|)))) (< (select v_ArrVal_2547 .cse3) 0))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_76| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_76|) (forall ((v_ArrVal_2547 (Array Int Int))) (or (not (= v_ArrVal_2547 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_76| (select v_ArrVal_2547 |v_ULTIMATE.start_dll_update_at_~head#1.offset_76|)))) (forall ((v_ArrVal_2549 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_2547) .cse0 v_ArrVal_2549) |c_ULTIMATE.start_dll_create_#res#1.base|) 4)))) (< (select v_ArrVal_2547 .cse3) 0)))))))) is different from false [2025-03-08 23:10:15,887 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_76| Int) (v_ArrVal_2545 (Array Int Int)) (v_ArrVal_2544 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_76|) (forall ((v_ArrVal_2547 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2545))) (or (< (select v_ArrVal_2547 .cse0) 0) (not (= v_ArrVal_2547 (store (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_76| (select v_ArrVal_2547 |v_ULTIMATE.start_dll_update_at_~head#1.offset_76|)))) (forall ((v_ArrVal_2549 (Array Int Int))) (<= 0 (+ (select (select (store (store .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2547) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2544) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) v_ArrVal_2549) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 4)))))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_76| Int) (v_ArrVal_2545 (Array Int Int)) (v_ArrVal_2544 (Array Int Int))) (or (forall ((v_ArrVal_2547 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2545))) (or (< (select v_ArrVal_2547 .cse0) 0) (not (= v_ArrVal_2547 (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_76| (select v_ArrVal_2547 |v_ULTIMATE.start_dll_update_at_~head#1.offset_76|)))) (forall ((v_ArrVal_2549 (Array Int Int)) (v_ArrVal_2550 (Array Int Int)) (v_ArrVal_2548 Int)) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2544))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse3 (select .cse5 .cse0))) (<= (+ (select (select (store (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2547) .cse3 v_ArrVal_2549) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 |v_ULTIMATE.start_dll_update_at_~head#1.offset_76| v_ArrVal_2548)) .cse3 v_ArrVal_2550) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))))))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_76|))))) is different from false [2025-03-08 23:10:15,954 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse4 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_76| Int) (v_ArrVal_2540 Int) (v_ArrVal_2545 (Array Int Int)) (v_ArrVal_2544 (Array Int Int)) (v_ArrVal_2543 Int)) (or (forall ((v_ArrVal_2547 (Array Int Int))) (or (forall ((v_ArrVal_2549 (Array Int Int)) (v_ArrVal_2550 (Array Int Int)) (v_ArrVal_2548 Int)) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_2543)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2544) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse0 (select .cse1 .cse2))) (<= (+ 8 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2545) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2547) .cse0 v_ArrVal_2549) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (select |c_#length| (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2544) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_76| v_ArrVal_2548)) .cse0 v_ArrVal_2550) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))))) (< (select v_ArrVal_2547 .cse2) 0) (not (= (store (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse4 v_ArrVal_2540)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2545) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_76| (select v_ArrVal_2547 |v_ULTIMATE.start_dll_update_at_~head#1.offset_76|)) v_ArrVal_2547)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_76|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_76| Int) (v_ArrVal_2540 Int) (v_ArrVal_2545 (Array Int Int)) (v_ArrVal_2544 (Array Int Int)) (v_ArrVal_2543 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_76|) (forall ((v_ArrVal_2547 (Array Int Int))) (or (< (select v_ArrVal_2547 .cse2) 0) (forall ((v_ArrVal_2549 (Array Int Int))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2545) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2547) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_2543)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2544) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) v_ArrVal_2549) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 4))) (not (= (store (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse4 v_ArrVal_2540)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2545) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_76| (select v_ArrVal_2547 |v_ULTIMATE.start_dll_update_at_~head#1.offset_76|)) v_ArrVal_2547)))))))) is different from false [2025-03-08 23:10:15,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:10:15,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 295 treesize of output 255 [2025-03-08 23:10:15,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:10:15,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 265 treesize of output 285 [2025-03-08 23:10:16,010 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 231 treesize of output 213 [2025-03-08 23:10:16,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:10:16,024 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 206 treesize of output 205 [2025-03-08 23:10:16,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:10:16,037 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 221 treesize of output 215 [2025-03-08 23:10:16,051 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 238 treesize of output 232 [2025-03-08 23:10:16,074 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2025-03-08 23:10:16,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 225 treesize of output 239 [2025-03-08 23:10:16,085 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:10:16,085 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 207 treesize of output 211 [2025-03-08 23:10:16,092 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 202 treesize of output 200 [2025-03-08 23:10:16,098 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 200 treesize of output 198 [2025-03-08 23:10:16,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:10:16,108 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 198 treesize of output 202 [2025-03-08 23:10:16,132 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2025-03-08 23:10:16,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 220 treesize of output 230 [2025-03-08 23:10:16,153 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 188 treesize of output 180 [2025-03-08 23:10:16,163 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 180 treesize of output 178 [2025-03-08 23:10:16,411 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 8 treesize of output 6 [2025-03-08 23:10:16,422 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 8 treesize of output 6 [2025-03-08 23:10:16,474 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 8 treesize of output 6 [2025-03-08 23:10:16,490 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 8 treesize of output 6 [2025-03-08 23:10:16,520 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:10:16,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 10 [2025-03-08 23:10:16,536 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 8 treesize of output 6 [2025-03-08 23:10:16,562 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:10:16,562 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 135 treesize of output 129 [2025-03-08 23:10:16,797 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 12 treesize of output 8 [2025-03-08 23:10:16,803 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-08 23:10:16,803 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 23 treesize of output 1 [2025-03-08 23:10:16,807 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:10:16,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 58 treesize of output 44 [2025-03-08 23:10:16,817 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:10:16,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 10 [2025-03-08 23:10:16,823 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:10:16,824 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 36 treesize of output 30 [2025-03-08 23:10:17,061 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 7 not checked. [2025-03-08 23:10:17,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315808672] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:10:17,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:10:17,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19, 21] total 60 [2025-03-08 23:10:17,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787502866] [2025-03-08 23:10:17,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:10:17,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-03-08 23:10:17,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:17,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-03-08 23:10:17,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2871, Unknown=34, NotChecked=560, Total=3660 [2025-03-08 23:10:17,063 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 61 states, 60 states have (on average 2.4166666666666665) internal successors, (145), 61 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:10:18,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:18,720 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2025-03-08 23:10:18,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 23:10:18,721 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 2.4166666666666665) internal successors, (145), 61 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-08 23:10:18,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:18,721 INFO L225 Difference]: With dead ends: 76 [2025-03-08 23:10:18,721 INFO L226 Difference]: Without dead ends: 76 [2025-03-08 23:10:18,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 75 SyntacticMatches, 5 SemanticMatches, 77 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 906 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=410, Invalid=4978, Unknown=34, NotChecked=740, Total=6162 [2025-03-08 23:10:18,722 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 95 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 1406 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 1731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 310 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:18,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 563 Invalid, 1731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1406 Invalid, 0 Unknown, 310 Unchecked, 0.7s Time] [2025-03-08 23:10:18,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-08 23:10:18,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2025-03-08 23:10:18,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 65 states have (on average 1.1076923076923078) internal successors, (72), 69 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:10:18,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2025-03-08 23:10:18,724 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 55 [2025-03-08 23:10:18,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:18,724 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2025-03-08 23:10:18,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 2.4166666666666665) internal successors, (145), 61 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:10:18,724 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2025-03-08 23:10:18,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 23:10:18,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:18,724 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-08 23:10:18,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-08 23:10:18,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:18,925 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 23:10:18,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:18,925 INFO L85 PathProgramCache]: Analyzing trace with hash -125616126, now seen corresponding path program 1 times [2025-03-08 23:10:18,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:18,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507791914] [2025-03-08 23:10:18,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:18,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:18,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 23:10:18,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 23:10:18,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:18,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:19,482 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 23:10:19,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:19,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507791914] [2025-03-08 23:10:19,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507791914] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:19,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432346804] [2025-03-08 23:10:19,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:19,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:19,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:10:19,484 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:10:19,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-08 23:10:19,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 23:10:19,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 23:10:19,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:19,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:19,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-03-08 23:10:19,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:10:19,657 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-08 23:10:19,677 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:10:19,677 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 11 treesize of output 11 [2025-03-08 23:10:19,691 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 11 treesize of output 7 [2025-03-08 23:10:19,704 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 31 treesize of output 15 [2025-03-08 23:10:19,747 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 23:10:19,747 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-08 23:10:19,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:10:19,805 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 32 treesize of output 16 [2025-03-08 23:10:19,900 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 23:10:19,900 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-08 23:10:19,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:10:19,994 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 26 treesize of output 20 [2025-03-08 23:10:20,040 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 23:10:20,040 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:10:20,142 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2677 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2677) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0))) is different from false [2025-03-08 23:10:20,146 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2677 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_2677) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0))) is different from false [2025-03-08 23:10:20,152 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2677 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2677) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0))) is different from false [2025-03-08 23:10:20,159 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2677 (Array Int Int)) (v_ArrVal_2676 Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_2676)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2677)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0))) is different from false [2025-03-08 23:10:20,413 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2677 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_83| Int) (v_ArrVal_2674 (Array Int Int)) (v_ArrVal_2676 Int)) (or (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2674))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_83| v_ArrVal_2676)) (select .cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2677))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_83|))) is different from false [2025-03-08 23:10:20,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:10:20,534 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 69 [2025-03-08 23:10:20,538 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 103 treesize of output 95 [2025-03-08 23:10:20,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:10:20,547 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 106 treesize of output 100 [2025-03-08 23:10:20,560 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:10:20,560 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 80 treesize of output 79 [2025-03-08 23:10:20,564 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 70 treesize of output 68 [2025-03-08 23:10:20,831 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 7 not checked. [2025-03-08 23:10:20,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432346804] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:10:20,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:10:20,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 23] total 49 [2025-03-08 23:10:20,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202919058] [2025-03-08 23:10:20,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:10:20,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-08 23:10:20,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:20,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-08 23:10:20,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1707, Unknown=40, NotChecked=440, Total=2352 [2025-03-08 23:10:20,834 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand has 49 states, 49 states have (on average 2.489795918367347) internal successors, (122), 49 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:10:21,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:21,739 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2025-03-08 23:10:21,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-08 23:10:21,740 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.489795918367347) internal successors, (122), 49 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-03-08 23:10:21,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:21,740 INFO L225 Difference]: With dead ends: 78 [2025-03-08 23:10:21,740 INFO L226 Difference]: Without dead ends: 78 [2025-03-08 23:10:21,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 87 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 864 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=392, Invalid=3620, Unknown=40, NotChecked=640, Total=4692 [2025-03-08 23:10:21,741 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 67 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 299 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:21,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 465 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 889 Invalid, 0 Unknown, 299 Unchecked, 0.4s Time] [2025-03-08 23:10:21,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-08 23:10:21,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 70. [2025-03-08 23:10:21,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 69 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:10:21,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2025-03-08 23:10:21,746 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 56 [2025-03-08 23:10:21,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:21,746 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2025-03-08 23:10:21,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.489795918367347) internal successors, (122), 49 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:10:21,746 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2025-03-08 23:10:21,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 23:10:21,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:21,746 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:21,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-08 23:10:21,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:21,947 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 23:10:21,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:21,947 INFO L85 PathProgramCache]: Analyzing trace with hash -458682008, now seen corresponding path program 1 times [2025-03-08 23:10:21,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:21,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846273997] [2025-03-08 23:10:21,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:21,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:21,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 23:10:21,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 23:10:21,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:21,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:22,572 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 23:10:22,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:22,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846273997] [2025-03-08 23:10:22,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846273997] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:22,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593059211] [2025-03-08 23:10:22,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:22,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:22,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:10:22,575 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:10:22,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-08 23:10:22,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 23:10:22,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 23:10:22,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:22,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:22,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-08 23:10:22,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:10:22,754 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-08 23:10:22,788 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:10:22,788 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 11 treesize of output 11 [2025-03-08 23:10:22,799 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 11 treesize of output 7 [2025-03-08 23:10:22,827 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 23 treesize of output 11 [2025-03-08 23:10:22,844 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 23:10:22,844 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 34 treesize of output 33 [2025-03-08 23:10:22,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:10:22,894 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 33 treesize of output 17 [2025-03-08 23:10:22,987 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 23:10:22,988 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 34 treesize of output 33 [2025-03-08 23:10:23,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:10:23,068 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 27 treesize of output 21 [2025-03-08 23:10:23,129 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 23:10:23,129 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:10:23,220 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2803 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2803) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2025-03-08 23:10:23,224 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2803 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2803) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2025-03-08 23:10:23,226 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2803 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_2803) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2025-03-08 23:10:23,230 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2803 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2803) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2025-03-08 23:10:23,236 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2803 (Array Int Int)) (v_ArrVal_2802 Int)) (< (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_2802)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2803)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2025-03-08 23:10:23,244 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2803 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_90| Int) (v_ArrVal_2802 Int)) (or (< (select (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_90| v_ArrVal_2802)) (select .cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2803)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_90|))) is different from false [2025-03-08 23:10:23,250 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2803 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_90| Int) (v_ArrVal_2802 Int)) (or (< (select (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|))) (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_90| v_ArrVal_2802)) (select .cse0 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_2803)) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_90|))) is different from false [2025-03-08 23:10:23,255 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2803 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_90| Int) (v_ArrVal_2802 Int)) (or (< (select (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_90| v_ArrVal_2802)) (select .cse0 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_2803)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_90|))) is different from false [2025-03-08 23:10:23,260 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2803 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_90| Int) (v_ArrVal_2802 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_90|) (< (select (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_90| v_ArrVal_2802)) (select .cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2803)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_#StackHeapBarrier|))) is different from false [2025-03-08 23:10:23,269 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2803 (Array Int Int)) (v_ArrVal_2800 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_90| Int) (v_ArrVal_2802 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_90|) (< (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2800))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_90| v_ArrVal_2802)) (select .cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2803))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_#StackHeapBarrier|))) is different from false [2025-03-08 23:10:23,282 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2803 (Array Int Int)) (v_ArrVal_2800 (Array Int Int)) (v_ArrVal_2798 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_90| Int) (v_ArrVal_2802 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_90|) (< (select (select (let ((.cse0 (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_2798)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2800) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2800) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_90| v_ArrVal_2802)) (select .cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2803)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_#StackHeapBarrier|))) is different from false [2025-03-08 23:10:23,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:10:23,290 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 66 [2025-03-08 23:10:23,293 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 105 treesize of output 97 [2025-03-08 23:10:23,302 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:10:23,302 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 101 treesize of output 99 [2025-03-08 23:10:23,311 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:10:23,311 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 111 treesize of output 105 [2025-03-08 23:10:23,317 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 14 treesize of output 12 [2025-03-08 23:10:23,449 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 12 not checked. [2025-03-08 23:10:23,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593059211] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:10:23,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:10:23,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 21] total 46 [2025-03-08 23:10:23,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591280854] [2025-03-08 23:10:23,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:10:23,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-08 23:10:23,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:23,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-08 23:10:23,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1157, Unknown=11, NotChecked=858, Total=2162 [2025-03-08 23:10:23,451 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand has 47 states, 46 states have (on average 2.782608695652174) internal successors, (128), 47 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:10:24,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:24,147 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2025-03-08 23:10:24,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 23:10:24,147 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.782608695652174) internal successors, (128), 47 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-08 23:10:24,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:24,147 INFO L225 Difference]: With dead ends: 77 [2025-03-08 23:10:24,148 INFO L226 Difference]: Without dead ends: 77 [2025-03-08 23:10:24,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 90 SyntacticMatches, 8 SemanticMatches, 60 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=271, Invalid=2312, Unknown=11, NotChecked=1188, Total=3782 [2025-03-08 23:10:24,148 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 49 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 1376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 678 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:24,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 438 Invalid, 1376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 689 Invalid, 0 Unknown, 678 Unchecked, 0.3s Time] [2025-03-08 23:10:24,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-08 23:10:24,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2025-03-08 23:10:24,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0909090909090908) internal successors, (72), 70 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:10:24,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2025-03-08 23:10:24,149 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 58 [2025-03-08 23:10:24,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:24,150 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2025-03-08 23:10:24,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.782608695652174) internal successors, (128), 47 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:10:24,150 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2025-03-08 23:10:24,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-08 23:10:24,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:24,150 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:24,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-08 23:10:24,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-03-08 23:10:24,351 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 23:10:24,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:24,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1990220966, now seen corresponding path program 2 times [2025-03-08 23:10:24,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:24,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432510442] [2025-03-08 23:10:24,351 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 23:10:24,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:24,367 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 61 statements into 2 equivalence classes. [2025-03-08 23:10:24,384 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 23:10:24,384 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 23:10:24,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:25,628 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 23:10:25,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:25,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432510442] [2025-03-08 23:10:25,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432510442] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:25,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529364669] [2025-03-08 23:10:25,628 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 23:10:25,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:25,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:10:25,631 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:10:25,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-08 23:10:25,779 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 61 statements into 2 equivalence classes. [2025-03-08 23:10:25,811 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 23:10:25,811 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 23:10:25,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:25,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 111 conjuncts are in the unsatisfiable core [2025-03-08 23:10:25,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:10:25,821 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-08 23:10:25,836 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-08 23:10:25,839 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-08 23:10:25,846 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 23 treesize of output 11 [2025-03-08 23:10:25,849 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 23 treesize of output 11 [2025-03-08 23:10:25,869 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:10:25,869 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 11 treesize of output 11 [2025-03-08 23:10:25,883 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 16 treesize of output 11 [2025-03-08 23:10:25,886 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 16 treesize of output 11 [2025-03-08 23:10:25,896 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 19 treesize of output 18 [2025-03-08 23:10:25,901 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 23 treesize of output 11 [2025-03-08 23:10:25,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-08 23:10:25,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-08 23:10:25,992 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-08 23:10:25,992 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 1 case distinctions, treesize of input 85 treesize of output 58 [2025-03-08 23:10:25,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2025-03-08 23:10:26,194 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-03-08 23:10:26,194 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 29 [2025-03-08 23:10:26,210 INFO L349 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2025-03-08 23:10:26,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 36 [2025-03-08 23:10:26,646 INFO L349 Elim1Store]: treesize reduction 116, result has 43.4 percent of original size [2025-03-08 23:10:26,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 128 treesize of output 162 [2025-03-08 23:10:26,743 INFO L349 Elim1Store]: treesize reduction 108, result has 47.3 percent of original size [2025-03-08 23:10:26,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 129 [2025-03-08 23:10:39,728 INFO L349 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2025-03-08 23:10:39,729 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 38 [2025-03-08 23:10:39,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:10:39,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 18 [2025-03-08 23:10:39,764 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 23:10:39,764 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:10:41,618 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_98| Int)) (or (forall ((v_ArrVal_2946 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_98| (select v_ArrVal_2946 |v_ULTIMATE.start_dll_update_at_~head#1.offset_98|)) v_ArrVal_2946)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_95| Int) (v_ArrVal_2948 Int) (v_ArrVal_2947 Int) (v_ArrVal_2950 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2946)) (.cse2 (store .cse5 |v_ULTIMATE.start_dll_update_at_~head#1.offset_98| v_ArrVal_2947))) (or (not (= (store (select .cse1 (select .cse2 4)) |v_ULTIMATE.start_dll_update_at_~head#1.offset_95| (select v_ArrVal_2950 |v_ULTIMATE.start_dll_update_at_~head#1.offset_95|)) v_ArrVal_2950)) (= (select (let ((.cse3 (select .cse5 4))) (select (store .cse1 .cse3 v_ArrVal_2950) (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse2))) (store .cse4 .cse3 (store (select .cse4 .cse3) |v_ULTIMATE.start_dll_update_at_~head#1.offset_95| v_ArrVal_2948))) |c_ULTIMATE.start_main_~s~0#1.base|) 4))) 4) 0) (< (select v_ArrVal_2946 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_95|)))))) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_98|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_95| Int) (v_ArrVal_2948 Int) (v_ArrVal_2947 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_98| Int)) (or (= (select (let ((.cse6 (let ((.cse9 (store .cse5 |v_ULTIMATE.start_dll_update_at_~head#1.offset_98| v_ArrVal_2947))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse9)) (.cse8 (select .cse9 4))) (store .cse7 .cse8 (store (select .cse7 .cse8) |v_ULTIMATE.start_dll_update_at_~head#1.offset_95| v_ArrVal_2948)))))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~s~0#1.base|) 4))) 4) 0) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_98|) (< (select .cse0 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_95|))))) is different from false [2025-03-08 23:10:41,642 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_95| Int) (v_ArrVal_2948 Int) (v_ArrVal_2947 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_98| Int)) (or (< (select .cse0 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_95|) (= (select (let ((.cse1 (let ((.cse4 (store .cse5 |v_ULTIMATE.start_dll_update_at_~head#1.offset_98| v_ArrVal_2947))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse4)) (.cse3 (select .cse4 4))) (store .cse2 .cse3 (store (select .cse2 .cse3) |v_ULTIMATE.start_dll_update_at_~head#1.offset_95| v_ArrVal_2948)))))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) 4) 0) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_98|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_98| Int)) (or (forall ((v_ArrVal_2946 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_95| Int) (v_ArrVal_2948 Int) (v_ArrVal_2947 Int) (v_ArrVal_2950 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_2946)) (.cse9 (store .cse5 |v_ULTIMATE.start_dll_update_at_~head#1.offset_98| v_ArrVal_2947))) (or (= (select (let ((.cse7 (select .cse5 4))) (select (store .cse6 .cse7 v_ArrVal_2950) (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse9))) (store .cse8 .cse7 (store (select .cse8 .cse7) |v_ULTIMATE.start_dll_update_at_~head#1.offset_95| v_ArrVal_2948))) |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) 4) 0) (not (= v_ArrVal_2950 (store (select .cse6 (select .cse9 4)) |v_ULTIMATE.start_dll_update_at_~head#1.offset_95| (select v_ArrVal_2950 |v_ULTIMATE.start_dll_update_at_~head#1.offset_95|)))) (< (select v_ArrVal_2946 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_95|)))) (not (= (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_98| (select v_ArrVal_2946 |v_ULTIMATE.start_dll_update_at_~head#1.offset_98|)) v_ArrVal_2946)))) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_98|))))) is different from false [2025-03-08 23:10:41,666 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_98| Int)) (or (forall ((v_ArrVal_2946 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_95| Int) (v_ArrVal_2948 Int) (v_ArrVal_2947 Int) (v_ArrVal_2950 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2946)) (.cse1 (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_98| v_ArrVal_2947))) (or (not (= (store (select .cse0 (select .cse1 4)) |v_ULTIMATE.start_dll_update_at_~head#1.offset_95| (select v_ArrVal_2950 |v_ULTIMATE.start_dll_update_at_~head#1.offset_95|)) v_ArrVal_2950)) (< (select v_ArrVal_2946 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_95|) (= (select (let ((.cse2 (select .cse4 4))) (select (store .cse0 .cse2 v_ArrVal_2950) (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse1))) (store .cse3 .cse2 (store (select .cse3 .cse2) |v_ULTIMATE.start_dll_update_at_~head#1.offset_95| v_ArrVal_2948))) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) 4) 0)))) (not (= (store .cse5 |v_ULTIMATE.start_dll_update_at_~head#1.offset_98| (select v_ArrVal_2946 |v_ULTIMATE.start_dll_update_at_~head#1.offset_98|)) v_ArrVal_2946)))) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_98|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_95| Int) (v_ArrVal_2948 Int) (v_ArrVal_2947 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_98| Int)) (or (< (select .cse5 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_95|) (= (select (let ((.cse6 (let ((.cse9 (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_98| v_ArrVal_2947))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse9)) (.cse8 (select .cse9 4))) (store .cse7 .cse8 (store (select .cse7 .cse8) |v_ULTIMATE.start_dll_update_at_~head#1.offset_95| v_ArrVal_2948)))))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) 4) 0) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_98|))))) is different from false [2025-03-08 23:10:41,690 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_95| Int) (v_ArrVal_2948 Int) (v_ArrVal_2947 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_98| Int)) (or (= (select (let ((.cse0 (let ((.cse3 (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_98| v_ArrVal_2947))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3)) (.cse2 (select .cse3 4))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_dll_update_at_~head#1.offset_95| v_ArrVal_2948)))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) 4) 0) (< (select .cse5 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_95|) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_98|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_98| Int)) (or (forall ((v_ArrVal_2946 (Array Int Int))) (or (not (= (store .cse5 |v_ULTIMATE.start_dll_update_at_~head#1.offset_98| (select v_ArrVal_2946 |v_ULTIMATE.start_dll_update_at_~head#1.offset_98|)) v_ArrVal_2946)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_95| Int) (v_ArrVal_2948 Int) (v_ArrVal_2947 Int) (v_ArrVal_2950 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2946)) (.cse7 (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_98| v_ArrVal_2947))) (or (not (= v_ArrVal_2950 (store (select .cse6 (select .cse7 4)) |v_ULTIMATE.start_dll_update_at_~head#1.offset_95| (select v_ArrVal_2950 |v_ULTIMATE.start_dll_update_at_~head#1.offset_95|)))) (< (select v_ArrVal_2946 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_95|) (= (select (let ((.cse8 (select .cse4 4))) (select (store .cse6 .cse8 v_ArrVal_2950) (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse7))) (store .cse9 .cse8 (store (select .cse9 .cse8) |v_ULTIMATE.start_dll_update_at_~head#1.offset_95| v_ArrVal_2948))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) 4) 0)))))) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_98|))))) is different from false [2025-03-08 23:10:41,731 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse8 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_98| Int) (v_ArrVal_2942 Int) (v_ArrVal_2941 Int)) (or (forall ((v_ArrVal_2946 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse9 .cse8 v_ArrVal_2942)))) (or (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_95| Int) (v_ArrVal_2948 Int) (v_ArrVal_2947 Int) (v_ArrVal_2950 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse7 .cse8 v_ArrVal_2941)))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse0 (store .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2946)) (.cse1 (store .cse5 |v_ULTIMATE.start_dll_update_at_~head#1.offset_98| v_ArrVal_2947))) (or (not (= v_ArrVal_2950 (store (select .cse0 (select .cse1 4)) |v_ULTIMATE.start_dll_update_at_~head#1.offset_95| (select v_ArrVal_2950 |v_ULTIMATE.start_dll_update_at_~head#1.offset_95|)))) (= (select (let ((.cse2 (select .cse5 4))) (select (store .cse0 .cse2 v_ArrVal_2950) (select (select (let ((.cse3 (store .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1))) (store .cse3 .cse2 (store (select .cse3 .cse2) |v_ULTIMATE.start_dll_update_at_~head#1.offset_95| v_ArrVal_2948))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) 4) 0) (< (select v_ArrVal_2946 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_95|)))))) (not (= v_ArrVal_2946 (store (select .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_98| (select v_ArrVal_2946 |v_ULTIMATE.start_dll_update_at_~head#1.offset_98|))))))) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_98|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_95| Int) (v_ArrVal_2948 Int) (v_ArrVal_2947 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_98| Int) (v_ArrVal_2942 Int) (v_ArrVal_2941 Int)) (or (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse9 .cse8 v_ArrVal_2942)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_95|) (= (select (let ((.cse10 (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse7 .cse8 v_ArrVal_2941)))) (let ((.cse13 (store (select .cse14 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_98| v_ArrVal_2947))) (let ((.cse11 (store .cse14 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse13)) (.cse12 (select .cse13 4))) (store .cse11 .cse12 (store (select .cse11 .cse12) |v_ULTIMATE.start_dll_update_at_~head#1.offset_95| v_ArrVal_2948))))))) (select .cse10 (select (select .cse10 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) 4) 0) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_98|))))) is different from false [2025-03-08 23:10:53,564 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse9 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse8 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse12 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse10 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_2935 Int)) (or (forall ((v_ArrVal_2939 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_98| Int) (v_ArrVal_2940 Int) (v_ArrVal_2942 Int) (v_ArrVal_2941 Int)) (or (forall ((v_ArrVal_2946 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store .cse12 .cse13 v_ArrVal_2935) .cse10 v_ArrVal_2939)))) (let ((.cse6 (store (select .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse8 v_ArrVal_2942))) (or (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_95| Int) (v_ArrVal_2948 Int) (v_ArrVal_2947 Int) (v_ArrVal_2950 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse9 .cse10 v_ArrVal_2940)))) (let ((.cse4 (store (select .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse8 v_ArrVal_2941))) (let ((.cse5 (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse6) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2946)) (.cse1 (store .cse5 |v_ULTIMATE.start_dll_update_at_~head#1.offset_98| v_ArrVal_2947))) (or (< (select v_ArrVal_2946 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_95|) (not (= v_ArrVal_2950 (store (select .cse0 (select .cse1 4)) |v_ULTIMATE.start_dll_update_at_~head#1.offset_95| (select v_ArrVal_2950 |v_ULTIMATE.start_dll_update_at_~head#1.offset_95|)))) (= (select (let ((.cse2 (select .cse5 4))) (select (store .cse0 .cse2 v_ArrVal_2950) (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1))) (store .cse3 .cse2 (store (select .cse3 .cse2) |v_ULTIMATE.start_dll_update_at_~head#1.offset_95| v_ArrVal_2948))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) 4) 0))))))) (not (= (store (select (store .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse6) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_98| (select v_ArrVal_2946 |v_ULTIMATE.start_dll_update_at_~head#1.offset_98|)) v_ArrVal_2946)))))) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_98|))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_ArrVal_2935))) (forall ((v_ArrVal_2935 Int)) (or (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_95| Int) (v_ArrVal_2948 Int) (v_ArrVal_2947 Int) (v_ArrVal_2939 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_98| Int) (v_ArrVal_2940 Int) (v_ArrVal_2942 Int) (v_ArrVal_2941 Int)) (or (= (select (let ((.cse14 (let ((.cse19 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse9 .cse10 v_ArrVal_2940)))) (let ((.cse18 (store (select .cse19 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse8 v_ArrVal_2941))) (let ((.cse17 (store (select (store .cse19 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse18) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_98| v_ArrVal_2947))) (let ((.cse15 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse18) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse17)) (.cse16 (select .cse17 4))) (store .cse15 .cse16 (store (select .cse15 .cse16) |v_ULTIMATE.start_dll_update_at_~head#1.offset_95| v_ArrVal_2948)))))))) (select .cse14 (select (select .cse14 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) 4) 0) (< (select (select (let ((.cse20 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store .cse12 .cse13 v_ArrVal_2935) .cse10 v_ArrVal_2939)))) (store .cse20 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse20 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse8 v_ArrVal_2942))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_95|) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_98|))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_ArrVal_2935)))))) is different from false [2025-03-08 23:10:53,607 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:10:53,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 467 treesize of output 284 [2025-03-08 23:10:53,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:10:53,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 40 [2025-03-08 23:10:53,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:10:53,672 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 2 case distinctions, treesize of input 430 treesize of output 406 [2025-03-08 23:10:53,692 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:10:53,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 363 treesize of output 239 [2025-03-08 23:10:53,753 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_95| Int) (v_ArrVal_2948 Int) (v_ArrVal_2947 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_98| Int) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (v_ArrVal_2942 Int) (v_ArrVal_2941 Int)) (or (< (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_28))) (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1 v_ArrVal_2942))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_95|) (= (select (let ((.cse2 (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_27))) (let ((.cse6 (store (select .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1 v_ArrVal_2941))) (let ((.cse5 (store (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse6) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_98| v_ArrVal_2947))) (let ((.cse3 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse6) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse5)) (.cse4 (select .cse5 4))) (store .cse3 .cse4 (store (select .cse3 .cse4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_95| v_ArrVal_2948)))))))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) 4) 0) (not (= (select v_arrayElimArr_27 .cse8) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_28 .cse8)) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_98|))) (forall ((v_ArrVal_2946 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_95| Int) (v_ArrVal_2948 Int) (v_ArrVal_2947 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_98| Int) (v_ArrVal_2950 (Array Int Int)) (v_arrayElimArr_29 (Array Int Int)) (v_ArrVal_2942 Int) (v_ArrVal_2941 Int) (v_arrayElimArr_30 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_30))) (let ((.cse9 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_29)) (.cse15 (store (select .cse17 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1 v_ArrVal_2941))) (let ((.cse16 (select (store .cse17 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse15) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse10 (store (select .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1 v_ArrVal_2942))) (let ((.cse11 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse10) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2946)) (.cse12 (store .cse16 |v_ULTIMATE.start_dll_update_at_~head#1.offset_98| v_ArrVal_2947))) (or (< (select v_ArrVal_2946 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_95|) (not (= (store (select (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse10) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_98| (select v_ArrVal_2946 |v_ULTIMATE.start_dll_update_at_~head#1.offset_98|)) v_ArrVal_2946)) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_29 .cse8)) (not (= (store (select .cse11 (select .cse12 4)) |v_ULTIMATE.start_dll_update_at_~head#1.offset_95| (select v_ArrVal_2950 |v_ULTIMATE.start_dll_update_at_~head#1.offset_95|)) v_ArrVal_2950)) (= (select (let ((.cse13 (select .cse16 4))) (select (store .cse11 .cse13 v_ArrVal_2950) (select (select (let ((.cse14 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse15) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse12))) (store .cse14 .cse13 (store (select .cse14 .cse13) |v_ULTIMATE.start_dll_update_at_~head#1.offset_95| v_ArrVal_2948))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) 4) 0) (not (= (select v_arrayElimArr_30 .cse8) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_98|))))))))) is different from false [2025-03-08 23:10:55,856 INFO L349 Elim1Store]: treesize reduction 810, result has 50.2 percent of original size [2025-03-08 23:10:55,857 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 4 new quantified variables, introduced 7 case distinctions, treesize of input 7958 treesize of output 8238 [2025-03-08 23:10:55,932 INFO L349 Elim1Store]: treesize reduction 22, result has 65.6 percent of original size [2025-03-08 23:10:55,932 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 18356 treesize of output 11867 [2025-03-08 23:10:56,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:10:56,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:10:56,272 INFO L349 Elim1Store]: treesize reduction 62, result has 66.8 percent of original size [2025-03-08 23:10:56,273 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 4 new quantified variables, introduced 13 case distinctions, treesize of input 4403 treesize of output 4344 [2025-03-08 23:10:56,433 INFO L349 Elim1Store]: treesize reduction 10, result has 76.7 percent of original size [2025-03-08 23:10:56,434 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 5 case distinctions, treesize of input 13477 treesize of output 12876 [2025-03-08 23:10:56,806 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:10:56,821 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 14956 treesize of output 13926 [2025-03-08 23:10:57,445 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:10:57,555 INFO L349 Elim1Store]: treesize reduction 102, result has 37.4 percent of original size [2025-03-08 23:10:57,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 1129 treesize of output 1224 [2025-03-08 23:10:58,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:10:58,525 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 1 case distinctions, treesize of input 18 treesize of output 8 [2025-03-08 23:10:58,526 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 8 treesize of output 4 [2025-03-08 23:10:59,181 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:10:59,181 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:10:59,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:10:59,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 17 [2025-03-08 23:10:59,240 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2025-03-08 23:10:59,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 64 treesize of output 76 [2025-03-08 23:10:59,267 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 8 treesize of output 6 [2025-03-08 23:10:59,540 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:10:59,547 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:10:59,621 INFO L349 Elim1Store]: treesize reduction 147, result has 27.6 percent of original size [2025-03-08 23:10:59,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 251 treesize of output 276 [2025-03-08 23:10:59,638 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:10:59,676 INFO L349 Elim1Store]: treesize reduction 109, result has 13.5 percent of original size [2025-03-08 23:10:59,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 242 treesize of output 223 [2025-03-08 23:11:00,441 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:11:00,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 13 [2025-03-08 23:11:00,469 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:11:00,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 15 [2025-03-08 23:11:00,489 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-08 23:11:00,490 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 19 treesize of output 13 [2025-03-08 23:11:00,503 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:11:00,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 10 [2025-03-08 23:11:00,540 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2025-03-08 23:11:00,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 21 [2025-03-08 23:11:00,635 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:11:00,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1051 treesize of output 1041 [2025-03-08 23:11:00,943 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:11:01,063 INFO L349 Elim1Store]: treesize reduction 237, result has 27.1 percent of original size [2025-03-08 23:11:01,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 16 case distinctions, treesize of input 36194 treesize of output 27805 [2025-03-08 23:11:01,099 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:11:01,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:11:01,137 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 731 treesize of output 744 [2025-03-08 23:11:01,151 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:11:01,158 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 787 treesize of output 689 [2025-03-08 23:11:01,184 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:11:01,196 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 11 treesize of output 7 [2025-03-08 23:11:01,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:11:01,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 18 treesize of output 8 [2025-03-08 23:11:01,304 INFO L349 Elim1Store]: treesize reduction 32, result has 54.3 percent of original size [2025-03-08 23:11:01,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 180 treesize of output 201 [2025-03-08 23:11:01,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:11:01,378 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 62 treesize of output 64