./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/dll2n_update_all.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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-?-c00e63d-m [2025-02-06 10:38:52,729 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:38:52,766 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 10:38:52,770 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:38:52,770 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:38:52,784 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:38:52,785 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:38:52,785 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:38:52,786 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:38:52,786 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:38:52,786 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:38:52,786 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:38:52,786 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:38:52,786 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:38:52,786 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:38:52,787 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:38:52,787 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:38:52,787 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:38:52,787 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:38:52,787 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:38:52,787 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:38:52,787 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:38:52,787 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:38:52,787 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:38:52,787 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:38:52,787 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:38:52,787 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:38:52,788 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:38:52,788 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:38:52,788 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:38:52,788 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:38:52,788 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:38:52,788 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:38:52,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:38:52,788 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:38:52,788 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:38:52,788 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:38:52,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:38:52,789 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:38:52,789 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:38:52,789 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:38:52,789 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:38:52,789 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-jdk21/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-02-06 10:38:52,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:38:52,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:38:53,002 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:38:53,003 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:38:53,004 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:38:53,005 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_update_all.i [2025-02-06 10:38:54,338 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/787fab5e2/3759a955ebde427abdfb79404a724036/FLAGc696b4032 [2025-02-06 10:38:54,639 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:38:54,640 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_update_all.i [2025-02-06 10:38:54,652 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/787fab5e2/3759a955ebde427abdfb79404a724036/FLAGc696b4032 [2025-02-06 10:38:54,668 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/787fab5e2/3759a955ebde427abdfb79404a724036 [2025-02-06 10:38:54,670 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:38:54,672 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:38:54,674 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:38:54,675 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:38:54,678 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:38:54,678 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:38:54" (1/1) ... [2025-02-06 10:38:54,679 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76e5710d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:38:54, skipping insertion in model container [2025-02-06 10:38:54,679 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:38:54" (1/1) ... [2025-02-06 10:38:54,711 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:38:54,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:38:54,947 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:38:54,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:38:55,002 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:38:55,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:38:55 WrapperNode [2025-02-06 10:38:55,002 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:38:55,003 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:38:55,003 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:38:55,003 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:38:55,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:38:55" (1/1) ... [2025-02-06 10:38:55,021 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:38:55" (1/1) ... [2025-02-06 10:38:55,037 INFO L138 Inliner]: procedures = 126, calls = 28, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 102 [2025-02-06 10:38:55,039 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:38:55,040 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:38:55,040 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:38:55,040 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:38:55,044 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:38:55" (1/1) ... [2025-02-06 10:38:55,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:38:55" (1/1) ... [2025-02-06 10:38:55,048 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:38:55" (1/1) ... [2025-02-06 10:38:55,066 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-02-06 10:38:55,067 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:38:55" (1/1) ... [2025-02-06 10:38:55,067 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:38:55" (1/1) ... [2025-02-06 10:38:55,074 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:38:55" (1/1) ... [2025-02-06 10:38:55,078 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:38:55" (1/1) ... [2025-02-06 10:38:55,079 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:38:55" (1/1) ... [2025-02-06 10:38:55,079 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:38:55" (1/1) ... [2025-02-06 10:38:55,081 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:38:55,085 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:38:55,086 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:38:55,086 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:38:55,086 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:38:55" (1/1) ... [2025-02-06 10:38:55,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:38:55,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:38:55,110 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 10:38:55,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 10:38:55,130 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-02-06 10:38:55,130 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-02-06 10:38:55,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 10:38:55,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 10:38:55,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 10:38:55,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 10:38:55,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 10:38:55,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:38:55,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 10:38:55,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 10:38:55,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 10:38:55,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 10:38:55,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:38:55,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 10:38:55,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 10:38:55,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:38:55,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:38:55,207 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:38:55,208 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:38:55,224 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-02-06 10:38:55,362 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L615: havoc dll_get_data_at_#t~mem9#1; [2025-02-06 10:38:55,372 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2025-02-06 10:38:55,372 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:38:55,378 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:38:55,378 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:38:55,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:38:55 BoogieIcfgContainer [2025-02-06 10:38:55,378 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:38:55,380 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:38:55,380 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:38:55,383 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:38:55,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:38:54" (1/3) ... [2025-02-06 10:38:55,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b2545aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:38:55, skipping insertion in model container [2025-02-06 10:38:55,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:38:55" (2/3) ... [2025-02-06 10:38:55,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b2545aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:38:55, skipping insertion in model container [2025-02-06 10:38:55,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:38:55" (3/3) ... [2025-02-06 10:38:55,385 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2n_update_all.i [2025-02-06 10:38:55,394 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:38:55,395 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-02-06 10:38:55,419 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:38:55,426 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;@3a73d40f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:38:55,426 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-02-06 10:38:55,428 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-02-06 10:38:55,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-06 10:38:55,432 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:55,432 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 10:38:55,432 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-02-06 10:38:55,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:55,435 INFO L85 PathProgramCache]: Analyzing trace with hash 106850348, now seen corresponding path program 1 times [2025-02-06 10:38:55,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:55,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790817812] [2025-02-06 10:38:55,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:55,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:55,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 10:38:55,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 10:38:55,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:55,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:55,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:38:55,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:55,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790817812] [2025-02-06 10:38:55,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790817812] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:38:55,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:38:55,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:38:55,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060023500] [2025-02-06 10:38:55,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:38:55,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:38:55,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:55,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:38:55,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:38:55,586 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-02-06 10:38:55,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:55,651 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2025-02-06 10:38:55,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:38:55,652 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-02-06 10:38:55,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:55,657 INFO L225 Difference]: With dead ends: 61 [2025-02-06 10:38:55,657 INFO L226 Difference]: Without dead ends: 56 [2025-02-06 10:38:55,659 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-02-06 10:38:55,661 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.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:55,663 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.1s Time] [2025-02-06 10:38:55,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-06 10:38:55,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-02-06 10:38:55,682 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-02-06 10:38:55,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2025-02-06 10:38:55,685 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 5 [2025-02-06 10:38:55,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:55,685 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2025-02-06 10:38:55,686 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-02-06 10:38:55,686 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2025-02-06 10:38:55,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-06 10:38:55,686 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:55,686 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 10:38:55,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:38:55,686 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-02-06 10:38:55,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:55,687 INFO L85 PathProgramCache]: Analyzing trace with hash 106850349, now seen corresponding path program 1 times [2025-02-06 10:38:55,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:55,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632031905] [2025-02-06 10:38:55,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:55,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:55,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 10:38:55,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 10:38:55,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:55,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:55,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:38:55,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:55,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632031905] [2025-02-06 10:38:55,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632031905] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:38:55,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:38:55,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:38:55,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715189886] [2025-02-06 10:38:55,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:38:55,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:38:55,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:55,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:38:55,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:38:55,754 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-02-06 10:38:55,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:55,783 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2025-02-06 10:38:55,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:38:55,784 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-02-06 10:38:55,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:55,784 INFO L225 Difference]: With dead ends: 53 [2025-02-06 10:38:55,784 INFO L226 Difference]: Without dead ends: 53 [2025-02-06 10:38:55,784 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-02-06 10:38:55,785 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-02-06 10:38:55,785 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-02-06 10:38:55,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-06 10:38:55,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-02-06 10:38:55,787 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-02-06 10:38:55,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2025-02-06 10:38:55,788 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 5 [2025-02-06 10:38:55,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:55,788 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2025-02-06 10:38:55,788 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-02-06 10:38:55,788 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2025-02-06 10:38:55,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:38:55,789 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:55,789 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:55,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:38:55,789 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-02-06 10:38:55,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:55,789 INFO L85 PathProgramCache]: Analyzing trace with hash -414187942, now seen corresponding path program 1 times [2025-02-06 10:38:55,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:55,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023235656] [2025-02-06 10:38:55,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:55,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:55,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:38:55,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:38:55,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:55,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:55,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:38:55,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:55,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023235656] [2025-02-06 10:38:55,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023235656] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:38:55,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:38:55,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:38:55,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277315385] [2025-02-06 10:38:55,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:38:55,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:38:55,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:55,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:38:55,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:38:55,837 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-02-06 10:38:55,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:55,846 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2025-02-06 10:38:55,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:38:55,847 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-02-06 10:38:55,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:55,847 INFO L225 Difference]: With dead ends: 63 [2025-02-06 10:38:55,847 INFO L226 Difference]: Without dead ends: 63 [2025-02-06 10:38:55,847 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-02-06 10:38:55,848 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-02-06 10:38:55,848 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-02-06 10:38:55,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-06 10:38:55,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2025-02-06 10:38:55,852 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-02-06 10:38:55,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2025-02-06 10:38:55,852 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 7 [2025-02-06 10:38:55,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:55,852 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2025-02-06 10:38:55,852 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-02-06 10:38:55,853 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2025-02-06 10:38:55,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 10:38:55,853 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:55,853 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:55,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:38:55,853 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-02-06 10:38:55,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:55,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1667868806, now seen corresponding path program 1 times [2025-02-06 10:38:55,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:55,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870598827] [2025-02-06 10:38:55,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:55,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:55,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 10:38:55,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 10:38:55,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:55,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:55,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:38:55,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:55,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870598827] [2025-02-06 10:38:55,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870598827] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:38:55,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:38:55,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:38:55,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800670252] [2025-02-06 10:38:55,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:38:55,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:38:55,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:55,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:38:55,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:38:55,917 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-02-06 10:38:55,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:55,935 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2025-02-06 10:38:55,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:38:55,936 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-02-06 10:38:55,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:55,936 INFO L225 Difference]: With dead ends: 59 [2025-02-06 10:38:55,936 INFO L226 Difference]: Without dead ends: 59 [2025-02-06 10:38:55,936 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-02-06 10:38:55,937 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-02-06 10:38:55,937 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-02-06 10:38:55,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-06 10:38:55,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-02-06 10:38:55,940 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-02-06 10:38:55,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2025-02-06 10:38:55,941 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 9 [2025-02-06 10:38:55,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:55,941 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2025-02-06 10:38:55,941 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-02-06 10:38:55,941 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2025-02-06 10:38:55,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 10:38:55,941 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:55,942 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:55,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:38:55,942 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-02-06 10:38:55,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:55,942 INFO L85 PathProgramCache]: Analyzing trace with hash 503091607, now seen corresponding path program 1 times [2025-02-06 10:38:55,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:55,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860134175] [2025-02-06 10:38:55,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:55,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:55,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 10:38:55,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 10:38:55,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:55,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:56,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:38:56,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:56,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860134175] [2025-02-06 10:38:56,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860134175] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:56,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563508043] [2025-02-06 10:38:56,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:56,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:56,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:38:56,059 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:38:56,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 10:38:56,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 10:38:56,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 10:38:56,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:56,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:56,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 10:38:56,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:38:56,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:38:56,169 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:38:56,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:38:56,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563508043] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:38:56,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:38:56,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-02-06 10:38:56,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374491901] [2025-02-06 10:38:56,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:38:56,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:38:56,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:56,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:38:56,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:38:56,191 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-02-06 10:38:56,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:56,205 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2025-02-06 10:38:56,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:38:56,205 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-02-06 10:38:56,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:56,206 INFO L225 Difference]: With dead ends: 61 [2025-02-06 10:38:56,206 INFO L226 Difference]: Without dead ends: 61 [2025-02-06 10:38:56,206 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-02-06 10:38:56,206 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-02-06 10:38:56,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-02-06 10:38:56,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-06 10:38:56,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-02-06 10:38:56,209 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-02-06 10:38:56,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2025-02-06 10:38:56,209 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 14 [2025-02-06 10:38:56,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:56,209 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2025-02-06 10:38:56,210 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-02-06 10:38:56,210 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2025-02-06 10:38:56,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 10:38:56,210 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:56,210 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:56,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 10:38:56,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:56,412 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-02-06 10:38:56,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:56,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1589747581, now seen corresponding path program 1 times [2025-02-06 10:38:56,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:56,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738129542] [2025-02-06 10:38:56,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:56,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:56,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:38:56,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:38:56,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:56,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:56,587 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:38:56,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:56,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738129542] [2025-02-06 10:38:56,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738129542] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:56,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544743851] [2025-02-06 10:38:56,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:56,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:56,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:38:56,589 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:38:56,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 10:38:56,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:38:56,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:38:56,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:56,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:56,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 10:38:56,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:38:56,687 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-02-06 10:38:56,710 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-06 10:38:56,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-02-06 10:38:56,725 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:38:56,726 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:38:56,759 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:38:56,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544743851] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:38:56,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:38:56,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2025-02-06 10:38:56,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73040636] [2025-02-06 10:38:56,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:38:56,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:38:56,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:56,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:38:56,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:38:56,762 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-02-06 10:38:56,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:56,829 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2025-02-06 10:38:56,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:38:56,829 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-02-06 10:38:56,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:56,830 INFO L225 Difference]: With dead ends: 60 [2025-02-06 10:38:56,830 INFO L226 Difference]: Without dead ends: 60 [2025-02-06 10:38:56,830 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-02-06 10:38:56,831 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-02-06 10:38:56,831 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-02-06 10:38:56,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-02-06 10:38:56,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-02-06 10:38:56,833 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-02-06 10:38:56,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2025-02-06 10:38:56,833 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 16 [2025-02-06 10:38:56,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:56,834 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2025-02-06 10:38:56,834 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-02-06 10:38:56,834 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2025-02-06 10:38:56,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 10:38:56,834 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:56,834 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:56,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 10:38:57,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:57,035 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-02-06 10:38:57,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:57,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1589747580, now seen corresponding path program 1 times [2025-02-06 10:38:57,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:57,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006809960] [2025-02-06 10:38:57,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:57,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:57,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:38:57,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:38:57,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:57,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:57,214 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:38:57,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:57,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006809960] [2025-02-06 10:38:57,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006809960] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:57,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795587171] [2025-02-06 10:38:57,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:57,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:57,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:38:57,217 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:38:57,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 10:38:57,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:38:57,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:38:57,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:57,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:57,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 10:38:57,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:38:57,291 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-02-06 10:38:57,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:38:57,333 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-02-06 10:38:57,340 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:38:57,340 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-02-06 10:38:57,359 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:38:57,360 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:38:57,485 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-02-06 10:38:57,523 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:38:57,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795587171] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:38:57,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:38:57,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2025-02-06 10:38:57,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911565064] [2025-02-06 10:38:57,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:38:57,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 10:38:57,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:57,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 10:38:57,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:38:57,525 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-02-06 10:38:57,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:57,623 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2025-02-06 10:38:57,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:38:57,623 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-02-06 10:38:57,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:57,624 INFO L225 Difference]: With dead ends: 59 [2025-02-06 10:38:57,624 INFO L226 Difference]: Without dead ends: 59 [2025-02-06 10:38:57,624 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-02-06 10:38:57,625 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-02-06 10:38:57,625 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-02-06 10:38:57,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-06 10:38:57,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-02-06 10:38:57,627 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-02-06 10:38:57,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2025-02-06 10:38:57,627 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 16 [2025-02-06 10:38:57,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:57,628 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2025-02-06 10:38:57,628 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-02-06 10:38:57,628 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2025-02-06 10:38:57,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 10:38:57,628 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:57,628 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:57,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 10:38:57,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:57,829 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-02-06 10:38:57,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:57,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1530679226, now seen corresponding path program 2 times [2025-02-06 10:38:57,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:57,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782625889] [2025-02-06 10:38:57,830 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:38:57,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:57,840 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-06 10:38:57,841 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 21 statements. [2025-02-06 10:38:57,841 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 10:38:57,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:57,856 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:38:57,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:57,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782625889] [2025-02-06 10:38:57,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782625889] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:38:57,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:38:57,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:38:57,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777705310] [2025-02-06 10:38:57,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:38:57,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:38:57,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:57,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:38:57,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:38:57,858 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-02-06 10:38:57,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:57,877 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2025-02-06 10:38:57,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:38:57,877 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-02-06 10:38:57,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:57,878 INFO L225 Difference]: With dead ends: 81 [2025-02-06 10:38:57,878 INFO L226 Difference]: Without dead ends: 81 [2025-02-06 10:38:57,878 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-02-06 10:38:57,878 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-02-06 10:38:57,878 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-02-06 10:38:57,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-06 10:38:57,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 61. [2025-02-06 10:38:57,880 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-02-06 10:38:57,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2025-02-06 10:38:57,881 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 21 [2025-02-06 10:38:57,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:57,881 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2025-02-06 10:38:57,881 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-02-06 10:38:57,881 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2025-02-06 10:38:57,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 10:38:57,881 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:57,882 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:57,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 10:38:57,882 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-02-06 10:38:57,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:57,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1530679253, now seen corresponding path program 1 times [2025-02-06 10:38:57,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:57,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658630737] [2025-02-06 10:38:57,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:57,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:57,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 10:38:57,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 10:38:57,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:57,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:57,934 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:38:57,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:57,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658630737] [2025-02-06 10:38:57,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658630737] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:57,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993113602] [2025-02-06 10:38:57,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:57,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:57,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:38:57,937 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:38:57,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 10:38:58,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 10:38:58,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 10:38:58,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:58,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:58,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 10:38:58,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:38:58,044 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:38:58,045 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:38:58,061 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:38:58,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993113602] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:38:58,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:38:58,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-02-06 10:38:58,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092652782] [2025-02-06 10:38:58,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:38:58,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:38:58,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:58,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:38:58,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:38:58,063 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-02-06 10:38:58,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:58,096 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2025-02-06 10:38:58,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:38:58,097 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-02-06 10:38:58,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:58,097 INFO L225 Difference]: With dead ends: 61 [2025-02-06 10:38:58,098 INFO L226 Difference]: Without dead ends: 61 [2025-02-06 10:38:58,098 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-02-06 10:38:58,098 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-02-06 10:38:58,099 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-02-06 10:38:58,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-06 10:38:58,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-02-06 10:38:58,105 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-02-06 10:38:58,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2025-02-06 10:38:58,105 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 21 [2025-02-06 10:38:58,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:58,105 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2025-02-06 10:38:58,105 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-02-06 10:38:58,105 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2025-02-06 10:38:58,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 10:38:58,106 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:58,106 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:58,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 10:38:58,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-06 10:38:58,310 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-02-06 10:38:58,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:58,311 INFO L85 PathProgramCache]: Analyzing trace with hash -618382855, now seen corresponding path program 1 times [2025-02-06 10:38:58,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:58,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282732982] [2025-02-06 10:38:58,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:58,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:58,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 10:38:58,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 10:38:58,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:58,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:58,415 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:38:58,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:58,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282732982] [2025-02-06 10:38:58,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282732982] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:38:58,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:38:58,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:38:58,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248800260] [2025-02-06 10:38:58,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:38:58,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:38:58,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:58,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:38:58,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:38:58,417 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-02-06 10:38:58,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:58,536 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2025-02-06 10:38:58,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:38:58,536 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-02-06 10:38:58,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:58,536 INFO L225 Difference]: With dead ends: 64 [2025-02-06 10:38:58,536 INFO L226 Difference]: Without dead ends: 64 [2025-02-06 10:38:58,537 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-02-06 10:38:58,537 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-02-06 10:38:58,537 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-02-06 10:38:58,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-06 10:38:58,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-02-06 10:38:58,539 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-02-06 10:38:58,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2025-02-06 10:38:58,539 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 22 [2025-02-06 10:38:58,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:58,539 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2025-02-06 10:38:58,539 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-02-06 10:38:58,539 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2025-02-06 10:38:58,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 10:38:58,542 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:58,542 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:58,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 10:38:58,543 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-02-06 10:38:58,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:58,543 INFO L85 PathProgramCache]: Analyzing trace with hash -618382854, now seen corresponding path program 1 times [2025-02-06 10:38:58,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:58,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866066535] [2025-02-06 10:38:58,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:58,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:58,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 10:38:58,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 10:38:58,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:58,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:58,752 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:38:58,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:58,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866066535] [2025-02-06 10:38:58,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866066535] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:38:58,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:38:58,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:38:58,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872701053] [2025-02-06 10:38:58,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:38:58,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:38:58,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:58,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:38:58,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:38:58,755 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-02-06 10:38:58,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:58,872 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2025-02-06 10:38:58,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:38:58,873 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-02-06 10:38:58,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:58,873 INFO L225 Difference]: With dead ends: 64 [2025-02-06 10:38:58,873 INFO L226 Difference]: Without dead ends: 64 [2025-02-06 10:38:58,873 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-02-06 10:38:58,874 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-02-06 10:38:58,874 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-02-06 10:38:58,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-06 10:38:58,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-02-06 10:38:58,876 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-02-06 10:38:58,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2025-02-06 10:38:58,876 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 22 [2025-02-06 10:38:58,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:58,876 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2025-02-06 10:38:58,876 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-02-06 10:38:58,877 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2025-02-06 10:38:58,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-06 10:38:58,877 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:58,877 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:58,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 10:38:58,877 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-02-06 10:38:58,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:58,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1990356604, now seen corresponding path program 1 times [2025-02-06 10:38:58,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:58,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466368263] [2025-02-06 10:38:58,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:58,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:58,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 10:38:58,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 10:38:58,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:58,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:58,938 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:38:58,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:58,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466368263] [2025-02-06 10:38:58,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466368263] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:38:58,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:38:58,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:38:58,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072629550] [2025-02-06 10:38:58,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:38:58,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:38:58,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:58,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:38:58,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:38:58,939 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-02-06 10:38:58,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:58,950 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2025-02-06 10:38:58,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:38:58,951 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-02-06 10:38:58,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:58,951 INFO L225 Difference]: With dead ends: 82 [2025-02-06 10:38:58,951 INFO L226 Difference]: Without dead ends: 82 [2025-02-06 10:38:58,951 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-02-06 10:38:58,952 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-02-06 10:38:58,952 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-02-06 10:38:58,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-06 10:38:58,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 65. [2025-02-06 10:38:58,954 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-02-06 10:38:58,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2025-02-06 10:38:58,954 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 23 [2025-02-06 10:38:58,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:58,954 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2025-02-06 10:38:58,954 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-02-06 10:38:58,954 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2025-02-06 10:38:58,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 10:38:58,955 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:58,955 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-02-06 10:38:58,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 10:38:58,955 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-02-06 10:38:58,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:58,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1770240213, now seen corresponding path program 1 times [2025-02-06 10:38:58,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:58,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416496367] [2025-02-06 10:38:58,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:58,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:58,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 10:38:58,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 10:38:58,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:58,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:59,017 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 10:38:59,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:59,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416496367] [2025-02-06 10:38:59,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416496367] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:38:59,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:38:59,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:38:59,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959387651] [2025-02-06 10:38:59,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:38:59,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:38:59,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:59,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:38:59,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:38:59,018 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-02-06 10:38:59,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:59,038 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2025-02-06 10:38:59,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:38:59,038 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-02-06 10:38:59,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:59,038 INFO L225 Difference]: With dead ends: 78 [2025-02-06 10:38:59,039 INFO L226 Difference]: Without dead ends: 78 [2025-02-06 10:38:59,039 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-02-06 10:38:59,039 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-02-06 10:38:59,039 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-02-06 10:38:59,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-06 10:38:59,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 66. [2025-02-06 10:38:59,041 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-02-06 10:38:59,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2025-02-06 10:38:59,041 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 27 [2025-02-06 10:38:59,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:59,041 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2025-02-06 10:38:59,042 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-02-06 10:38:59,042 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2025-02-06 10:38:59,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 10:38:59,042 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:59,042 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-02-06 10:38:59,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 10:38:59,042 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-02-06 10:38:59,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:59,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1770240240, now seen corresponding path program 1 times [2025-02-06 10:38:59,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:59,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655788474] [2025-02-06 10:38:59,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:59,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:59,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 10:38:59,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 10:38:59,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:59,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:59,156 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 10:38:59,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:59,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655788474] [2025-02-06 10:38:59,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655788474] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:38:59,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:38:59,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:38:59,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121683223] [2025-02-06 10:38:59,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:38:59,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:38:59,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:59,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:38:59,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:38:59,158 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-02-06 10:38:59,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:59,264 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2025-02-06 10:38:59,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:38:59,265 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-02-06 10:38:59,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:59,265 INFO L225 Difference]: With dead ends: 69 [2025-02-06 10:38:59,265 INFO L226 Difference]: Without dead ends: 69 [2025-02-06 10:38:59,265 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-02-06 10:38:59,266 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-02-06 10:38:59,266 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-02-06 10:38:59,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-06 10:38:59,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-02-06 10:38:59,268 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-02-06 10:38:59,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2025-02-06 10:38:59,268 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 27 [2025-02-06 10:38:59,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:59,268 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2025-02-06 10:38:59,268 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-02-06 10:38:59,268 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2025-02-06 10:38:59,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 10:38:59,269 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:59,269 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-02-06 10:38:59,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 10:38:59,269 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-02-06 10:38:59,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:59,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1770240241, now seen corresponding path program 1 times [2025-02-06 10:38:59,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:59,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808833126] [2025-02-06 10:38:59,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:59,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:59,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 10:38:59,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 10:38:59,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:59,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:59,342 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:38:59,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:59,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808833126] [2025-02-06 10:38:59,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808833126] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:59,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075943801] [2025-02-06 10:38:59,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:59,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:59,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:38:59,345 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:38:59,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 10:38:59,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 10:38:59,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 10:38:59,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:59,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:59,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 10:38:59,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:38:59,490 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:38:59,490 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:38:59,527 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:38:59,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075943801] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:38:59,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:38:59,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-06 10:38:59,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315375234] [2025-02-06 10:38:59,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:38:59,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:38:59,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:59,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:38:59,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:38:59,528 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-02-06 10:38:59,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:59,553 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2025-02-06 10:38:59,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:38:59,554 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-02-06 10:38:59,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:59,554 INFO L225 Difference]: With dead ends: 82 [2025-02-06 10:38:59,554 INFO L226 Difference]: Without dead ends: 82 [2025-02-06 10:38:59,554 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-02-06 10:38:59,555 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-02-06 10:38:59,555 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-02-06 10:38:59,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-06 10:38:59,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2025-02-06 10:38:59,556 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-02-06 10:38:59,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2025-02-06 10:38:59,557 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 27 [2025-02-06 10:38:59,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:59,557 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2025-02-06 10:38:59,557 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-02-06 10:38:59,557 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2025-02-06 10:38:59,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 10:38:59,558 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:59,558 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-02-06 10:38:59,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 10:38:59,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-06 10:38:59,759 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-02-06 10:38:59,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:59,759 INFO L85 PathProgramCache]: Analyzing trace with hash 718230867, now seen corresponding path program 1 times [2025-02-06 10:38:59,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:59,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625023798] [2025-02-06 10:38:59,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:59,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:59,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 10:38:59,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:38:59,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:59,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:59,856 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:38:59,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:59,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625023798] [2025-02-06 10:38:59,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625023798] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:59,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265276257] [2025-02-06 10:38:59,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:59,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:59,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:38:59,859 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:38:59,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 10:38:59,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 10:38:59,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:38:59,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:59,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:59,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 10:38:59,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:38:59,976 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:38:59,976 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:38:59,994 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:38:59,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265276257] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:38:59,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:38:59,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2025-02-06 10:38:59,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836121675] [2025-02-06 10:38:59,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:38:59,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:38:59,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:59,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:38:59,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:38:59,996 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-02-06 10:39:00,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:00,034 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2025-02-06 10:39:00,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:39:00,035 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-02-06 10:39:00,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:00,035 INFO L225 Difference]: With dead ends: 109 [2025-02-06 10:39:00,035 INFO L226 Difference]: Without dead ends: 109 [2025-02-06 10:39:00,036 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-02-06 10:39:00,036 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-02-06 10:39:00,036 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-02-06 10:39:00,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-02-06 10:39:00,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 81. [2025-02-06 10:39:00,038 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-02-06 10:39:00,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2025-02-06 10:39:00,039 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 29 [2025-02-06 10:39:00,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:00,039 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2025-02-06 10:39:00,039 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-02-06 10:39:00,039 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2025-02-06 10:39:00,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 10:39:00,039 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:00,039 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-02-06 10:39:00,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 10:39:00,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-06 10:39:00,240 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-02-06 10:39:00,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:00,241 INFO L85 PathProgramCache]: Analyzing trace with hash 718230894, now seen corresponding path program 1 times [2025-02-06 10:39:00,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:00,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957293790] [2025-02-06 10:39:00,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:00,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:00,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 10:39:00,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:39:00,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:00,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:00,719 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:39:00,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:00,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957293790] [2025-02-06 10:39:00,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957293790] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:39:00,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419520588] [2025-02-06 10:39:00,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:00,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:00,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:39:00,721 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:39:00,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 10:39:00,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 10:39:00,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:39:00,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:00,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:00,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-02-06 10:39:00,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:39:00,840 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-02-06 10:39:00,871 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:39:00,871 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-02-06 10:39:00,886 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-02-06 10:39:00,905 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-02-06 10:39:00,919 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 10:39:00,919 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-02-06 10:39:01,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:39:01,033 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-02-06 10:39:01,066 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-02-06 10:39:01,070 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:39:01,070 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:39:13,280 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-02-06 10:39:13,281 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-02-06 10:39:14,029 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-02-06 10:39:14,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:14,037 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-02-06 10:39:14,039 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-02-06 10:39:14,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-06 10:39:14,095 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2025-02-06 10:39:14,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419520588] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:39:14,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:39:14,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 32 [2025-02-06 10:39:14,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271337598] [2025-02-06 10:39:14,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:39:14,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-02-06 10:39:14,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:14,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-02-06 10:39:14,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=892, Unknown=11, NotChecked=60, Total=1056 [2025-02-06 10:39:14,097 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-02-06 10:39:14,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:14,775 INFO L93 Difference]: Finished difference Result 130 states and 155 transitions. [2025-02-06 10:39:14,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 10:39:14,776 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-02-06 10:39:14,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:14,777 INFO L225 Difference]: With dead ends: 130 [2025-02-06 10:39:14,777 INFO L226 Difference]: Without dead ends: 130 [2025-02-06 10:39:14,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=211, Invalid=1588, Unknown=11, NotChecked=82, Total=1892 [2025-02-06 10:39:14,779 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 87 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:39:14,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 618 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 808 Invalid, 0 Unknown, 68 Unchecked, 0.4s Time] [2025-02-06 10:39:14,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-02-06 10:39:14,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 90. [2025-02-06 10:39:14,783 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-02-06 10:39:14,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 107 transitions. [2025-02-06 10:39:14,783 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 107 transitions. Word has length 29 [2025-02-06 10:39:14,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:14,783 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 107 transitions. [2025-02-06 10:39:14,783 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-02-06 10:39:14,783 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 107 transitions. [2025-02-06 10:39:14,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 10:39:14,785 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:14,785 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-02-06 10:39:14,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 10:39:14,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:14,986 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-02-06 10:39:14,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:14,987 INFO L85 PathProgramCache]: Analyzing trace with hash 718230895, now seen corresponding path program 1 times [2025-02-06 10:39:14,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:14,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988891920] [2025-02-06 10:39:14,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:14,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:15,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 10:39:15,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:39:15,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:15,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:15,625 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:39:15,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:15,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988891920] [2025-02-06 10:39:15,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988891920] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:39:15,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620505520] [2025-02-06 10:39:15,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:15,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:15,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:39:15,627 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:39:15,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 10:39:15,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 10:39:15,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:39:15,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:15,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:15,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-02-06 10:39:15,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:39:15,741 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-02-06 10:39:15,792 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:39:15,792 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-02-06 10:39:15,816 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-02-06 10:39:15,822 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-02-06 10:39:15,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 29 treesize of output 13 [2025-02-06 10:39:15,856 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-02-06 10:39:15,877 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 10:39:15,877 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-02-06 10:39:15,885 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-02-06 10:39:16,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:39:16,069 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-02-06 10:39:16,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:39:16,074 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-02-06 10:39:16,126 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-02-06 10:39:16,129 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-02-06 10:39:16,183 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:39:16,183 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:39:16,350 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-02-06 10:39:16,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:16,557 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-02-06 10:39:16,673 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-02-06 10:39:16,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:16,682 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-02-06 10:39:16,684 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-02-06 10:39:16,686 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-02-06 10:39:16,692 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:16,692 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-02-06 10:39:16,694 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:16,695 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-02-06 10:39:16,700 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2025-02-06 10:39:16,700 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-02-06 10:39:16,812 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2025-02-06 10:39:16,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620505520] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:39:16,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:39:16,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 38 [2025-02-06 10:39:16,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909800152] [2025-02-06 10:39:16,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:39:16,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-02-06 10:39:16,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:16,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-02-06 10:39:16,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1217, Unknown=15, NotChecked=142, Total=1482 [2025-02-06 10:39:16,814 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-02-06 10:39:17,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:17,784 INFO L93 Difference]: Finished difference Result 139 states and 167 transitions. [2025-02-06 10:39:17,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 10:39:17,784 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-02-06 10:39:17,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:17,785 INFO L225 Difference]: With dead ends: 139 [2025-02-06 10:39:17,785 INFO L226 Difference]: Without dead ends: 139 [2025-02-06 10:39:17,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=235, Invalid=2014, Unknown=15, NotChecked=186, Total=2450 [2025-02-06 10:39:17,786 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 103 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:39:17,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 683 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 761 Invalid, 0 Unknown, 150 Unchecked, 0.5s Time] [2025-02-06 10:39:17,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-02-06 10:39:17,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 97. [2025-02-06 10:39:17,788 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-02-06 10:39:17,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 117 transitions. [2025-02-06 10:39:17,789 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 117 transitions. Word has length 29 [2025-02-06 10:39:17,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:17,789 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 117 transitions. [2025-02-06 10:39:17,789 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-02-06 10:39:17,789 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2025-02-06 10:39:17,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 10:39:17,790 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:17,790 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-02-06 10:39:17,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 10:39:17,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 10:39:17,994 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-02-06 10:39:17,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:17,994 INFO L85 PathProgramCache]: Analyzing trace with hash -500852849, now seen corresponding path program 2 times [2025-02-06 10:39:17,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:17,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143977525] [2025-02-06 10:39:17,994 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:39:17,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:18,007 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-02-06 10:39:18,019 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 10:39:18,019 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:39:18,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:18,138 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 10:39:18,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:18,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143977525] [2025-02-06 10:39:18,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143977525] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:39:18,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:39:18,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:39:18,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890778396] [2025-02-06 10:39:18,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:39:18,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:39:18,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:18,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:39:18,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:39:18,139 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-02-06 10:39:18,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:18,236 INFO L93 Difference]: Finished difference Result 97 states and 114 transitions. [2025-02-06 10:39:18,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:39:18,237 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-02-06 10:39:18,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:18,237 INFO L225 Difference]: With dead ends: 97 [2025-02-06 10:39:18,237 INFO L226 Difference]: Without dead ends: 97 [2025-02-06 10:39:18,237 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-02-06 10:39:18,238 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-02-06 10:39:18,238 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-02-06 10:39:18,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-06 10:39:18,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-02-06 10:39:18,239 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-02-06 10:39:18,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 114 transitions. [2025-02-06 10:39:18,240 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 114 transitions. Word has length 31 [2025-02-06 10:39:18,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:18,240 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 114 transitions. [2025-02-06 10:39:18,240 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-02-06 10:39:18,240 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 114 transitions. [2025-02-06 10:39:18,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-06 10:39:18,240 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:18,240 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-02-06 10:39:18,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 10:39:18,241 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-02-06 10:39:18,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:18,241 INFO L85 PathProgramCache]: Analyzing trace with hash 778656830, now seen corresponding path program 2 times [2025-02-06 10:39:18,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:18,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989439396] [2025-02-06 10:39:18,241 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:39:18,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:18,254 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-02-06 10:39:18,259 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 10:39:18,259 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:39:18,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:18,315 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 10:39:18,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:18,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989439396] [2025-02-06 10:39:18,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989439396] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:39:18,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033067454] [2025-02-06 10:39:18,315 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:39:18,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:18,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:39:18,322 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:39:18,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 10:39:18,410 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-02-06 10:39:18,436 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 10:39:18,436 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:39:18,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:18,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 10:39:18,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:39:18,501 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 10:39:18,501 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:39:18,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033067454] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:39:18,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:39:18,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-02-06 10:39:18,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616311939] [2025-02-06 10:39:18,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:39:18,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:39:18,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:18,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:39:18,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:39:18,502 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-02-06 10:39:18,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:18,518 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2025-02-06 10:39:18,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:39:18,518 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-02-06 10:39:18,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:18,519 INFO L225 Difference]: With dead ends: 78 [2025-02-06 10:39:18,519 INFO L226 Difference]: Without dead ends: 78 [2025-02-06 10:39:18,519 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-02-06 10:39:18,521 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-02-06 10:39:18,521 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-02-06 10:39:18,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-06 10:39:18,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 71. [2025-02-06 10:39:18,522 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-02-06 10:39:18,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2025-02-06 10:39:18,522 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 36 [2025-02-06 10:39:18,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:18,522 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2025-02-06 10:39:18,523 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-02-06 10:39:18,523 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2025-02-06 10:39:18,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-06 10:39:18,523 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:18,523 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-02-06 10:39:18,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 10:39:18,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:18,723 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-02-06 10:39:18,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:18,724 INFO L85 PathProgramCache]: Analyzing trace with hash 561269078, now seen corresponding path program 1 times [2025-02-06 10:39:18,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:18,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99448421] [2025-02-06 10:39:18,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:18,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:18,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 10:39:18,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 10:39:18,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:18,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:18,833 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:39:18,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:18,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99448421] [2025-02-06 10:39:18,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99448421] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:39:18,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577284350] [2025-02-06 10:39:18,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:18,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:18,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:39:18,837 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:39:18,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 10:39:18,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 10:39:18,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 10:39:18,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:18,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:18,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 10:39:18,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:39:18,988 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:39:18,988 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:39:19,017 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:39:19,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577284350] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:39:19,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:39:19,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-02-06 10:39:19,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852870230] [2025-02-06 10:39:19,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:39:19,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:39:19,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:19,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:39:19,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:39:19,019 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-02-06 10:39:19,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:19,056 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2025-02-06 10:39:19,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:39:19,057 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-02-06 10:39:19,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:19,057 INFO L225 Difference]: With dead ends: 75 [2025-02-06 10:39:19,057 INFO L226 Difference]: Without dead ends: 75 [2025-02-06 10:39:19,057 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-02-06 10:39:19,058 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-02-06 10:39:19,058 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-02-06 10:39:19,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-06 10:39:19,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2025-02-06 10:39:19,059 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-02-06 10:39:19,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2025-02-06 10:39:19,059 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 37 [2025-02-06 10:39:19,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:19,059 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2025-02-06 10:39:19,059 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-02-06 10:39:19,059 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2025-02-06 10:39:19,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-06 10:39:19,059 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:19,059 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-02-06 10:39:19,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-06 10:39:19,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:19,260 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-02-06 10:39:19,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:19,261 INFO L85 PathProgramCache]: Analyzing trace with hash 539947683, now seen corresponding path program 1 times [2025-02-06 10:39:19,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:19,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132721314] [2025-02-06 10:39:19,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:19,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:19,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 10:39:19,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 10:39:19,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:19,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:19,907 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:39:19,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:19,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132721314] [2025-02-06 10:39:19,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132721314] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:39:19,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570206451] [2025-02-06 10:39:19,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:19,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:19,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:39:19,909 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:39:19,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 10:39:20,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 10:39:20,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 10:39:20,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:20,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:20,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-02-06 10:39:20,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:39:20,057 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-02-06 10:39:20,114 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:39:20,114 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-02-06 10:39:20,145 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-02-06 10:39:20,174 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-02-06 10:39:20,193 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 10:39:20,193 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-02-06 10:39:20,351 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-02-06 10:39:20,356 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-02-06 10:39:20,440 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-02-06 10:39:20,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 16 treesize of output 11 [2025-02-06 10:39:20,685 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:39:20,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:39:20,828 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-02-06 10:39:20,833 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| (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_1442) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2025-02-06 10:39:20,849 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| (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_1442) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2025-02-06 10:39:20,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:20,856 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-02-06 10:39:20,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:20,862 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-02-06 10:39:20,865 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-02-06 10:39:21,078 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-02-06 10:39:21,085 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:21,085 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-02-06 10:39:21,087 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-02-06 10:39:21,089 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-02-06 10:39:21,168 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-02-06 10:39:21,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570206451] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:39:21,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:39:21,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 58 [2025-02-06 10:39:21,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667039183] [2025-02-06 10:39:21,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:39:21,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-02-06 10:39:21,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:21,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-02-06 10:39:21,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2660, Unknown=21, NotChecked=428, Total=3306 [2025-02-06 10:39:21,171 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-02-06 10:39:22,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:22,202 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2025-02-06 10:39:22,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-06 10:39:22,202 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-02-06 10:39:22,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:22,203 INFO L225 Difference]: With dead ends: 77 [2025-02-06 10:39:22,203 INFO L226 Difference]: Without dead ends: 77 [2025-02-06 10:39:22,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1366 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=459, Invalid=4792, Unknown=21, NotChecked=580, Total=5852 [2025-02-06 10:39:22,205 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 127 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 239 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:39:22,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 879 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 958 Invalid, 0 Unknown, 239 Unchecked, 0.4s Time] [2025-02-06 10:39:22,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-06 10:39:22,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2025-02-06 10:39:22,206 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-02-06 10:39:22,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2025-02-06 10:39:22,207 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 40 [2025-02-06 10:39:22,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:22,207 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2025-02-06 10:39:22,207 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-02-06 10:39:22,207 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2025-02-06 10:39:22,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-06 10:39:22,207 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:22,208 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-02-06 10:39:22,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-06 10:39:22,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-02-06 10:39:22,412 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-02-06 10:39:22,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:22,412 INFO L85 PathProgramCache]: Analyzing trace with hash -586198716, now seen corresponding path program 1 times [2025-02-06 10:39:22,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:22,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730129343] [2025-02-06 10:39:22,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:22,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:22,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 10:39:22,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 10:39:22,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:22,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:22,500 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-06 10:39:22,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:22,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730129343] [2025-02-06 10:39:22,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730129343] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:39:22,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195460591] [2025-02-06 10:39:22,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:22,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:22,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:39:22,505 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:39:22,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-06 10:39:22,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 10:39:22,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 10:39:22,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:22,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:22,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 10:39:22,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:39:22,677 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-06 10:39:22,677 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:39:22,698 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-06 10:39:22,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195460591] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:39:22,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:39:22,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2025-02-06 10:39:22,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202063627] [2025-02-06 10:39:22,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:39:22,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:39:22,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:22,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:39:22,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:39:22,699 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-02-06 10:39:22,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:22,734 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2025-02-06 10:39:22,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:39:22,734 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-02-06 10:39:22,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:22,735 INFO L225 Difference]: With dead ends: 68 [2025-02-06 10:39:22,735 INFO L226 Difference]: Without dead ends: 68 [2025-02-06 10:39:22,735 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-02-06 10:39:22,735 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 26 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:39:22,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 152 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:39:22,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-06 10:39:22,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-02-06 10:39:22,738 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-02-06 10:39:22,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2025-02-06 10:39:22,738 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 43 [2025-02-06 10:39:22,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:22,738 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2025-02-06 10:39:22,738 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-02-06 10:39:22,739 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2025-02-06 10:39:22,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-06 10:39:22,739 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:22,739 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-02-06 10:39:22,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-06 10:39:22,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:22,940 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-02-06 10:39:22,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:22,940 INFO L85 PathProgramCache]: Analyzing trace with hash -586198689, now seen corresponding path program 1 times [2025-02-06 10:39:22,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:22,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837928663] [2025-02-06 10:39:22,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:22,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:22,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 10:39:22,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 10:39:22,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:22,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:23,631 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 10:39:23,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:23,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837928663] [2025-02-06 10:39:23,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837928663] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:39:23,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176038593] [2025-02-06 10:39:23,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:23,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:23,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:39:23,634 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:39:23,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-06 10:39:23,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 10:39:23,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 10:39:23,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:23,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:23,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-02-06 10:39:23,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:39:23,794 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-02-06 10:39:23,815 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:39:23,815 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-02-06 10:39:23,831 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-02-06 10:39:23,862 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-02-06 10:39:23,878 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 10:39:23,878 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-02-06 10:39:23,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:39:23,999 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-02-06 10:39:24,121 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 10:39:24,121 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-02-06 10:39:24,173 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-02-06 10:39:24,178 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:39:24,178 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:39:24,234 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-02-06 10:39:24,328 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1682 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) v_ArrVal_1682) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) 1)) is different from false [2025-02-06 10:39:24,337 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-02-06 10:39:24,348 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-02-06 10:39:24,356 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-02-06 10:39:24,363 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-02-06 10:39:24,370 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-02-06 10:39:24,393 INFO L349 Elim1Store]: treesize reduction 5, result has 87.5 percent of original size [2025-02-06 10:39:24,393 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-02-06 10:39:24,402 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_ULTIMATE.start_dll_update_at_~head#1.offset_46| Int)) (or (= (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1679))) (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_46| v_ArrVal_1681)) (select .cse1 .cse2) v_ArrVal_1682))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)) |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-02-06 10:39:24,431 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-02-06 10:39:24,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:24,447 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-02-06 10:39:24,451 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-02-06 10:39:24,457 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:24,459 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-02-06 10:39:24,460 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:24,463 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-02-06 10:39:24,468 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-02-06 10:39:24,542 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2025-02-06 10:39:24,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176038593] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:39:24,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:39:24,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 19] total 45 [2025-02-06 10:39:24,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761685237] [2025-02-06 10:39:24,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:39:24,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-02-06 10:39:24,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:24,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-02-06 10:39:24,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1208, Unknown=39, NotChecked=702, Total=2070 [2025-02-06 10:39:24,544 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-02-06 10:39:25,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:25,469 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2025-02-06 10:39:25,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 10:39:25,469 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-02-06 10:39:25,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:25,470 INFO L225 Difference]: With dead ends: 73 [2025-02-06 10:39:25,470 INFO L226 Difference]: Without dead ends: 73 [2025-02-06 10:39:25,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=263, Invalid=2284, Unknown=39, NotChecked=954, Total=3540 [2025-02-06 10:39:25,471 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 67 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 495 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:39:25,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 774 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 951 Invalid, 0 Unknown, 495 Unchecked, 0.4s Time] [2025-02-06 10:39:25,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-02-06 10:39:25,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2025-02-06 10:39:25,472 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-02-06 10:39:25,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2025-02-06 10:39:25,472 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 43 [2025-02-06 10:39:25,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:25,472 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2025-02-06 10:39:25,472 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-02-06 10:39:25,472 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2025-02-06 10:39:25,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-06 10:39:25,473 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:25,473 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-02-06 10:39:25,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-06 10:39:25,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:25,677 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-02-06 10:39:25,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:25,678 INFO L85 PathProgramCache]: Analyzing trace with hash -586198688, now seen corresponding path program 1 times [2025-02-06 10:39:25,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:25,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9445014] [2025-02-06 10:39:25,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:25,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:25,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 10:39:25,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 10:39:25,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:25,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:26,565 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 10:39:26,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:26,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9445014] [2025-02-06 10:39:26,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9445014] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:39:26,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711133786] [2025-02-06 10:39:26,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:26,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:26,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:39:26,569 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:39:26,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-06 10:39:26,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 10:39:26,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 10:39:26,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:26,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:26,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-02-06 10:39:26,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:39:26,726 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-02-06 10:39:26,788 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:39:26,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-02-06 10:39:26,819 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-02-06 10:39:26,824 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-02-06 10:39:26,856 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-02-06 10:39:26,860 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-02-06 10:39:26,879 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 10:39:26,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 70 treesize of output 65 [2025-02-06 10:39:26,882 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-02-06 10:39:27,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:39:27,064 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-02-06 10:39:27,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:39:27,067 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-02-06 10:39:27,218 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 10:39:27,219 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-02-06 10:39:27,221 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-02-06 10:39:27,308 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-02-06 10:39:27,311 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-02-06 10:39:27,376 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:39:27,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:39:27,542 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-02-06 10:39:27,552 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_#t~mem10#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))) (<= (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1813) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1812) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)))))) is different from false [2025-02-06 10:39:27,560 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-02-06 10:39:27,571 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (and (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))) (forall ((v_ArrVal_1813 (Array Int Int)) (v_ArrVal_1812 (Array Int Int))) (<= (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1813) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1812) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))))) is different from false [2025-02-06 10:39:27,601 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-02-06 10:39:27,642 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-02-06 10:39:27,664 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-02-06 10:39:27,688 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-02-06 10:39:27,713 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-02-06 10:39:27,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:27,736 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-02-06 10:39:27,815 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-02-06 10:39:27,874 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-02-06 10:39:27,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:27,894 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-02-06 10:39:27,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:27,903 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-02-06 10:39:27,909 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-02-06 10:39:27,915 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:27,915 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-02-06 10:39:27,942 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:27,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:27,946 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-02-06 10:39:27,952 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-02-06 10:39:27,960 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-02-06 10:39:27,968 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-02-06 10:39:27,974 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-02-06 10:39:27,994 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:27,995 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-02-06 10:39:28,003 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-02-06 10:39:28,010 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2025-02-06 10:39:28,010 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-02-06 10:39:28,014 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:28,020 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2025-02-06 10:39:28,020 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-02-06 10:39:28,134 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2025-02-06 10:39:28,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711133786] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:39:28,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:39:28,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 19] total 50 [2025-02-06 10:39:28,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700904119] [2025-02-06 10:39:28,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:39:28,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-02-06 10:39:28,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:28,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-02-06 10:39:28,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1448, Unknown=11, NotChecked=946, Total=2550 [2025-02-06 10:39:28,136 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-02-06 10:39:29,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:29,332 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2025-02-06 10:39:29,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 10:39:29,332 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-02-06 10:39:29,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:29,333 INFO L225 Difference]: With dead ends: 72 [2025-02-06 10:39:29,333 INFO L226 Difference]: Without dead ends: 72 [2025-02-06 10:39:29,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 55 SyntacticMatches, 6 SemanticMatches, 61 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=272, Invalid=2413, Unknown=11, NotChecked=1210, Total=3906 [2025-02-06 10:39:29,334 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 53 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 575 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:39:29,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 815 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 833 Invalid, 0 Unknown, 575 Unchecked, 0.4s Time] [2025-02-06 10:39:29,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-06 10:39:29,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2025-02-06 10:39:29,335 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-02-06 10:39:29,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2025-02-06 10:39:29,335 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 43 [2025-02-06 10:39:29,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:29,336 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2025-02-06 10:39:29,336 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-02-06 10:39:29,336 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2025-02-06 10:39:29,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-06 10:39:29,336 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:29,336 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-02-06 10:39:29,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-06 10:39:29,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-02-06 10:39:29,540 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-02-06 10:39:29,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:29,541 INFO L85 PathProgramCache]: Analyzing trace with hash -2041073709, now seen corresponding path program 1 times [2025-02-06 10:39:29,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:29,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837130455] [2025-02-06 10:39:29,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:29,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:29,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 10:39:29,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 10:39:29,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:29,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:29,618 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-06 10:39:29,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:29,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837130455] [2025-02-06 10:39:29,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837130455] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:39:29,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:39:29,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:39:29,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884911336] [2025-02-06 10:39:29,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:39:29,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:39:29,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:29,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:39:29,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:39:29,620 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-02-06 10:39:29,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:29,750 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2025-02-06 10:39:29,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:39:29,751 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-02-06 10:39:29,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:29,751 INFO L225 Difference]: With dead ends: 66 [2025-02-06 10:39:29,751 INFO L226 Difference]: Without dead ends: 66 [2025-02-06 10:39:29,751 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-02-06 10:39:29,751 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-02-06 10:39:29,752 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-02-06 10:39:29,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-02-06 10:39:29,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-02-06 10:39:29,753 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-02-06 10:39:29,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2025-02-06 10:39:29,754 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 46 [2025-02-06 10:39:29,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:29,754 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2025-02-06 10:39:29,754 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-02-06 10:39:29,754 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2025-02-06 10:39:29,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-06 10:39:29,754 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:29,754 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-02-06 10:39:29,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 10:39:29,754 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-02-06 10:39:29,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:29,754 INFO L85 PathProgramCache]: Analyzing trace with hash -2041073708, now seen corresponding path program 1 times [2025-02-06 10:39:29,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:29,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060016671] [2025-02-06 10:39:29,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:29,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:29,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 10:39:29,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 10:39:29,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:29,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:29,803 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-06 10:39:29,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:29,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060016671] [2025-02-06 10:39:29,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060016671] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:39:29,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345936942] [2025-02-06 10:39:29,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:29,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:29,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:39:29,808 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:39:29,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-06 10:39:29,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 10:39:30,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 10:39:30,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:30,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:30,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 10:39:30,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:39:30,020 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-06 10:39:30,021 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:39:30,038 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-06 10:39:30,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345936942] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:39:30,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:39:30,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-02-06 10:39:30,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137891408] [2025-02-06 10:39:30,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:39:30,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:39:30,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:30,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:39:30,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:39:30,040 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-02-06 10:39:30,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:30,067 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2025-02-06 10:39:30,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:39:30,067 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-02-06 10:39:30,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:30,067 INFO L225 Difference]: With dead ends: 66 [2025-02-06 10:39:30,067 INFO L226 Difference]: Without dead ends: 66 [2025-02-06 10:39:30,067 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-02-06 10:39:30,068 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-02-06 10:39:30,068 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-02-06 10:39:30,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-02-06 10:39:30,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-02-06 10:39:30,069 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-02-06 10:39:30,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2025-02-06 10:39:30,069 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 46 [2025-02-06 10:39:30,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:30,069 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2025-02-06 10:39:30,069 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-02-06 10:39:30,069 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2025-02-06 10:39:30,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-06 10:39:30,069 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:30,069 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-02-06 10:39:30,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-02-06 10:39:30,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-02-06 10:39:30,270 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-02-06 10:39:30,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:30,271 INFO L85 PathProgramCache]: Analyzing trace with hash 442942773, now seen corresponding path program 1 times [2025-02-06 10:39:30,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:30,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992041517] [2025-02-06 10:39:30,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:30,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:30,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 10:39:30,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 10:39:30,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:30,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:30,401 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-06 10:39:30,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:30,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992041517] [2025-02-06 10:39:30,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992041517] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:39:30,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:39:30,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:39:30,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214710275] [2025-02-06 10:39:30,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:39:30,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:39:30,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:30,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:39:30,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:39:30,403 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-02-06 10:39:30,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:30,493 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2025-02-06 10:39:30,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:39:30,493 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-02-06 10:39:30,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:30,493 INFO L225 Difference]: With dead ends: 68 [2025-02-06 10:39:30,493 INFO L226 Difference]: Without dead ends: 68 [2025-02-06 10:39:30,493 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-02-06 10:39:30,494 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-02-06 10:39:30,494 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-02-06 10:39:30,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-06 10:39:30,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-02-06 10:39:30,495 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-02-06 10:39:30,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2025-02-06 10:39:30,495 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 49 [2025-02-06 10:39:30,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:30,496 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2025-02-06 10:39:30,496 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-02-06 10:39:30,496 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2025-02-06 10:39:30,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-06 10:39:30,496 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:30,496 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-02-06 10:39:30,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 10:39:30,498 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-02-06 10:39:30,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:30,498 INFO L85 PathProgramCache]: Analyzing trace with hash 442868327, now seen corresponding path program 1 times [2025-02-06 10:39:30,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:30,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584493344] [2025-02-06 10:39:30,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:30,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:30,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 10:39:30,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 10:39:30,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:30,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:31,287 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:39:31,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:31,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584493344] [2025-02-06 10:39:31,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584493344] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:39:31,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557092151] [2025-02-06 10:39:31,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:31,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:31,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:39:31,291 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:39:31,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-06 10:39:31,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 10:39:31,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 10:39:31,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:31,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:31,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 99 conjuncts are in the unsatisfiable core [2025-02-06 10:39:31,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:39:31,588 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-02-06 10:39:31,666 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:39:31,666 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-02-06 10:39:31,704 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-02-06 10:39:31,744 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-02-06 10:39:31,760 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 10:39:31,761 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-02-06 10:39:31,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:39:31,926 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-02-06 10:39:32,245 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 10:39:32,245 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-02-06 10:39:32,249 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-02-06 10:39:32,251 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-02-06 10:39:32,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 39 treesize of output 21 [2025-02-06 10:39:32,470 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-02-06 10:39:32,618 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:39:32,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:39:32,773 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-02-06 10:39:32,860 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-02-06 10:39:32,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:32,871 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-02-06 10:39:32,874 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-02-06 10:39:33,358 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-02-06 10:39:33,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:33,366 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-02-06 10:39:33,368 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-02-06 10:39:33,370 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-02-06 10:39:33,507 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-02-06 10:39:33,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557092151] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:39:33,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:39:33,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 66 [2025-02-06 10:39:33,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787830046] [2025-02-06 10:39:33,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:39:33,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-02-06 10:39:33,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:33,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-02-06 10:39:33,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=3805, Unknown=25, NotChecked=250, Total=4290 [2025-02-06 10:39:33,510 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-02-06 10:39:35,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:35,098 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2025-02-06 10:39:35,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-06 10:39:35,099 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-02-06 10:39:35,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:35,099 INFO L225 Difference]: With dead ends: 70 [2025-02-06 10:39:35,099 INFO L226 Difference]: Without dead ends: 70 [2025-02-06 10:39:35,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 87 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1627 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=514, Invalid=6951, Unknown=25, NotChecked=342, Total=7832 [2025-02-06 10:39:35,101 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 89 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 1749 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 1869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 10:39:35,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 990 Invalid, 1869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1749 Invalid, 0 Unknown, 105 Unchecked, 0.8s Time] [2025-02-06 10:39:35,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-02-06 10:39:35,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2025-02-06 10:39:35,102 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-02-06 10:39:35,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2025-02-06 10:39:35,103 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 49 [2025-02-06 10:39:35,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:35,103 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2025-02-06 10:39:35,103 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-02-06 10:39:35,103 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2025-02-06 10:39:35,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 10:39:35,103 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:35,103 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-02-06 10:39:35,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-02-06 10:39:35,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-02-06 10:39:35,309 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-02-06 10:39:35,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:35,309 INFO L85 PathProgramCache]: Analyzing trace with hash 846324731, now seen corresponding path program 1 times [2025-02-06 10:39:35,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:35,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708535036] [2025-02-06 10:39:35,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:35,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:35,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 10:39:35,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 10:39:35,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:35,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:35,373 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-06 10:39:35,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:35,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708535036] [2025-02-06 10:39:35,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708535036] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:39:35,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:39:35,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:39:35,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874233145] [2025-02-06 10:39:35,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:39:35,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:39:35,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:35,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:39:35,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:39:35,374 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-02-06 10:39:35,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:35,436 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2025-02-06 10:39:35,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:39:35,436 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-02-06 10:39:35,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:35,437 INFO L225 Difference]: With dead ends: 66 [2025-02-06 10:39:35,437 INFO L226 Difference]: Without dead ends: 66 [2025-02-06 10:39:35,437 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-02-06 10:39:35,439 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-02-06 10:39:35,439 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-02-06 10:39:35,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-02-06 10:39:35,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2025-02-06 10:39:35,442 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-02-06 10:39:35,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2025-02-06 10:39:35,442 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 50 [2025-02-06 10:39:35,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:35,442 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2025-02-06 10:39:35,442 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-02-06 10:39:35,443 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2025-02-06 10:39:35,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-06 10:39:35,443 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:35,443 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-02-06 10:39:35,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-06 10:39:35,443 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-02-06 10:39:35,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:35,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1568578337, now seen corresponding path program 1 times [2025-02-06 10:39:35,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:35,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975530600] [2025-02-06 10:39:35,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:35,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:35,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 10:39:35,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 10:39:35,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:35,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:35,531 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-06 10:39:35,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:35,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975530600] [2025-02-06 10:39:35,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975530600] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:39:35,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:39:35,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:39:35,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689633143] [2025-02-06 10:39:35,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:39:35,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:39:35,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:35,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:39:35,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:39:35,532 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-02-06 10:39:35,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:35,617 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2025-02-06 10:39:35,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:39:35,618 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-02-06 10:39:35,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:35,618 INFO L225 Difference]: With dead ends: 65 [2025-02-06 10:39:35,618 INFO L226 Difference]: Without dead ends: 65 [2025-02-06 10:39:35,618 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-02-06 10:39:35,619 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-02-06 10:39:35,619 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-02-06 10:39:35,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-06 10:39:35,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-02-06 10:39:35,620 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-02-06 10:39:35,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2025-02-06 10:39:35,620 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 52 [2025-02-06 10:39:35,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:35,620 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2025-02-06 10:39:35,620 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-02-06 10:39:35,620 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2025-02-06 10:39:35,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-06 10:39:35,620 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:35,620 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-02-06 10:39:35,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-06 10:39:35,620 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-02-06 10:39:35,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:35,621 INFO L85 PathProgramCache]: Analyzing trace with hash 273042509, now seen corresponding path program 1 times [2025-02-06 10:39:35,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:35,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687276386] [2025-02-06 10:39:35,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:35,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:35,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 10:39:35,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 10:39:35,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:35,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:36,396 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 10:39:36,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:36,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687276386] [2025-02-06 10:39:36,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687276386] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:39:36,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477978207] [2025-02-06 10:39:36,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:36,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:36,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:39:36,399 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:39:36,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-06 10:39:36,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 10:39:36,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 10:39:36,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:36,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:36,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-02-06 10:39:36,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:39:36,629 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-02-06 10:39:36,659 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:39:36,659 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-02-06 10:39:36,689 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-02-06 10:39:36,719 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-02-06 10:39:36,740 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:39:36,740 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-02-06 10:39:36,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:39:36,802 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-02-06 10:39:36,905 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:39:36,905 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-02-06 10:39:36,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:36,998 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-02-06 10:39:37,115 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-02-06 10:39:37,115 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-02-06 10:39:37,118 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 10:39:37,119 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:39:37,338 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-02-06 10:39:37,345 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-02-06 10:39:37,603 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|))) (let ((.cse1 (select .cse0 (+ |c_ULTIMATE.start_dll_create_#res#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_dll_create_#res#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_#res#1.base|) 4)) 1)) (< |c_ULTIMATE.start_dll_create_#res#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_dll_create_#res#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_dll_create_#res#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_#res#1.base|) 4) |c_ULTIMATE.start_dll_create_#res#1.base|)))))))) is different from false [2025-02-06 10:39:37,615 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-02-06 10:39:37,627 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-02-06 10:39:37,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:37,641 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-02-06 10:39:37,835 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse3 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_2409 Int) (v_prenex_16 Int) (v_prenex_15 Int) (v_prenex_14 (Array Int Int)) (v_prenex_13 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_16) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (let ((.cse0 (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse2 .cse3 v_ArrVal_2409)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_14) |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_prenex_14) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 v_prenex_16 v_prenex_15)) (select .cse0 .cse1) v_prenex_13)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))))) (forall ((v_ArrVal_2409 Int) (v_ArrVal_2414 (Array Int Int)) (v_ArrVal_2411 (Array Int Int)) (v_ArrVal_2412 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_68| Int)) (or (= (select (select (let ((.cse4 (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse2 .cse3 v_ArrVal_2409)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2411) |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_2411) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_68| v_ArrVal_2412)) (select .cse4 .cse1) v_ArrVal_2414)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |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_68|))))) is different from false [2025-02-06 10:39:37,847 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:37,847 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-02-06 10:39:37,850 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-02-06 10:39:37,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:37,859 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-02-06 10:39:37,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:37,870 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-02-06 10:39:37,878 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-02-06 10:39:37,917 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:37,920 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2025-02-06 10:39:37,920 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-02-06 10:39:37,967 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 11 refuted. 1 times theorem prover too weak. 10 trivial. 5 not checked. [2025-02-06 10:39:37,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477978207] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:39:37,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:39:37,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 21] total 46 [2025-02-06 10:39:37,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560383423] [2025-02-06 10:39:37,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:39:37,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-02-06 10:39:37,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:37,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-02-06 10:39:37,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1428, Unknown=81, NotChecked=498, Total=2162 [2025-02-06 10:39:37,969 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-02-06 10:39:38,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:38,951 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2025-02-06 10:39:38,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 10:39:38,952 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-02-06 10:39:38,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:38,952 INFO L225 Difference]: With dead ends: 74 [2025-02-06 10:39:38,952 INFO L226 Difference]: Without dead ends: 74 [2025-02-06 10:39:38,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 82 SyntacticMatches, 8 SemanticMatches, 57 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=280, Invalid=2413, Unknown=87, NotChecked=642, Total=3422 [2025-02-06 10:39:38,953 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 29 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 1491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 390 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:39:38,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 342 Invalid, 1491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1094 Invalid, 0 Unknown, 390 Unchecked, 0.5s Time] [2025-02-06 10:39:38,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-06 10:39:38,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2025-02-06 10:39:38,955 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-02-06 10:39:38,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2025-02-06 10:39:38,956 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 55 [2025-02-06 10:39:38,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:38,956 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2025-02-06 10:39:38,956 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-02-06 10:39:38,956 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2025-02-06 10:39:38,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-06 10:39:38,956 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:38,956 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-02-06 10:39:38,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-02-06 10:39:39,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:39,157 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-02-06 10:39:39,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:39,157 INFO L85 PathProgramCache]: Analyzing trace with hash 273042510, now seen corresponding path program 1 times [2025-02-06 10:39:39,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:39,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886133615] [2025-02-06 10:39:39,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:39,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:39,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 10:39:39,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 10:39:39,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:39,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:40,232 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 10:39:40,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:40,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886133615] [2025-02-06 10:39:40,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886133615] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:39:40,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106655257] [2025-02-06 10:39:40,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:40,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:40,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:39:40,234 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:39:40,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-02-06 10:39:40,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 10:39:40,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 10:39:40,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:40,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:40,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 87 conjuncts are in the unsatisfiable core [2025-02-06 10:39:40,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:39:40,428 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-02-06 10:39:40,431 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-02-06 10:39:40,517 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:39:40,518 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-02-06 10:39:40,521 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-02-06 10:39:40,567 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-02-06 10:39:40,574 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-02-06 10:39:40,604 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-02-06 10:39:40,606 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-02-06 10:39:40,622 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:39:40,622 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-02-06 10:39:40,628 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-02-06 10:39:40,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:39:40,795 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-02-06 10:39:40,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:39:40,803 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-02-06 10:39:40,940 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:39:40,941 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-02-06 10:39:40,947 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-02-06 10:39:41,073 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:41,073 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-02-06 10:39:41,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:41,077 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-02-06 10:39:41,190 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 10:39:41,191 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:39:41,757 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-02-06 10:39:41,814 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-02-06 10:39:41,843 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-02-06 10:39:42,314 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-02-06 10:39:42,366 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-02-06 10:39:42,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:42,392 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-02-06 10:39:42,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:42,425 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-02-06 10:39:42,442 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-02-06 10:39:42,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:42,459 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-02-06 10:39:42,471 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:42,472 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-02-06 10:39:42,486 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-02-06 10:39:42,508 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2025-02-06 10:39:42,509 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-02-06 10:39:42,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:42,524 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-02-06 10:39:42,531 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-02-06 10:39:42,537 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-02-06 10:39:42,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:42,551 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-02-06 10:39:42,577 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2025-02-06 10:39:42,578 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-02-06 10:39:42,587 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-02-06 10:39:42,596 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-02-06 10:39:42,866 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-02-06 10:39:42,881 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-02-06 10:39:42,976 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-02-06 10:39:42,989 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-02-06 10:39:43,020 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:43,020 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-02-06 10:39:43,035 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-02-06 10:39:43,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:43,060 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-02-06 10:39:43,303 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-02-06 10:39:43,315 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-02-06 10:39:43,315 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-02-06 10:39:43,324 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:43,324 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-02-06 10:39:43,342 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:43,345 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-02-06 10:39:43,356 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:39:43,356 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-02-06 10:39:43,631 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 7 not checked. [2025-02-06 10:39:43,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106655257] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:39:43,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:39:43,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19, 21] total 60 [2025-02-06 10:39:43,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737317902] [2025-02-06 10:39:43,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:39:43,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-02-06 10:39:43,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:43,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-02-06 10:39:43,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2884, Unknown=21, NotChecked=560, Total=3660 [2025-02-06 10:39:43,634 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-02-06 10:39:45,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:45,424 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2025-02-06 10:39:45,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-06 10:39:45,424 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-02-06 10:39:45,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:45,425 INFO L225 Difference]: With dead ends: 76 [2025-02-06 10:39:45,425 INFO L226 Difference]: Without dead ends: 76 [2025-02-06 10:39:45,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 75 SyntacticMatches, 5 SemanticMatches, 77 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 911 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=410, Invalid=4991, Unknown=21, NotChecked=740, Total=6162 [2025-02-06 10:39:45,426 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 74 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 1374 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 1698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 310 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 10:39:45,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 548 Invalid, 1698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1374 Invalid, 0 Unknown, 310 Unchecked, 0.7s Time] [2025-02-06 10:39:45,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-02-06 10:39:45,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2025-02-06 10:39:45,428 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-02-06 10:39:45,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2025-02-06 10:39:45,429 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 55 [2025-02-06 10:39:45,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:45,429 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2025-02-06 10:39:45,429 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-02-06 10:39:45,429 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2025-02-06 10:39:45,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-06 10:39:45,429 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:45,429 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-02-06 10:39:45,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-02-06 10:39:45,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:45,630 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-02-06 10:39:45,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:45,631 INFO L85 PathProgramCache]: Analyzing trace with hash -125616126, now seen corresponding path program 1 times [2025-02-06 10:39:45,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:45,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749091489] [2025-02-06 10:39:45,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:45,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:45,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 10:39:45,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 10:39:45,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:45,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:46,245 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:39:46,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:46,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749091489] [2025-02-06 10:39:46,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749091489] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:39:46,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167206958] [2025-02-06 10:39:46,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:46,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:46,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:39:46,248 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:39:46,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-02-06 10:39:46,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 10:39:46,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 10:39:46,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:46,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:46,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-02-06 10:39:46,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:39:46,444 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-02-06 10:39:46,467 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:39:46,467 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-02-06 10:39:46,481 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-02-06 10:39:46,496 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-02-06 10:39:46,536 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:39:46,537 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-02-06 10:39:46,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:39:46,594 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-02-06 10:39:46,692 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:39:46,693 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-02-06 10:39:46,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:46,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 26 treesize of output 20 [2025-02-06 10:39:46,834 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 10:39:46,834 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:39:46,979 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-02-06 10:39:46,984 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-02-06 10:39:47,249 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_2676 Int)) (or (not (= (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_83| v_ArrVal_2676)) (select .cse0 (+ |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-02-06 10:39:47,450 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:47,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 93 treesize of output 69 [2025-02-06 10:39:47,453 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-02-06 10:39:47,460 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:47,460 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-02-06 10:39:47,468 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:47,468 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-02-06 10:39:47,471 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-02-06 10:39:47,682 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 6 not checked. [2025-02-06 10:39:47,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167206958] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:39:47,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:39:47,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 23] total 49 [2025-02-06 10:39:47,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879637941] [2025-02-06 10:39:47,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:39:47,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-02-06 10:39:47,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:47,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-02-06 10:39:47,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1856, Unknown=57, NotChecked=270, Total=2352 [2025-02-06 10:39:47,685 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-02-06 10:39:48,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:48,741 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2025-02-06 10:39:48,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-06 10:39:48,742 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-02-06 10:39:48,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:48,742 INFO L225 Difference]: With dead ends: 78 [2025-02-06 10:39:48,744 INFO L226 Difference]: Without dead ends: 78 [2025-02-06 10:39:48,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=397, Invalid=3844, Unknown=61, NotChecked=390, Total=4692 [2025-02-06 10:39:48,745 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 73 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 178 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:39:48,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 394 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 805 Invalid, 0 Unknown, 178 Unchecked, 0.4s Time] [2025-02-06 10:39:48,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-06 10:39:48,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 70. [2025-02-06 10:39:48,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-02-06 10:39:48,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2025-02-06 10:39:48,747 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 56 [2025-02-06 10:39:48,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:48,747 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2025-02-06 10:39:48,747 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-02-06 10:39:48,747 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2025-02-06 10:39:48,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-06 10:39:48,748 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:48,748 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-02-06 10:39:48,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-02-06 10:39:48,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:48,952 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-02-06 10:39:48,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:48,952 INFO L85 PathProgramCache]: Analyzing trace with hash -458682008, now seen corresponding path program 1 times [2025-02-06 10:39:48,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:48,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080613547] [2025-02-06 10:39:48,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:48,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:48,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 10:39:48,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 10:39:48,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:48,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:49,650 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:39:49,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:49,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080613547] [2025-02-06 10:39:49,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080613547] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:39:49,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736681440] [2025-02-06 10:39:49,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:49,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:49,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:39:49,653 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:39:49,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-02-06 10:39:49,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 10:39:49,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 10:39:49,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:49,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:49,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-02-06 10:39:49,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:39:49,872 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-02-06 10:39:49,906 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:39:49,906 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-02-06 10:39:49,938 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-02-06 10:39:49,963 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-02-06 10:39:49,980 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:39:49,980 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-02-06 10:39:50,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:39:50,032 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-02-06 10:39:50,123 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:39:50,123 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-02-06 10:39:50,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:50,213 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-02-06 10:39:50,282 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 10:39:50,282 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:39:50,476 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-02-06 10:39:50,731 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-02-06 10:39:50,739 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-02-06 10:39:50,746 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-02-06 10:39:50,754 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-02-06 10:39:50,766 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-02-06 10:39:50,775 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:50,775 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-02-06 10:39:50,778 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-02-06 10:39:50,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:50,786 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-02-06 10:39:50,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:50,795 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-02-06 10:39:50,800 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-02-06 10:39:50,972 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 13 refuted. 1 times theorem prover too weak. 10 trivial. 6 not checked. [2025-02-06 10:39:50,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736681440] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:39:50,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:39:50,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 21] total 46 [2025-02-06 10:39:50,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867980146] [2025-02-06 10:39:50,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:39:50,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-02-06 10:39:50,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:50,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-02-06 10:39:50,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1418, Unknown=95, NotChecked=498, Total=2162 [2025-02-06 10:39:50,974 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-02-06 10:39:51,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:51,956 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2025-02-06 10:39:51,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 10:39:51,957 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-02-06 10:39:51,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:51,957 INFO L225 Difference]: With dead ends: 77 [2025-02-06 10:39:51,957 INFO L226 Difference]: Without dead ends: 77 [2025-02-06 10:39:51,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 90 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=298, Invalid=2703, Unknown=103, NotChecked=678, Total=3782 [2025-02-06 10:39:51,958 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 77 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 994 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 1371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 366 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:39:51,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 520 Invalid, 1371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 994 Invalid, 0 Unknown, 366 Unchecked, 0.5s Time] [2025-02-06 10:39:51,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-06 10:39:51,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2025-02-06 10:39:51,960 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-02-06 10:39:51,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2025-02-06 10:39:51,960 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 58 [2025-02-06 10:39:51,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:51,960 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2025-02-06 10:39:51,961 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-02-06 10:39:51,961 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2025-02-06 10:39:51,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-06 10:39:51,961 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:51,961 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-02-06 10:39:51,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-02-06 10:39:52,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:52,162 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-02-06 10:39:52,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:52,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1990220966, now seen corresponding path program 2 times [2025-02-06 10:39:52,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:52,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714747588] [2025-02-06 10:39:52,163 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:39:52,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:52,182 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 61 statements into 2 equivalence classes. [2025-02-06 10:39:52,196 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 61 of 61 statements. [2025-02-06 10:39:52,196 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:39:52,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:53,797 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 10:39:53,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:53,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714747588] [2025-02-06 10:39:53,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714747588] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:39:53,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123208625] [2025-02-06 10:39:53,798 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:39:53,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:53,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:39:53,800 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:39:53,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-02-06 10:39:53,971 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 61 statements into 2 equivalence classes. [2025-02-06 10:39:54,025 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 61 of 61 statements. [2025-02-06 10:39:54,025 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:39:54,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:54,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 111 conjuncts are in the unsatisfiable core [2025-02-06 10:39:54,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:39:54,067 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-02-06 10:39:54,085 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-02-06 10:39:54,088 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-02-06 10:39:54,095 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-02-06 10:39:54,098 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-02-06 10:39:54,118 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:39:54,118 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-02-06 10:39:54,151 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-02-06 10:39:54,156 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-02-06 10:39:54,195 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-02-06 10:39:54,202 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-02-06 10:39:54,249 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-02-06 10:39:54,255 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-02-06 10:39:54,308 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-06 10:39:54,309 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-02-06 10:39:54,311 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-02-06 10:39:54,537 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-02-06 10:39:54,537 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-02-06 10:39:54,570 INFO L349 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2025-02-06 10:39:54,571 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-02-06 10:39:55,039 INFO L349 Elim1Store]: treesize reduction 116, result has 43.4 percent of original size [2025-02-06 10:39:55,039 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-02-06 10:39:55,136 INFO L349 Elim1Store]: treesize reduction 108, result has 47.3 percent of original size [2025-02-06 10:39:55,137 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-02-06 10:40:09,455 INFO L349 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2025-02-06 10:40:09,456 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-02-06 10:40:09,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:40:09,462 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-02-06 10:40:09,500 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 10:40:09,500 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:40:14,823 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-02-06 10:40:14,855 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-02-06 10:40:14,886 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-02-06 10:40:14,920 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-02-06 10:40:14,969 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-02-06 10:40:25,584 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-02-06 10:40:25,650 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:40:25,650 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-02-06 10:40:25,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:40:25,669 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-02-06 10:40:25,713 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:40:25,713 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-02-06 10:40:25,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:40:25,730 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-02-06 10:40:25,784 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