./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 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/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 277634da297b7f9e262585608ed7ad62cca7d59b0122d4e61ee1b4b78256acae --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:42:32,817 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:42:32,894 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 01:42:32,899 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:42:32,902 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:42:32,927 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:42:32,928 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:42:32,928 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:42:32,928 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:42:32,929 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:42:32,929 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:42:32,929 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:42:32,929 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:42:32,929 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:42:32,929 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:42:32,930 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:42:32,930 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:42:32,930 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:42:32,930 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:42:32,930 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:42:32,930 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:42:32,930 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:42:32,930 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:42:32,930 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:42:32,930 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:42:32,930 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:42:32,930 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:42:32,930 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:42:32,930 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:42:32,930 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:42:32,931 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:42:32,931 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:42:32,931 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:42:32,931 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:42:32,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:42:32,931 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:42:32,931 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:42:32,931 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:42:32,931 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:42:32,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:42:32,931 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:42:32,931 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:42:32,931 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:42:32,931 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:42:32,932 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:42:32,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:42:32,932 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:42:32,932 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:42:32,932 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:42:32,932 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:42:32,932 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 ! overflow) ) 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 -> 277634da297b7f9e262585608ed7ad62cca7d59b0122d4e61ee1b4b78256acae [2025-01-10 01:42:33,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:42:33,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:42:33,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:42:33,230 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:42:33,230 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:42:33,232 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i [2025-01-10 01:42:34,562 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30c4e50e7/daf0bbb26cfd4c68923494d3c85a815f/FLAGef8803dc5 [2025-01-10 01:42:34,862 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:42:34,863 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i [2025-01-10 01:42:34,876 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30c4e50e7/daf0bbb26cfd4c68923494d3c85a815f/FLAGef8803dc5 [2025-01-10 01:42:34,891 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30c4e50e7/daf0bbb26cfd4c68923494d3c85a815f [2025-01-10 01:42:34,893 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:42:34,894 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:42:34,896 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:42:34,896 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:42:34,899 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:42:34,900 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:42:34" (1/1) ... [2025-01-10 01:42:34,901 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b74dfcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:34, skipping insertion in model container [2025-01-10 01:42:34,901 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:42:34" (1/1) ... [2025-01-10 01:42:34,935 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:42:35,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:42:35,172 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:42:35,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:42:35,241 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:42:35,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:35 WrapperNode [2025-01-10 01:42:35,244 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:42:35,245 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:42:35,245 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:42:35,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:42:35,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:35" (1/1) ... [2025-01-10 01:42:35,265 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:35" (1/1) ... [2025-01-10 01:42:35,284 INFO L138 Inliner]: procedures = 127, calls = 33, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 113 [2025-01-10 01:42:35,284 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:42:35,285 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:42:35,285 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:42:35,285 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:42:35,292 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:35" (1/1) ... [2025-01-10 01:42:35,293 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:35" (1/1) ... [2025-01-10 01:42:35,298 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:35" (1/1) ... [2025-01-10 01:42:35,326 INFO L175 MemorySlicer]: Split 16 memory accesses to 3 slices as follows [2, 9, 5]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 5 writes are split as follows [0, 4, 1]. [2025-01-10 01:42:35,327 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:35" (1/1) ... [2025-01-10 01:42:35,327 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:35" (1/1) ... [2025-01-10 01:42:35,339 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:35" (1/1) ... [2025-01-10 01:42:35,340 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:35" (1/1) ... [2025-01-10 01:42:35,342 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:35" (1/1) ... [2025-01-10 01:42:35,346 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:35" (1/1) ... [2025-01-10 01:42:35,350 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:35" (1/1) ... [2025-01-10 01:42:35,353 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:42:35,353 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:42:35,353 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:42:35,356 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:42:35,356 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:35" (1/1) ... [2025-01-10 01:42:35,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:42:35,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:42:35,386 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-01-10 01:42:35,395 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-01-10 01:42:35,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:42:35,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:42:35,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 01:42:35,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:42:35,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:42:35,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 01:42:35,415 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-01-10 01:42:35,415 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-01-10 01:42:35,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:42:35,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:42:35,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 01:42:35,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 01:42:35,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 01:42:35,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 01:42:35,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 01:42:35,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 01:42:35,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 01:42:35,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 01:42:35,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-10 01:42:35,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-10 01:42:35,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-10 01:42:35,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:42:35,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:42:35,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 01:42:35,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:42:35,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:42:35,554 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:42:35,556 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:42:35,770 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2025-01-10 01:42:35,770 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:42:35,781 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:42:35,781 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:42:35,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:42:35 BoogieIcfgContainer [2025-01-10 01:42:35,782 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:42:35,783 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:42:35,784 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:42:35,788 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:42:35,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:42:34" (1/3) ... [2025-01-10 01:42:35,789 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f00e47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:42:35, skipping insertion in model container [2025-01-10 01:42:35,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:35" (2/3) ... [2025-01-10 01:42:35,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f00e47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:42:35, skipping insertion in model container [2025-01-10 01:42:35,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:42:35" (3/3) ... [2025-01-10 01:42:35,791 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_unequal.i [2025-01-10 01:42:35,803 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:42:35,804 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_prepend_unequal.i that has 2 procedures, 39 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-01-10 01:42:35,849 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:42:35,859 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2512bb6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:42:35,859 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 01:42:35,863 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 35 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:42:35,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-10 01:42:35,869 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:35,869 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:35,869 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:42:35,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:35,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1160978078, now seen corresponding path program 1 times [2025-01-10 01:42:35,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:35,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258258292] [2025-01-10 01:42:35,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:35,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:35,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:42:35,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:42:35,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:35,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:36,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:42:36,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:36,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258258292] [2025-01-10 01:42:36,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258258292] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:42:36,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:42:36,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:42:36,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328327239] [2025-01-10 01:42:36,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:42:36,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:42:36,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:36,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:42:36,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:42:36,220 INFO L87 Difference]: Start difference. First operand has 39 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 35 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:42:36,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:36,267 INFO L93 Difference]: Finished difference Result 74 states and 91 transitions. [2025-01-10 01:42:36,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:42:36,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-01-10 01:42:36,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:36,275 INFO L225 Difference]: With dead ends: 74 [2025-01-10 01:42:36,275 INFO L226 Difference]: Without dead ends: 34 [2025-01-10 01:42:36,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:42:36,282 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 1 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:36,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 111 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:36,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-01-10 01:42:36,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2025-01-10 01:42:36,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 28 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:42:36,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2025-01-10 01:42:36,318 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 11 [2025-01-10 01:42:36,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:36,319 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2025-01-10 01:42:36,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:42:36,320 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2025-01-10 01:42:36,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 01:42:36,321 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:36,321 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:36,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:42:36,321 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:42:36,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:36,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1630582092, now seen corresponding path program 1 times [2025-01-10 01:42:36,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:36,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184587753] [2025-01-10 01:42:36,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:36,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:36,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:42:36,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:42:36,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:36,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:36,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:42:36,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:36,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184587753] [2025-01-10 01:42:36,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184587753] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:42:36,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:42:36,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:42:36,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953945365] [2025-01-10 01:42:36,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:42:36,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:42:36,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:36,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:42:36,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:42:36,468 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:42:36,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:36,499 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2025-01-10 01:42:36,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:42:36,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-01-10 01:42:36,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:36,500 INFO L225 Difference]: With dead ends: 35 [2025-01-10 01:42:36,500 INFO L226 Difference]: Without dead ends: 34 [2025-01-10 01:42:36,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:42:36,501 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:36,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:36,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-01-10 01:42:36,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-01-10 01:42:36,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 29 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:42:36,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2025-01-10 01:42:36,511 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 12 [2025-01-10 01:42:36,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:36,511 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2025-01-10 01:42:36,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:42:36,512 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2025-01-10 01:42:36,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-10 01:42:36,513 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:36,513 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 01:42:36,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:42:36,514 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:42:36,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:36,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1328510892, now seen corresponding path program 1 times [2025-01-10 01:42:36,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:36,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84973842] [2025-01-10 01:42:36,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:36,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:36,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:42:36,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:42:36,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:36,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:36,677 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:42:36,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:36,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84973842] [2025-01-10 01:42:36,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84973842] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:42:36,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:42:36,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:42:36,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618559071] [2025-01-10 01:42:36,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:42:36,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:42:36,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:36,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:42:36,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:42:36,679 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:42:36,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:36,712 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2025-01-10 01:42:36,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:42:36,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2025-01-10 01:42:36,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:36,714 INFO L225 Difference]: With dead ends: 34 [2025-01-10 01:42:36,714 INFO L226 Difference]: Without dead ends: 33 [2025-01-10 01:42:36,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:42:36,716 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:36,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 69 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:36,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-01-10 01:42:36,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-01-10 01:42:36,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.25) internal successors, (30), 28 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:42:36,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2025-01-10 01:42:36,725 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 21 [2025-01-10 01:42:36,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:36,725 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2025-01-10 01:42:36,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:42:36,725 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2025-01-10 01:42:36,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-10 01:42:36,726 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:36,726 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-01-10 01:42:36,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:42:36,727 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:42:36,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:36,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1765835350, now seen corresponding path program 1 times [2025-01-10 01:42:36,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:36,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233691932] [2025-01-10 01:42:36,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:36,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:36,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:42:36,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:42:36,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:36,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:36,899 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:42:36,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:36,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233691932] [2025-01-10 01:42:36,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233691932] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:42:36,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465837561] [2025-01-10 01:42:36,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:36,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:36,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:42:36,904 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-01-10 01:42:36,906 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-01-10 01:42:36,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:42:37,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:42:37,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:37,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:37,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 01:42:37,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:42:37,129 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:42:37,130 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:42:37,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465837561] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:42:37,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:42:37,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 01:42:37,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012962564] [2025-01-10 01:42:37,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:42:37,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:42:37,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:37,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:42:37,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:42:37,133 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:42:37,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:37,173 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2025-01-10 01:42:37,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:42:37,175 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2025-01-10 01:42:37,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:37,176 INFO L225 Difference]: With dead ends: 33 [2025-01-10 01:42:37,176 INFO L226 Difference]: Without dead ends: 32 [2025-01-10 01:42:37,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:42:37,177 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:37,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:37,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-01-10 01:42:37,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2025-01-10 01:42:37,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 24 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:42:37,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2025-01-10 01:42:37,187 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 22 [2025-01-10 01:42:37,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:37,188 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2025-01-10 01:42:37,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:42:37,188 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2025-01-10 01:42:37,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-10 01:42:37,189 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:37,189 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:37,198 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-01-10 01:42:37,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:37,393 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:42:37,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:37,393 INFO L85 PathProgramCache]: Analyzing trace with hash -219561297, now seen corresponding path program 1 times [2025-01-10 01:42:37,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:37,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586519216] [2025-01-10 01:42:37,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:37,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:37,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 01:42:37,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:42:37,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:37,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:37,541 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:42:37,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:37,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586519216] [2025-01-10 01:42:37,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586519216] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:42:37,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23974748] [2025-01-10 01:42:37,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:37,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:37,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:42:37,546 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-01-10 01:42:37,549 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-01-10 01:42:37,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 01:42:37,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:42:37,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:37,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:37,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 01:42:37,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:42:37,697 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:42:37,697 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:42:37,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23974748] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:42:37,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:42:37,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2025-01-10 01:42:37,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062318239] [2025-01-10 01:42:37,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:42:37,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:42:37,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:37,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:42:37,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:42:37,699 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:42:37,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:37,707 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2025-01-10 01:42:37,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:42:37,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2025-01-10 01:42:37,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:37,708 INFO L225 Difference]: With dead ends: 28 [2025-01-10 01:42:37,708 INFO L226 Difference]: Without dead ends: 27 [2025-01-10 01:42:37,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 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-01-10 01:42:37,709 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 7 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:37,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 33 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:37,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-01-10 01:42:37,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-01-10 01:42:37,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:42:37,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2025-01-10 01:42:37,713 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 25 [2025-01-10 01:42:37,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:37,713 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2025-01-10 01:42:37,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:42:37,713 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2025-01-10 01:42:37,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-10 01:42:37,714 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:37,714 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:37,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 01:42:37,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:37,918 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:42:37,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:37,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1783534459, now seen corresponding path program 1 times [2025-01-10 01:42:37,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:37,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068582190] [2025-01-10 01:42:37,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:37,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:37,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:42:37,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:42:37,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:37,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:38,026 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:42:38,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:38,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068582190] [2025-01-10 01:42:38,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068582190] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:42:38,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152985927] [2025-01-10 01:42:38,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:38,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:38,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:42:38,029 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-01-10 01:42:38,032 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-01-10 01:42:38,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:42:38,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:42:38,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:38,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:38,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 01:42:38,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:42:38,186 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:42:38,186 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:42:38,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152985927] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:42:38,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:42:38,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2025-01-10 01:42:38,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755492536] [2025-01-10 01:42:38,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:42:38,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:42:38,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:38,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:42:38,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:42:38,187 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:42:38,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:38,193 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2025-01-10 01:42:38,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:42:38,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-01-10 01:42:38,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:38,194 INFO L225 Difference]: With dead ends: 27 [2025-01-10 01:42:38,194 INFO L226 Difference]: Without dead ends: 24 [2025-01-10 01:42:38,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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-01-10 01:42:38,195 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:38,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:38,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-01-10 01:42:38,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-01-10 01:42:38,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:42:38,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2025-01-10 01:42:38,202 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 26 [2025-01-10 01:42:38,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:38,203 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2025-01-10 01:42:38,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:42:38,203 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2025-01-10 01:42:38,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-10 01:42:38,204 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:38,204 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:38,212 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-01-10 01:42:38,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:38,408 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:42:38,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:38,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1783523632, now seen corresponding path program 1 times [2025-01-10 01:42:38,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:38,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374998400] [2025-01-10 01:42:38,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:38,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:38,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:42:38,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:42:38,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:38,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:38,497 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:42:38,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:38,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374998400] [2025-01-10 01:42:38,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374998400] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:42:38,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131760151] [2025-01-10 01:42:38,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:38,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:38,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:42:38,504 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-01-10 01:42:38,507 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-01-10 01:42:38,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:42:38,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:42:38,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:38,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:38,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:42:38,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:42:38,685 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:42:38,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:42:38,730 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:42:38,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131760151] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:42:38,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:42:38,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-01-10 01:42:38,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729681999] [2025-01-10 01:42:38,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:42:38,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:42:38,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:38,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:42:38,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:42:38,743 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 01:42:38,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:38,774 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2025-01-10 01:42:38,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:42:38,775 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2025-01-10 01:42:38,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:38,775 INFO L225 Difference]: With dead ends: 45 [2025-01-10 01:42:38,775 INFO L226 Difference]: Without dead ends: 29 [2025-01-10 01:42:38,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:42:38,776 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:38,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 93 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:38,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-01-10 01:42:38,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-01-10 01:42:38,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:42:38,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2025-01-10 01:42:38,780 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 26 [2025-01-10 01:42:38,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:38,781 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2025-01-10 01:42:38,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 01:42:38,781 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2025-01-10 01:42:38,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-10 01:42:38,782 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:38,782 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:38,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 01:42:38,982 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,SelfDestructingSolverStorable6 [2025-01-10 01:42:38,983 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:42:38,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:38,983 INFO L85 PathProgramCache]: Analyzing trace with hash -490365766, now seen corresponding path program 2 times [2025-01-10 01:42:38,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:38,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862051234] [2025-01-10 01:42:38,983 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:42:38,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:39,004 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-10 01:42:39,006 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 36 statements. [2025-01-10 01:42:39,007 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:42:39,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:39,048 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 01:42:39,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:39,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862051234] [2025-01-10 01:42:39,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862051234] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:42:39,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:42:39,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:42:39,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392678815] [2025-01-10 01:42:39,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:42:39,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:42:39,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:39,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:42:39,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:42:39,050 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:42:39,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:39,069 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2025-01-10 01:42:39,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:42:39,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2025-01-10 01:42:39,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:39,070 INFO L225 Difference]: With dead ends: 35 [2025-01-10 01:42:39,070 INFO L226 Difference]: Without dead ends: 33 [2025-01-10 01:42:39,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:42:39,071 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:39,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 61 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:39,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-01-10 01:42:39,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-01-10 01:42:39,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:42:39,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2025-01-10 01:42:39,078 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 36 [2025-01-10 01:42:39,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:39,078 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2025-01-10 01:42:39,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:42:39,078 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2025-01-10 01:42:39,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-10 01:42:39,080 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:39,080 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:39,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:42:39,080 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:42:39,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:39,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1728807309, now seen corresponding path program 1 times [2025-01-10 01:42:39,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:39,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407414670] [2025-01-10 01:42:39,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:39,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:39,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-10 01:42:39,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-10 01:42:39,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:39,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:39,198 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 01:42:39,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:39,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407414670] [2025-01-10 01:42:39,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407414670] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:42:39,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223629506] [2025-01-10 01:42:39,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:39,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:39,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:42:39,201 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-01-10 01:42:39,203 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-01-10 01:42:39,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-10 01:42:39,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-10 01:42:39,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:39,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:39,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:42:39,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:42:39,396 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 01:42:39,396 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:42:39,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223629506] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:42:39,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:42:39,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 01:42:39,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665352608] [2025-01-10 01:42:39,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:42:39,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:42:39,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:39,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:42:39,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:42:39,398 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:42:39,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:39,427 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2025-01-10 01:42:39,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:42:39,427 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2025-01-10 01:42:39,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:39,428 INFO L225 Difference]: With dead ends: 33 [2025-01-10 01:42:39,428 INFO L226 Difference]: Without dead ends: 32 [2025-01-10 01:42:39,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:42:39,429 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:39,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 96 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:39,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-01-10 01:42:39,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-01-10 01:42:39,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:42:39,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2025-01-10 01:42:39,440 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 40 [2025-01-10 01:42:39,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:39,440 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2025-01-10 01:42:39,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:42:39,440 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2025-01-10 01:42:39,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-10 01:42:39,441 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:39,441 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:39,452 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-01-10 01:42:39,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:39,642 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:42:39,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:39,643 INFO L85 PathProgramCache]: Analyzing trace with hash -2053418959, now seen corresponding path program 1 times [2025-01-10 01:42:39,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:39,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656361625] [2025-01-10 01:42:39,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:39,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:39,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-10 01:42:39,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 01:42:39,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:39,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:39,794 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 01:42:39,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:39,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656361625] [2025-01-10 01:42:39,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656361625] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:42:39,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726505770] [2025-01-10 01:42:39,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:39,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:39,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:42:39,797 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-01-10 01:42:39,799 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-01-10 01:42:39,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-10 01:42:39,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 01:42:39,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:39,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:39,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:42:39,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:42:39,978 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 01:42:39,978 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:42:40,035 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 01:42:40,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726505770] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:42:40,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:42:40,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 01:42:40,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472453547] [2025-01-10 01:42:40,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:42:40,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:42:40,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:40,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:42:40,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:42:40,037 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:42:40,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:40,067 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2025-01-10 01:42:40,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:42:40,068 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2025-01-10 01:42:40,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:40,069 INFO L225 Difference]: With dead ends: 45 [2025-01-10 01:42:40,069 INFO L226 Difference]: Without dead ends: 44 [2025-01-10 01:42:40,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:42:40,071 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:40,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:40,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-01-10 01:42:40,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-01-10 01:42:40,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:42:40,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2025-01-10 01:42:40,079 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 41 [2025-01-10 01:42:40,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:40,079 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2025-01-10 01:42:40,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:42:40,079 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2025-01-10 01:42:40,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-10 01:42:40,080 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:40,080 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:40,089 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-01-10 01:42:40,280 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,SelfDestructingSolverStorable9 [2025-01-10 01:42:40,281 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:42:40,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:40,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1990194330, now seen corresponding path program 2 times [2025-01-10 01:42:40,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:40,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085616493] [2025-01-10 01:42:40,282 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:42:40,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:40,300 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-01-10 01:42:40,317 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-01-10 01:42:40,317 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:42:40,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:40,594 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 01:42:40,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:40,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085616493] [2025-01-10 01:42:40,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085616493] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:42:40,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992828933] [2025-01-10 01:42:40,595 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:42:40,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:40,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:42:40,597 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-01-10 01:42:40,599 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-01-10 01:42:40,715 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-01-10 01:42:40,772 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-01-10 01:42:40,773 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:42:40,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:40,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 01:42:40,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:42:40,829 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 01:42:40,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:42:40,995 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 01:42:40,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992828933] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:42:40,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:42:40,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-01-10 01:42:40,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558278865] [2025-01-10 01:42:40,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:42:40,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 01:42:40,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:40,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 01:42:40,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-01-10 01:42:40,998 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 24 states, 23 states have (on average 2.652173913043478) internal successors, (61), 24 states have internal predecessors, (61), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:42:41,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:41,057 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2025-01-10 01:42:41,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-10 01:42:41,057 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.652173913043478) internal successors, (61), 24 states have internal predecessors, (61), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 53 [2025-01-10 01:42:41,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:41,058 INFO L225 Difference]: With dead ends: 69 [2025-01-10 01:42:41,058 INFO L226 Difference]: Without dead ends: 68 [2025-01-10 01:42:41,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-01-10 01:42:41,059 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:41,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:41,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-01-10 01:42:41,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-01-10 01:42:41,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 63 states have (on average 1.0317460317460319) internal successors, (65), 63 states have internal predecessors, (65), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:42:41,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2025-01-10 01:42:41,066 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 53 [2025-01-10 01:42:41,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:41,066 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2025-01-10 01:42:41,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.652173913043478) internal successors, (61), 24 states have internal predecessors, (61), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:42:41,067 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2025-01-10 01:42:41,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-10 01:42:41,067 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:41,068 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:41,075 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-01-10 01:42:41,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:41,268 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:42:41,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:41,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1140307120, now seen corresponding path program 3 times [2025-01-10 01:42:41,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:41,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871858521] [2025-01-10 01:42:41,269 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:42:41,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:41,292 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 77 statements into 11 equivalence classes. [2025-01-10 01:42:41,379 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 73 of 77 statements. [2025-01-10 01:42:41,379 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-01-10 01:42:41,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:44,835 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 84 proven. 21 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2025-01-10 01:42:44,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:44,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871858521] [2025-01-10 01:42:44,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871858521] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:42:44,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248758050] [2025-01-10 01:42:44,835 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:42:44,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:44,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:42:44,839 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-01-10 01:42:44,840 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-01-10 01:42:44,971 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 77 statements into 11 equivalence classes. [2025-01-10 01:42:45,815 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 73 of 77 statements. [2025-01-10 01:42:45,815 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-01-10 01:42:45,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:45,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 138 conjuncts are in the unsatisfiable core [2025-01-10 01:42:45,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:42:45,900 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-01-10 01:42:45,984 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-01-10 01:42:45,990 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-01-10 01:42:46,219 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 01:42:46,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-01-10 01:42:46,248 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 01:42:46,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-01-10 01:42:46,279 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-10 01:42:46,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-10 01:42:46,369 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 27 treesize of output 15 [2025-01-10 01:42:46,381 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 22 [2025-01-10 01:42:46,693 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-01-10 01:42:46,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 27 [2025-01-10 01:42:46,703 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 15 treesize of output 7 [2025-01-10 01:42:46,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-01-10 01:42:47,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:42:47,016 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-01-10 01:42:47,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 51 [2025-01-10 01:42:47,053 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2025-01-10 01:42:47,054 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 2 case distinctions, treesize of input 35 treesize of output 53 [2025-01-10 01:42:47,090 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-01-10 01:42:47,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-01-10 01:42:47,252 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2025-01-10 01:42:47,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 63 [2025-01-10 01:42:47,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 69 [2025-01-10 01:42:47,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2025-01-10 01:42:47,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2025-01-10 01:42:47,301 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2025-01-10 01:42:47,301 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2025-01-10 01:42:47,410 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 116 treesize of output 80 [2025-01-10 01:42:47,928 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2025-01-10 01:42:47,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 43 [2025-01-10 01:42:47,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 01:42:48,002 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 85 proven. 21 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-01-10 01:42:48,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:42:48,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:42:48,444 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 643 treesize of output 646 [2025-01-10 01:42:48,533 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:42:48,533 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 263 treesize of output 267 [2025-01-10 01:42:48,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:42:48,895 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 851 treesize of output 770 [2025-01-10 01:42:48,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:42:48,906 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 760 treesize of output 679 [2025-01-10 01:43:30,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248758050] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:43:30,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:43:30,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 42 [2025-01-10 01:43:30,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985567376] [2025-01-10 01:43:30,963 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 01:43:30,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-01-10 01:43:30,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:30,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-01-10 01:43:30,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=2310, Unknown=0, NotChecked=0, Total=2450 [2025-01-10 01:43:30,966 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 42 states, 40 states have (on average 1.675) internal successors, (67), 34 states have internal predecessors, (67), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 01:43:48,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:48,697 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2025-01-10 01:43:48,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-10 01:43:48,697 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 1.675) internal successors, (67), 34 states have internal predecessors, (67), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 77 [2025-01-10 01:43:48,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:48,698 INFO L225 Difference]: With dead ends: 130 [2025-01-10 01:43:48,698 INFO L226 Difference]: Without dead ends: 75 [2025-01-10 01:43:48,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 59.3s TimeCoverageRelationStatistics Valid=215, Invalid=3444, Unknown=1, NotChecked=0, Total=3660 [2025-01-10 01:43:48,701 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:48,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 469 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-10 01:43:48,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-01-10 01:43:48,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2025-01-10 01:43:48,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:43:48,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2025-01-10 01:43:48,707 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 77 [2025-01-10 01:43:48,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:48,707 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2025-01-10 01:43:48,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 1.675) internal successors, (67), 34 states have internal predecessors, (67), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 01:43:48,707 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2025-01-10 01:43:48,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-10 01:43:48,708 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:48,708 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:43:48,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 01:43:48,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:43:48,909 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:43:48,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:48,909 INFO L85 PathProgramCache]: Analyzing trace with hash -474648698, now seen corresponding path program 4 times [2025-01-10 01:43:48,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:48,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218023248] [2025-01-10 01:43:48,909 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:43:48,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:48,926 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 87 statements into 2 equivalence classes. [2025-01-10 01:43:49,003 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 58 of 87 statements. [2025-01-10 01:43:49,003 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-10 01:43:49,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:52,599 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 111 proven. 47 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-01-10 01:43:52,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:52,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218023248] [2025-01-10 01:43:52,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218023248] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:43:52,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970405263] [2025-01-10 01:43:52,600 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:43:52,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:43:52,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:43:52,603 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-01-10 01:43:52,604 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-01-10 01:43:52,732 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 87 statements into 2 equivalence classes. [2025-01-10 01:43:52,823 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 58 of 87 statements. [2025-01-10 01:43:52,823 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-10 01:43:52,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:52,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 165 conjuncts are in the unsatisfiable core [2025-01-10 01:43:52,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:43:52,896 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-01-10 01:43:52,963 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-01-10 01:43:52,966 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-01-10 01:43:53,150 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 01:43:53,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-01-10 01:43:53,171 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 01:43:53,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-01-10 01:43:53,189 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-10 01:43:53,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-10 01:43:53,247 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 27 treesize of output 26 [2025-01-10 01:43:53,257 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-01-10 01:43:53,514 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0))) (and (= 0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0)) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 4) 0) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_23| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_23| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1) (not (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) is different from false [2025-01-10 01:43:53,517 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0))) (and (= 0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0)) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 4) 0) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_23| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_23| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1) (not (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) is different from true [2025-01-10 01:43:53,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:43:53,568 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2025-01-10 01:43:53,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 51 [2025-01-10 01:43:53,622 INFO L349 Elim1Store]: treesize reduction 98, result has 36.8 percent of original size [2025-01-10 01:43:53,622 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 2 case distinctions, treesize of input 54 treesize of output 63 [2025-01-10 01:43:53,637 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (.cse3 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse3))) (and (not (= .cse0 .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_23| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_23| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 1))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse3) 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from false [2025-01-10 01:43:53,640 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (.cse3 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse3))) (and (not (= .cse0 .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_23| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_23| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 1))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse3) 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from true [2025-01-10 01:43:53,752 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)) (.cse3 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse3))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (not (= .cse0 .cse1)) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_23| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_23| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_sll_create_#res#1.base|) 0))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse1)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse3) 0)))) is different from false [2025-01-10 01:43:53,755 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)) (.cse3 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse3))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (not (= .cse0 .cse1)) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_23| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_23| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_sll_create_#res#1.base|) 0))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse1)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse3) 0)))) is different from true [2025-01-10 01:43:53,811 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4)) (.cse4 (+ (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse4))) (and (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse0 .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_23| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_23| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse3) 0))) (= (select |c_#valid| .cse3) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse4) 0) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= .cse1 .cse3) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0)) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 4) 0))))) is different from false [2025-01-10 01:43:53,813 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4)) (.cse4 (+ (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse4))) (and (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse0 .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_23| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_23| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse3) 0))) (= (select |c_#valid| .cse3) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse4) 0) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= .cse1 .cse3) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0)) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 4) 0))))) is different from true [2025-01-10 01:43:53,842 INFO L349 Elim1Store]: treesize reduction 56, result has 1.8 percent of original size [2025-01-10 01:43:53,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 188 treesize of output 56 [2025-01-10 01:43:53,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:43:53,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:43:53,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 20 [2025-01-10 01:43:53,887 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((v_arrayElimIndex_7 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2| Int) (v_arrayElimIndex_8 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_23| v_arrayElimIndex_8) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_23| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1))) |v_#valid_BEFORE_CALL_9|) (not (= v_arrayElimIndex_7 v_arrayElimIndex_8)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_23| v_arrayElimIndex_7) 1)))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2025-01-10 01:43:53,890 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((v_arrayElimIndex_7 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2| Int) (v_arrayElimIndex_8 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_23| v_arrayElimIndex_8) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_23| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1))) |v_#valid_BEFORE_CALL_9|) (not (= v_arrayElimIndex_7 v_arrayElimIndex_8)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_23| v_arrayElimIndex_7) 1)))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2025-01-10 01:43:53,930 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_7 Int) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2| Int) (v_arrayElimIndex_8 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_23| v_arrayElimIndex_8) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_23| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1))) |v_#valid_BEFORE_CALL_9|) (not (= v_arrayElimIndex_7 v_arrayElimIndex_8)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_23| v_arrayElimIndex_7) 1)))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2025-01-10 01:43:53,933 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_7 Int) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2| Int) (v_arrayElimIndex_8 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_23| v_arrayElimIndex_8) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_23| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1))) |v_#valid_BEFORE_CALL_9|) (not (= v_arrayElimIndex_7 v_arrayElimIndex_8)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_23| v_arrayElimIndex_7) 1)))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2025-01-10 01:43:54,019 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_node_create_#res#1.offset| 4))) (and (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (store (store (select |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base|) .cse0 0) |c_node_create_#res#1.offset| (select (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|) |c_node_create_#res#1.offset|)))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((v_arrayElimIndex_7 Int) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2| Int) (v_arrayElimIndex_8 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_23| v_arrayElimIndex_8) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_23| .cse2 (select |v_#valid_BEFORE_CALL_9| .cse2))) |v_#valid_BEFORE_CALL_9|) (not (= v_arrayElimIndex_7 v_arrayElimIndex_8)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_23| v_arrayElimIndex_7) 1)))) (= (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (store (store (select |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base|) .cse0 0) |c_node_create_#res#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|) |c_node_create_#res#1.offset|))) |c_#memory_$Pointer$#1.offset|))) is different from false [2025-01-10 01:43:54,023 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_node_create_#res#1.offset| 4))) (and (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (store (store (select |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base|) .cse0 0) |c_node_create_#res#1.offset| (select (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|) |c_node_create_#res#1.offset|)))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((v_arrayElimIndex_7 Int) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2| Int) (v_arrayElimIndex_8 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_23| v_arrayElimIndex_8) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_23| .cse2 (select |v_#valid_BEFORE_CALL_9| .cse2))) |v_#valid_BEFORE_CALL_9|) (not (= v_arrayElimIndex_7 v_arrayElimIndex_8)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_23| v_arrayElimIndex_7) 1)))) (= (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (store (store (select |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base|) .cse0 0) |c_node_create_#res#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|) |c_node_create_#res#1.offset|))) |c_#memory_$Pointer$#1.offset|))) is different from true [2025-01-10 01:43:54,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:43:54,173 INFO L349 Elim1Store]: treesize reduction 238, result has 9.5 percent of original size [2025-01-10 01:43:54,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 208 treesize of output 100 [2025-01-10 01:43:54,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:43:54,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:43:54,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:43:54,219 INFO L349 Elim1Store]: treesize reduction 91, result has 7.1 percent of original size [2025-01-10 01:43:54,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 195 treesize of output 159 [2025-01-10 01:43:54,316 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4)) (.cse7 (+ (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 4))) (let ((.cse0 (+ |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 4)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse7))) (and (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse0) 0) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse1 .cse2)) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= |v_#valid_BEFORE_CALL_10| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_10|))) (store |v_old(#valid)_AFTER_CALL_23| .cse4 (select |v_#valid_BEFORE_CALL_10| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_23| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse0) 0) (exists ((v_arrayElimIndex_7 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2| Int) (v_arrayElimIndex_8 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse5) 1) (not (= v_arrayElimIndex_7 v_arrayElimIndex_8)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_8) 1) (= (select |v_old(#valid)_AFTER_CALL_25| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_7) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_25| .cse6 (select |v_#valid_BEFORE_CALL_9| .cse6))) |v_#valid_BEFORE_CALL_9|)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse7) 0) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= .cse2 .cse3) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0)) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) 4) 0))))) is different from false [2025-01-10 01:43:54,321 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4)) (.cse7 (+ (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 4))) (let ((.cse0 (+ |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 4)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse7))) (and (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse0) 0) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse1 .cse2)) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= |v_#valid_BEFORE_CALL_10| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_10|))) (store |v_old(#valid)_AFTER_CALL_23| .cse4 (select |v_#valid_BEFORE_CALL_10| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_23| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse0) 0) (exists ((v_arrayElimIndex_7 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2| Int) (v_arrayElimIndex_8 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse5) 1) (not (= v_arrayElimIndex_7 v_arrayElimIndex_8)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_8) 1) (= (select |v_old(#valid)_AFTER_CALL_25| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_7) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_25| .cse6 (select |v_#valid_BEFORE_CALL_9| .cse6))) |v_#valid_BEFORE_CALL_9|)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse7) 0) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= .cse2 .cse3) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0)) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) 4) 0))))) is different from true [2025-01-10 01:43:54,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:43:54,502 INFO L349 Elim1Store]: treesize reduction 218, result has 10.3 percent of original size [2025-01-10 01:43:54,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 234 treesize of output 115 [2025-01-10 01:43:54,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:43:54,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:43:54,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:43:54,559 INFO L349 Elim1Store]: treesize reduction 93, result has 7.0 percent of original size [2025-01-10 01:43:54,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 217 treesize of output 170 [2025-01-10 01:43:54,638 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2025-01-10 01:43:54,638 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 260 treesize of output 192 [2025-01-10 01:43:54,713 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2025-01-10 01:43:54,714 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 22 [2025-01-10 01:43:55,322 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse5 (+ .cse8 4))) (let ((.cse3 (select .cse11 .cse5))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4)) (.cse6 (+ (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse6))) (and (not (= .cse0 .cse1)) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse3) 0) (= |v_#valid_BEFORE_CALL_10| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_10|))) (store |v_old(#valid)_AFTER_CALL_23| .cse4 (select |v_#valid_BEFORE_CALL_10| .cse4)))) (= (select |v_#valid_BEFORE_CALL_10| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse5) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse6) 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 .cse3)) (or (exists ((v_arrayElimIndex_7 Int) (v_arrayElimIndex_8 Int)) (and (not (= v_arrayElimIndex_7 v_arrayElimIndex_8)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_8) 1) (= (select |v_old(#valid)_AFTER_CALL_25| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_7) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_25| .cse7 (select |v_#valid_BEFORE_CALL_9| .cse7))) |v_#valid_BEFORE_CALL_9|))))) (and (= .cse8 0) (exists ((v_arrayElimIndex_7 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (v_arrayElimIndex_8 Int)) (let ((.cse9 (select .cse11 4))) (and (= (select |v_old(#valid)_AFTER_CALL_25| .cse9) 0) (not (= v_arrayElimIndex_7 v_arrayElimIndex_8)) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_8) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse9) 1) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_7) 1) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_25| .cse10 (select |v_#valid_BEFORE_CALL_9| .cse10))) |v_#valid_BEFORE_CALL_9|))))) (exists ((v_arrayElimIndex_7 Int) (v_arrayElimIndex_8 Int)) (and (not (= v_arrayElimIndex_7 v_arrayElimIndex_8)) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2| Int)) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|) 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse12) 1) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_8) 1) (= (select |v_old(#valid)_AFTER_CALL_25| .cse12) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_7) 1) (= (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_25| .cse13 (select |v_#valid_BEFORE_CALL_9| .cse13))) |v_#valid_BEFORE_CALL_9|)))) (not (= |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (exists ((v_arrayElimIndex_7 Int) (v_arrayElimIndex_8 Int)) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2| Int)) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|) 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (let ((.cse14 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse14) 1) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_8) 1) (= (select |v_old(#valid)_AFTER_CALL_25| .cse14) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_7) 1) (= (let ((.cse15 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_25| .cse15 (select |v_#valid_BEFORE_CALL_9| .cse15))) |v_#valid_BEFORE_CALL_9|)))) (not (= |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#s~0#1.base|)))) (not (= v_arrayElimIndex_7 v_arrayElimIndex_8))))))))))) is different from false [2025-01-10 01:43:55,327 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse5 (+ .cse8 4))) (let ((.cse3 (select .cse11 .cse5))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4)) (.cse6 (+ (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse6))) (and (not (= .cse0 .cse1)) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse3) 0) (= |v_#valid_BEFORE_CALL_10| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_10|))) (store |v_old(#valid)_AFTER_CALL_23| .cse4 (select |v_#valid_BEFORE_CALL_10| .cse4)))) (= (select |v_#valid_BEFORE_CALL_10| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse5) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse6) 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 .cse3)) (or (exists ((v_arrayElimIndex_7 Int) (v_arrayElimIndex_8 Int)) (and (not (= v_arrayElimIndex_7 v_arrayElimIndex_8)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_8) 1) (= (select |v_old(#valid)_AFTER_CALL_25| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_7) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_25| .cse7 (select |v_#valid_BEFORE_CALL_9| .cse7))) |v_#valid_BEFORE_CALL_9|))))) (and (= .cse8 0) (exists ((v_arrayElimIndex_7 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (v_arrayElimIndex_8 Int)) (let ((.cse9 (select .cse11 4))) (and (= (select |v_old(#valid)_AFTER_CALL_25| .cse9) 0) (not (= v_arrayElimIndex_7 v_arrayElimIndex_8)) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_8) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse9) 1) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_7) 1) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_25| .cse10 (select |v_#valid_BEFORE_CALL_9| .cse10))) |v_#valid_BEFORE_CALL_9|))))) (exists ((v_arrayElimIndex_7 Int) (v_arrayElimIndex_8 Int)) (and (not (= v_arrayElimIndex_7 v_arrayElimIndex_8)) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2| Int)) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|) 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse12) 1) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_8) 1) (= (select |v_old(#valid)_AFTER_CALL_25| .cse12) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_7) 1) (= (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_25| .cse13 (select |v_#valid_BEFORE_CALL_9| .cse13))) |v_#valid_BEFORE_CALL_9|)))) (not (= |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (exists ((v_arrayElimIndex_7 Int) (v_arrayElimIndex_8 Int)) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2| Int)) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|) 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (let ((.cse14 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse14) 1) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_8) 1) (= (select |v_old(#valid)_AFTER_CALL_25| .cse14) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_7) 1) (= (let ((.cse15 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_25| .cse15 (select |v_#valid_BEFORE_CALL_9| .cse15))) |v_#valid_BEFORE_CALL_9|)))) (not (= |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#s~0#1.base|)))) (not (= v_arrayElimIndex_7 v_arrayElimIndex_8))))))))))) is different from true [2025-01-10 01:43:55,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:43:55,430 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 647 treesize of output 571 [2025-01-10 01:43:55,508 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:43:55,508 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 534 treesize of output 474 [2025-01-10 01:43:56,081 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse2))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4)) (.cse5 (+ (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse5))) (and (not (= .cse0 .cse1)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse2) 0) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_23| .cse0)) (= |v_#valid_BEFORE_CALL_10| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_10|))) (store |v_old(#valid)_AFTER_CALL_23| .cse3 (select |v_#valid_BEFORE_CALL_10| .cse3)))) (= (select |v_#valid_BEFORE_CALL_10| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse4) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse5) 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 .cse4)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0)))))) is different from false [2025-01-10 01:43:56,083 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse2))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4)) (.cse5 (+ (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse5))) (and (not (= .cse0 .cse1)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse2) 0) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_23| .cse0)) (= |v_#valid_BEFORE_CALL_10| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_10|))) (store |v_old(#valid)_AFTER_CALL_23| .cse3 (select |v_#valid_BEFORE_CALL_10| .cse3)))) (= (select |v_#valid_BEFORE_CALL_10| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse4) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse5) 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 .cse4)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0)))))) is different from true [2025-01-10 01:43:56,205 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_39| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_39| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_39| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse2))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (.cse5 (+ (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse5))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse2) 0) (= |v_#valid_BEFORE_CALL_10| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_10|))) (store |v_old(#valid)_AFTER_CALL_23| .cse3 (select |v_#valid_BEFORE_CALL_10| .cse3)))) (not (= .cse0 .cse4)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse4) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) .cse5) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1)))))))) is different from false [2025-01-10 01:43:56,213 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_39| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_39| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_39| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse2))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (.cse5 (+ (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse5))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse2) 0) (= |v_#valid_BEFORE_CALL_10| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_10|))) (store |v_old(#valid)_AFTER_CALL_23| .cse3 (select |v_#valid_BEFORE_CALL_10| .cse3)))) (not (= .cse0 .cse4)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse4) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) .cse5) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1)))))))) is different from true [2025-01-10 01:43:56,281 WARN L851 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_39| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_39| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_39| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse2))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (.cse6 (+ .cse5 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse6))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse2) 0) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse3) (not (= .cse1 0)) (= |v_#valid_BEFORE_CALL_10| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_10|))) (store |v_old(#valid)_AFTER_CALL_23| .cse4 (select |v_#valid_BEFORE_CALL_10| .cse4)))) (not (= .cse0 .cse3)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) 0) (= |c_ULTIMATE.start_main_~temp~2#1.offset| .cse5) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse3) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse6) 0)))))))) is different from false [2025-01-10 01:43:56,285 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_39| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_39| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_39| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse2))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (.cse6 (+ .cse5 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse6))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse2) 0) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse3) (not (= .cse1 0)) (= |v_#valid_BEFORE_CALL_10| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_10|))) (store |v_old(#valid)_AFTER_CALL_23| .cse4 (select |v_#valid_BEFORE_CALL_10| .cse4)))) (not (= .cse0 .cse3)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) 0) (= |c_ULTIMATE.start_main_~temp~2#1.offset| .cse5) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse3) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse6) 0)))))))) is different from true [2025-01-10 01:43:56,355 WARN L851 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_39| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_39| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_39| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse2))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (.cse6 (+ .cse5 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse6))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse2) 0) (not (= .cse1 0)) (= |v_#valid_BEFORE_CALL_10| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_10|))) (store |v_old(#valid)_AFTER_CALL_23| .cse3 (select |v_#valid_BEFORE_CALL_10| .cse3)))) (not (= .cse0 .cse4)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) 0) (= .cse5 |c_ULTIMATE.start_main_~ptr~0#1.offset|) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse4) (= (select |v_old(#valid)_AFTER_CALL_23| .cse4) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) .cse6) 0)))))))) is different from false [2025-01-10 01:43:56,358 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_39| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_39| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_39| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse2))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (.cse6 (+ .cse5 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse6))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse2) 0) (not (= .cse1 0)) (= |v_#valid_BEFORE_CALL_10| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_10|))) (store |v_old(#valid)_AFTER_CALL_23| .cse3 (select |v_#valid_BEFORE_CALL_10| .cse3)))) (not (= .cse0 .cse4)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) 0) (= .cse5 |c_ULTIMATE.start_main_~ptr~0#1.offset|) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse4) (= (select |v_old(#valid)_AFTER_CALL_23| .cse4) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) .cse6) 0)))))))) is different from true [2025-01-10 01:43:56,498 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_39| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_39| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_39| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse2))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (.cse5 (+ (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse5))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse2) 0) (= .cse0 |c_ULTIMATE.start_main_~temp~2#1.base|) (not (= .cse1 0)) (= |v_#valid_BEFORE_CALL_10| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_10|))) (store |v_old(#valid)_AFTER_CALL_23| .cse3 (select |v_#valid_BEFORE_CALL_10| .cse3)))) (not (= .cse0 .cse4)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse4) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) .cse5) 0)))))))) is different from false [2025-01-10 01:43:56,500 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_39| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_39| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_39| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse2))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (.cse5 (+ (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse5))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse2) 0) (= .cse0 |c_ULTIMATE.start_main_~temp~2#1.base|) (not (= .cse1 0)) (= |v_#valid_BEFORE_CALL_10| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_10|))) (store |v_old(#valid)_AFTER_CALL_23| .cse3 (select |v_#valid_BEFORE_CALL_10| .cse3)))) (not (= .cse0 .cse4)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse4) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) .cse5) 0)))))))) is different from true [2025-01-10 01:43:56,558 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_39| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_39| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_39| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse2))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (.cse5 (+ (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse5))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse2) 0) (not (= .cse1 0)) (= |v_#valid_BEFORE_CALL_10| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_10|))) (store |v_old(#valid)_AFTER_CALL_23| .cse3 (select |v_#valid_BEFORE_CALL_10| .cse3)))) (not (= .cse0 .cse4)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse4) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) .cse5) 0)))))))) is different from false [2025-01-10 01:43:56,560 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_39| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_39| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_39| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse2))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (.cse5 (+ (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse5))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse2) 0) (not (= .cse1 0)) (= |v_#valid_BEFORE_CALL_10| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_10|))) (store |v_old(#valid)_AFTER_CALL_23| .cse3 (select |v_#valid_BEFORE_CALL_10| .cse3)))) (not (= .cse0 .cse4)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse4) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) .cse5) 0)))))))) is different from true [2025-01-10 01:43:56,657 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 111 proven. 13 refuted. 0 times theorem prover too weak. 106 trivial. 38 not checked. [2025-01-10 01:43:56,657 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:43:59,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970405263] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:43:59,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:43:59,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31] total 51 [2025-01-10 01:43:59,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85637089] [2025-01-10 01:43:59,016 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 01:43:59,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-01-10 01:43:59,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:59,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-01-10 01:43:59,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1871, Unknown=30, NotChecked=1500, Total=3540 [2025-01-10 01:43:59,020 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 51 states, 49 states have (on average 1.7551020408163265) internal successors, (86), 41 states have internal predecessors, (86), 8 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 01:43:59,383 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse2 (select .cse5 4)) (.cse3 (select .cse5 .cse1))) (and (= (select .cse0 4) 0) (= 0 (select .cse0 .cse1)) (not (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |c_#valid| .cse2) 1) (not (= .cse2 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|)) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) 4) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) 4) 0) (= (select |c_#valid| .cse3) 1) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_23| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_23| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1) (not (= .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) is different from false [2025-01-10 01:43:59,385 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse2 (select .cse5 4)) (.cse3 (select .cse5 .cse1))) (and (= (select .cse0 4) 0) (= 0 (select .cse0 .cse1)) (not (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |c_#valid| .cse2) 1) (not (= .cse2 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|)) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) 4) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) 4) 0) (= (select |c_#valid| .cse3) 1) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_23| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_23| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1) (not (= .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) is different from true [2025-01-10 01:43:59,388 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse6 (+ .cse2 4))) (let ((.cse1 (select .cse7 .cse6)) (.cse5 (select |c_#memory_$Pointer$#1.offset| .cse0)) (.cse3 (select .cse7 4))) (and (not (= .cse0 .cse1)) (= .cse2 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_23| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_23| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 1))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (= (select .cse5 4) 0) (= (select .cse5 .cse6) 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| .cse3) 1))))) is different from false [2025-01-10 01:43:59,390 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse6 (+ .cse2 4))) (let ((.cse1 (select .cse7 .cse6)) (.cse5 (select |c_#memory_$Pointer$#1.offset| .cse0)) (.cse3 (select .cse7 4))) (and (not (= .cse0 .cse1)) (= .cse2 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_23| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_23| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 1))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (= (select .cse5 4) 0) (= (select .cse5 .cse6) 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| .cse3) 1))))) is different from true [2025-01-10 01:43:59,396 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (let ((.cse6 (+ .cse1 4)) (.cse7 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse0 (select .cse7 4)) (.cse3 (select .cse7 .cse6)) (.cse4 (select |c_#memory_$Pointer$#1.offset| .cse2))) (and (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= .cse1 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (not (= .cse2 .cse3)) (= (select .cse4 4) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_23| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_23| .cse5 (select |c_#valid| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_23| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_sll_create_#res#1.base|) 0))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse3)) (= (select .cse4 .cse6) 0))))) is different from false [2025-01-10 01:43:59,399 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (let ((.cse6 (+ .cse1 4)) (.cse7 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse0 (select .cse7 4)) (.cse3 (select .cse7 .cse6)) (.cse4 (select |c_#memory_$Pointer$#1.offset| .cse2))) (and (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= .cse1 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (not (= .cse2 .cse3)) (= (select .cse4 4) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_23| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_23| .cse5 (select |c_#valid| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_23| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_sll_create_#res#1.base|) 0))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse3)) (= (select .cse4 .cse6) 0))))) is different from true [2025-01-10 01:43:59,405 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse6) 4)) (.cse7 (+ (select (select |c_#memory_$Pointer$#1.offset| .cse6) 4) 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse7))) (and (not (= |c_ULTIMATE.start_main_~uneq~0#1| 1)) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse0 .cse1)) (= (select |c_#valid| .cse2) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse4) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|) 0) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 1) (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_23| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_23| .cse5 (select |c_#valid| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse6) 0))) (= (select |c_#valid| .cse6) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse7) 0) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| .cse4) 1) (or (= .cse1 .cse6) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0)) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 4) 0))))) is different from false [2025-01-10 01:43:59,407 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse6) 4)) (.cse7 (+ (select (select |c_#memory_$Pointer$#1.offset| .cse6) 4) 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse7))) (and (not (= |c_ULTIMATE.start_main_~uneq~0#1| 1)) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse0 .cse1)) (= (select |c_#valid| .cse2) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse4) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|) 0) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 1) (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_23| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_23| .cse5 (select |c_#valid| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse6) 0))) (= (select |c_#valid| .cse6) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse7) 0) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| .cse4) 1) (or (= .cse1 .cse6) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0)) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 4) 0))))) is different from true [2025-01-10 01:43:59,410 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_7 Int) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2| Int) (v_arrayElimIndex_8 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_23| v_arrayElimIndex_8) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_23| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1))) |v_#valid_BEFORE_CALL_9|) (not (= v_arrayElimIndex_7 v_arrayElimIndex_8)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_23| v_arrayElimIndex_7) 1)))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2025-01-10 01:43:59,412 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_7 Int) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2| Int) (v_arrayElimIndex_8 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_23| v_arrayElimIndex_8) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_23| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1))) |v_#valid_BEFORE_CALL_9|) (not (= v_arrayElimIndex_7 v_arrayElimIndex_8)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_23| v_arrayElimIndex_7) 1)))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2025-01-10 01:43:59,423 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|)) (.cse1 (+ |c_node_create_#res#1.offset| 4)) (.cse4 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|))) (and (or (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= .cse0 |c_node_create_#res#1.base|)) (= |c_node_create_#res#1.offset| 0) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (store (store (select |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base|) .cse1 0) |c_node_create_#res#1.offset| (select (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|) |c_node_create_#res#1.offset|)))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((v_arrayElimIndex_7 Int) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2| Int) (v_arrayElimIndex_8 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_23| v_arrayElimIndex_8) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_23| .cse3 (select |v_#valid_BEFORE_CALL_9| .cse3))) |v_#valid_BEFORE_CALL_9|) (not (= v_arrayElimIndex_7 v_arrayElimIndex_8)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_23| v_arrayElimIndex_7) 1)))) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#res#1.base| .cse4)) (= (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (store (store (select |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base|) .cse1 0) |c_node_create_#res#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|) |c_node_create_#res#1.offset|))) |c_#memory_$Pointer$#1.offset|) (= |c_#valid| (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse5 (select |c_#valid| .cse5)))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse4 (select |c_#memory_$Pointer$#1.offset| .cse4))))) is different from false [2025-01-10 01:43:59,427 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|)) (.cse1 (+ |c_node_create_#res#1.offset| 4)) (.cse4 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|))) (and (or (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= .cse0 |c_node_create_#res#1.base|)) (= |c_node_create_#res#1.offset| 0) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (store (store (select |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base|) .cse1 0) |c_node_create_#res#1.offset| (select (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|) |c_node_create_#res#1.offset|)))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((v_arrayElimIndex_7 Int) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2| Int) (v_arrayElimIndex_8 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_23| v_arrayElimIndex_8) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_23| .cse3 (select |v_#valid_BEFORE_CALL_9| .cse3))) |v_#valid_BEFORE_CALL_9|) (not (= v_arrayElimIndex_7 v_arrayElimIndex_8)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_23| v_arrayElimIndex_7) 1)))) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#res#1.base| .cse4)) (= (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (store (store (select |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base|) .cse1 0) |c_node_create_#res#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|) |c_node_create_#res#1.offset|))) |c_#memory_$Pointer$#1.offset|) (= |c_#valid| (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse5 (select |c_#valid| .cse5)))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse4 (select |c_#memory_$Pointer$#1.offset| .cse4))))) is different from true [2025-01-10 01:43:59,441 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse7) 4)) (.cse11 (+ (select (select |c_#memory_$Pointer$#1.offset| .cse7) 4) 4)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse6) 4))) (let ((.cse1 (= .cse2 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (.cse0 (+ |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 4)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse11))) (and (not (= |c_ULTIMATE.start_main_~uneq~0#1| 1)) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse0) 0) (or (and (not .cse1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0)) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) .cse1)) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse3 .cse4)) (or (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse5) 4) 0) (not (= .cse5 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)))) .cse1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) 4) 0) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse3) 1) (= |v_#valid_BEFORE_CALL_10| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_10|))) (store |v_old(#valid)_AFTER_CALL_23| .cse8 (select |v_#valid_BEFORE_CALL_10| .cse8)))) (= (select |v_old(#valid)_AFTER_CALL_23| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|) 0) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse0) 0) (exists ((v_arrayElimIndex_7 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2| Int) (v_arrayElimIndex_8 Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse9) 1) (not (= v_arrayElimIndex_7 v_arrayElimIndex_8)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_8) 1) (= (select |v_old(#valid)_AFTER_CALL_25| .cse9) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_7) 1) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_25| .cse10 (select |v_#valid_BEFORE_CALL_9| .cse10))) |v_#valid_BEFORE_CALL_9|)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse11) 0) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse6 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (or (= .cse4 .cse7) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0)) (= (select (select |c_#memory_$Pointer$#1.base| .cse4) 4) 0))))) is different from false [2025-01-10 01:43:59,445 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse7) 4)) (.cse11 (+ (select (select |c_#memory_$Pointer$#1.offset| .cse7) 4) 4)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse6) 4))) (let ((.cse1 (= .cse2 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (.cse0 (+ |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 4)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse11))) (and (not (= |c_ULTIMATE.start_main_~uneq~0#1| 1)) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse0) 0) (or (and (not .cse1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0)) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) .cse1)) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse3 .cse4)) (or (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse5) 4) 0) (not (= .cse5 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)))) .cse1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) 4) 0) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse3) 1) (= |v_#valid_BEFORE_CALL_10| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_10|))) (store |v_old(#valid)_AFTER_CALL_23| .cse8 (select |v_#valid_BEFORE_CALL_10| .cse8)))) (= (select |v_old(#valid)_AFTER_CALL_23| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|) 0) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse0) 0) (exists ((v_arrayElimIndex_7 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2| Int) (v_arrayElimIndex_8 Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse9) 1) (not (= v_arrayElimIndex_7 v_arrayElimIndex_8)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_8) 1) (= (select |v_old(#valid)_AFTER_CALL_25| .cse9) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_7) 1) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_25| .cse10 (select |v_#valid_BEFORE_CALL_9| .cse10))) |v_#valid_BEFORE_CALL_9|)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse11) 0) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse6 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (or (= .cse4 .cse7) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0)) (= (select (select |c_#memory_$Pointer$#1.base| .cse4) 4) 0))))) is different from true [2025-01-10 01:44:00,048 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse18 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse19 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse8 (+ .cse18 4))) (let ((.cse3 (select .cse19 .cse8))) (let ((.cse6 (select .cse19 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4)) (.cse9 (+ (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse9)) (.cse10 (select (select |c_#memory_$Pointer$#1.base| .cse6) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| .cse2)) (.cse5 (= .cse18 0))) (and (not (= |c_ULTIMATE.start_main_~uneq~0#1| 1)) (not (= .cse0 .cse1)) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse3) 0) (= |v_#valid_BEFORE_CALL_10| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_10|))) (store |v_old(#valid)_AFTER_CALL_23| .cse4 (select |v_#valid_BEFORE_CALL_10| .cse4)))) (= (select |v_#valid_BEFORE_CALL_10| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 1))) .cse5 (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) 4) 0) (= (select .cse7 .cse8) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse9) 0) (or (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse10 .cse2)) (let ((.cse11 (select (select |c_#memory_$Pointer$#1.base| .cse10) 4))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse11) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse11) 4) 0)))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 .cse3)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse10) 4) 0) (= (select .cse7 4) 0) (or (exists ((v_arrayElimIndex_7 Int) (v_arrayElimIndex_8 Int)) (and (not (= v_arrayElimIndex_7 v_arrayElimIndex_8)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_8) 1) (= (select |v_old(#valid)_AFTER_CALL_25| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_7) 1) (= (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_25| .cse12 (select |v_#valid_BEFORE_CALL_9| .cse12))) |v_#valid_BEFORE_CALL_9|))))) (and .cse5 (exists ((v_arrayElimIndex_7 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (v_arrayElimIndex_8 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_25| .cse6) 0) (not (= v_arrayElimIndex_7 v_arrayElimIndex_8)) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_8) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_7) 1) (= (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_25| .cse13 (select |v_#valid_BEFORE_CALL_9| .cse13))) |v_#valid_BEFORE_CALL_9|)))) (exists ((v_arrayElimIndex_7 Int) (v_arrayElimIndex_8 Int)) (and (not (= v_arrayElimIndex_7 v_arrayElimIndex_8)) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2| Int)) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|) 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (let ((.cse14 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse14) 1) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_8) 1) (= (select |v_old(#valid)_AFTER_CALL_25| .cse14) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_7) 1) (= (let ((.cse15 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_25| .cse15 (select |v_#valid_BEFORE_CALL_9| .cse15))) |v_#valid_BEFORE_CALL_9|)))) (not (= |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (exists ((v_arrayElimIndex_7 Int) (v_arrayElimIndex_8 Int)) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2| Int)) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|) 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (let ((.cse16 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse16) 1) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_8) 1) (= (select |v_old(#valid)_AFTER_CALL_25| .cse16) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_7) 1) (= (let ((.cse17 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_25| .cse17 (select |v_#valid_BEFORE_CALL_9| .cse17))) |v_#valid_BEFORE_CALL_9|)))) (not (= |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#s~0#1.base|)))) (not (= v_arrayElimIndex_7 v_arrayElimIndex_8))))))))))) is different from false [2025-01-10 01:44:00,053 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse18 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse19 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse8 (+ .cse18 4))) (let ((.cse3 (select .cse19 .cse8))) (let ((.cse6 (select .cse19 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4)) (.cse9 (+ (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse9)) (.cse10 (select (select |c_#memory_$Pointer$#1.base| .cse6) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| .cse2)) (.cse5 (= .cse18 0))) (and (not (= |c_ULTIMATE.start_main_~uneq~0#1| 1)) (not (= .cse0 .cse1)) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse3) 0) (= |v_#valid_BEFORE_CALL_10| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_10|))) (store |v_old(#valid)_AFTER_CALL_23| .cse4 (select |v_#valid_BEFORE_CALL_10| .cse4)))) (= (select |v_#valid_BEFORE_CALL_10| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 1))) .cse5 (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) 4) 0) (= (select .cse7 .cse8) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse9) 0) (or (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse10 .cse2)) (let ((.cse11 (select (select |c_#memory_$Pointer$#1.base| .cse10) 4))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse11) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse11) 4) 0)))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 .cse3)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse10) 4) 0) (= (select .cse7 4) 0) (or (exists ((v_arrayElimIndex_7 Int) (v_arrayElimIndex_8 Int)) (and (not (= v_arrayElimIndex_7 v_arrayElimIndex_8)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_8) 1) (= (select |v_old(#valid)_AFTER_CALL_25| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_7) 1) (= (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_25| .cse12 (select |v_#valid_BEFORE_CALL_9| .cse12))) |v_#valid_BEFORE_CALL_9|))))) (and .cse5 (exists ((v_arrayElimIndex_7 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (v_arrayElimIndex_8 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_25| .cse6) 0) (not (= v_arrayElimIndex_7 v_arrayElimIndex_8)) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_8) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_7) 1) (= (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_25| .cse13 (select |v_#valid_BEFORE_CALL_9| .cse13))) |v_#valid_BEFORE_CALL_9|)))) (exists ((v_arrayElimIndex_7 Int) (v_arrayElimIndex_8 Int)) (and (not (= v_arrayElimIndex_7 v_arrayElimIndex_8)) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2| Int)) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|) 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (let ((.cse14 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse14) 1) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_8) 1) (= (select |v_old(#valid)_AFTER_CALL_25| .cse14) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_7) 1) (= (let ((.cse15 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_25| .cse15 (select |v_#valid_BEFORE_CALL_9| .cse15))) |v_#valid_BEFORE_CALL_9|)))) (not (= |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (exists ((v_arrayElimIndex_7 Int) (v_arrayElimIndex_8 Int)) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2| Int)) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|) 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (let ((.cse16 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse16) 1) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_8) 1) (= (select |v_old(#valid)_AFTER_CALL_25| .cse16) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimIndex_7) 1) (= (let ((.cse17 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_25| .cse17 (select |v_#valid_BEFORE_CALL_9| .cse17))) |v_#valid_BEFORE_CALL_9|)))) (not (= |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#s~0#1.base|)))) (not (= v_arrayElimIndex_7 v_arrayElimIndex_8))))))))))) is different from true [2025-01-10 01:44:00,058 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (let ((.cse7 (select .cse10 .cse4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse7) 4)) (.cse9 (+ (select (select |c_#memory_$Pointer$#1.offset| .cse7) 4) 4)) (.cse8 (select .cse10 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse8) 4)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse9))) (and (not (= |c_ULTIMATE.start_main_~uneq~0#1| 1)) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= 0 (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4)) (not (= .cse1 .cse2)) (= (select .cse3 .cse4) 0) (or (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse5) 4) 0))) (and (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) |c_ULTIMATE.start_main_#t~mem11#1|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|))) (= (select .cse3 4) 0) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_23| .cse1)) (= |v_#valid_BEFORE_CALL_10| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_10|))) (store |v_old(#valid)_AFTER_CALL_23| .cse6 (select |v_#valid_BEFORE_CALL_10| .cse6)))) (= (select |v_#valid_BEFORE_CALL_10| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse7) 0))) (= 0 (select (select |c_#memory_$Pointer$#1.offset| .cse8) 4)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse9) 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= .cse1 .cse7)) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 4) 0)))))) is different from false [2025-01-10 01:44:00,060 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (let ((.cse7 (select .cse10 .cse4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse7) 4)) (.cse9 (+ (select (select |c_#memory_$Pointer$#1.offset| .cse7) 4) 4)) (.cse8 (select .cse10 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse8) 4)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse9))) (and (not (= |c_ULTIMATE.start_main_~uneq~0#1| 1)) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= 0 (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4)) (not (= .cse1 .cse2)) (= (select .cse3 .cse4) 0) (or (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse5) 4) 0))) (and (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) |c_ULTIMATE.start_main_#t~mem11#1|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|))) (= (select .cse3 4) 0) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_23| .cse1)) (= |v_#valid_BEFORE_CALL_10| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_10|))) (store |v_old(#valid)_AFTER_CALL_23| .cse6 (select |v_#valid_BEFORE_CALL_10| .cse6)))) (= (select |v_#valid_BEFORE_CALL_10| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse7) 0))) (= 0 (select (select |c_#memory_$Pointer$#1.offset| .cse8) 4)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse9) 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= .cse1 .cse7)) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 4) 0)))))) is different from true [2025-01-10 01:44:00,064 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse2 (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse1) 0))))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= 0 (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0))) .cse2) (or .cse2 (= 0 (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_39| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_39| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_39| 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse5))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4)) (.cse8 (+ (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse7) .cse8))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse3) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse3) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse5) 0) (= |v_#valid_BEFORE_CALL_10| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_10|))) (store |v_old(#valid)_AFTER_CALL_23| .cse6 (select |v_#valid_BEFORE_CALL_10| .cse6)))) (not (= .cse3 .cse7)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse7) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse7) .cse8) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse4)))))))))) is different from false [2025-01-10 01:44:00,066 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse2 (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse1) 0))))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= 0 (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0))) .cse2) (or .cse2 (= 0 (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_39| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_39| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_39| 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse5))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4)) (.cse8 (+ (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse7) .cse8))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse3) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse3) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse5) 0) (= |v_#valid_BEFORE_CALL_10| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_10|))) (store |v_old(#valid)_AFTER_CALL_23| .cse6 (select |v_#valid_BEFORE_CALL_10| .cse6)))) (not (= .cse3 .cse7)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse7) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse7) .cse8) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse4)))))))))) is different from true [2025-01-10 01:44:00,071 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~temp~2#1.base|) 0))))) (and (or (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~temp~2#1.base|) 4))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0))) .cse1) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~temp~2#1.base|) 4) 0) .cse1) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_39| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_39| Int)) (let ((.cse4 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_39| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse4))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4)) (.cse8 (+ .cse7 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse5) .cse8))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse2) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse2) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse4) 0) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse5) (not (= .cse3 0)) (= |v_#valid_BEFORE_CALL_10| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_10|))) (store |v_old(#valid)_AFTER_CALL_23| .cse6 (select |v_#valid_BEFORE_CALL_10| .cse6)))) (not (= .cse2 .cse5)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) 0) (= |c_ULTIMATE.start_main_~temp~2#1.offset| .cse7) (= (select |v_old(#valid)_AFTER_CALL_23| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse5) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) .cse8) 0)))))))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) is different from false [2025-01-10 01:44:00,073 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~temp~2#1.base|) 0))))) (and (or (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~temp~2#1.base|) 4))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0))) .cse1) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~temp~2#1.base|) 4) 0) .cse1) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_39| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_39| Int)) (let ((.cse4 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_39| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse4))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4)) (.cse8 (+ .cse7 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse5) .cse8))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse2) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse2) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse4) 0) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse5) (not (= .cse3 0)) (= |v_#valid_BEFORE_CALL_10| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_10|))) (store |v_old(#valid)_AFTER_CALL_23| .cse6 (select |v_#valid_BEFORE_CALL_10| .cse6)))) (not (= .cse2 .cse5)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) 0) (= |c_ULTIMATE.start_main_~temp~2#1.offset| .cse7) (= (select |v_old(#valid)_AFTER_CALL_23| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse5) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) .cse8) 0)))))))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) is different from true [2025-01-10 01:44:00,077 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) .cse0) (or (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 4) 0) (= 0 (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4)))) .cse0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_39| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_39| Int)) (let ((.cse4 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_39| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse4))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4)) (.cse8 (+ .cse7 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse6) .cse8))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse2) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse2) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse4) 0) (not (= .cse3 0)) (= |v_#valid_BEFORE_CALL_10| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_10|))) (store |v_old(#valid)_AFTER_CALL_23| .cse5 (select |v_#valid_BEFORE_CALL_10| .cse5)))) (not (= .cse2 .cse6)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) 0) (= .cse7 |c_ULTIMATE.start_main_~ptr~0#1.offset|) (= (select |v_old(#valid)_AFTER_CALL_23| .cse3) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse6) (= (select |v_old(#valid)_AFTER_CALL_23| .cse6) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) .cse8) 0)))))))))) is different from false [2025-01-10 01:44:00,079 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) .cse0) (or (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 4) 0) (= 0 (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4)))) .cse0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_39| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_39| Int)) (let ((.cse4 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_39| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse4))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4)) (.cse8 (+ .cse7 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse6) .cse8))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse2) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse2) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse4) 0) (not (= .cse3 0)) (= |v_#valid_BEFORE_CALL_10| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_10|))) (store |v_old(#valid)_AFTER_CALL_23| .cse5 (select |v_#valid_BEFORE_CALL_10| .cse5)))) (not (= .cse2 .cse6)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) 0) (= .cse7 |c_ULTIMATE.start_main_~ptr~0#1.offset|) (= (select |v_old(#valid)_AFTER_CALL_23| .cse3) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse6) (= (select |v_old(#valid)_AFTER_CALL_23| .cse6) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) .cse8) 0)))))))))) is different from true [2025-01-10 01:44:00,084 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_main_#t~mem14#1|))) (.cse1 (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) (and (or .cse0 .cse1) (or .cse0 (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~temp~2#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~temp~2#1.base|) 4) 0))) .cse1 (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_39| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_39| Int)) (let ((.cse4 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_39| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse4))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4)) (.cse7 (+ (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse6) .cse7))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse2) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse2) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse4) 0) (= .cse2 |c_ULTIMATE.start_main_~temp~2#1.base|) (not (= .cse3 0)) (= |v_#valid_BEFORE_CALL_10| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_10|))) (store |v_old(#valid)_AFTER_CALL_23| .cse5 (select |v_#valid_BEFORE_CALL_10| .cse5)))) (not (= .cse2 .cse6)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse6) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) .cse7) 0))))))))) is different from false [2025-01-10 01:44:00,087 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_main_#t~mem14#1|))) (.cse1 (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) (and (or .cse0 .cse1) (or .cse0 (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~temp~2#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~temp~2#1.base|) 4) 0))) .cse1 (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_39| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_39| Int)) (let ((.cse4 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_39| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse4))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4)) (.cse7 (+ (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse6) .cse7))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse2) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse2) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse4) 0) (= .cse2 |c_ULTIMATE.start_main_~temp~2#1.base|) (not (= .cse3 0)) (= |v_#valid_BEFORE_CALL_10| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_10|))) (store |v_old(#valid)_AFTER_CALL_23| .cse5 (select |v_#valid_BEFORE_CALL_10| .cse5)))) (not (= .cse2 .cse6)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse6) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) .cse7) 0))))))))) is different from true [2025-01-10 01:44:00,090 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_39| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_39| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_39| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse2))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (.cse5 (+ (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse5))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse2) 0) (not (= .cse1 0)) (= |v_#valid_BEFORE_CALL_10| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_10|))) (store |v_old(#valid)_AFTER_CALL_23| .cse3 (select |v_#valid_BEFORE_CALL_10| .cse3)))) (not (= .cse0 .cse4)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse4) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) .cse5) 0))))))) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0)) is different from false [2025-01-10 01:44:00,092 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_39| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_39| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_39| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse2))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (.cse5 (+ (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse5))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse2) 0) (not (= .cse1 0)) (= |v_#valid_BEFORE_CALL_10| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_10|))) (store |v_old(#valid)_AFTER_CALL_23| .cse3 (select |v_#valid_BEFORE_CALL_10| .cse3)))) (not (= .cse0 .cse4)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse4) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) .cse5) 0))))))) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0)) is different from true [2025-01-10 01:44:00,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:44:00,218 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2025-01-10 01:44:00,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-10 01:44:00,218 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 1.7551020408163265) internal successors, (86), 41 states have internal predecessors, (86), 8 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 87 [2025-01-10 01:44:00,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:44:00,219 INFO L225 Difference]: With dead ends: 133 [2025-01-10 01:44:00,219 INFO L226 Difference]: Without dead ends: 78 [2025-01-10 01:44:00,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 29 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=171, Invalid=1957, Unknown=58, NotChecked=3364, Total=5550 [2025-01-10 01:44:00,221 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 2257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1770 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 01:44:00,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 466 Invalid, 2257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 482 Invalid, 0 Unknown, 1770 Unchecked, 0.4s Time] [2025-01-10 01:44:00,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-10 01:44:00,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-01-10 01:44:00,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 71 states have (on average 1.028169014084507) internal successors, (73), 71 states have internal predecessors, (73), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 01:44:00,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2025-01-10 01:44:00,228 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 87 [2025-01-10 01:44:00,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:44:00,228 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2025-01-10 01:44:00,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 1.7551020408163265) internal successors, (86), 41 states have internal predecessors, (86), 8 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 01:44:00,228 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2025-01-10 01:44:00,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-10 01:44:00,229 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:44:00,229 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:44:00,239 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-01-10 01:44:00,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:44:00,434 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:44:00,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:44:00,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1467791300, now seen corresponding path program 5 times [2025-01-10 01:44:00,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:44:00,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118506503] [2025-01-10 01:44:00,435 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:44:00,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:44:00,453 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 97 statements into 11 equivalence classes. [2025-01-10 01:44:00,476 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 97 of 97 statements. [2025-01-10 01:44:00,476 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-01-10 01:44:00,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:00,636 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 23 proven. 11 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2025-01-10 01:44:00,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:44:00,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118506503] [2025-01-10 01:44:00,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118506503] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:44:00,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961052351] [2025-01-10 01:44:00,636 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:44:00,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:44:00,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:44:00,639 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-01-10 01:44:00,641 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-01-10 01:44:00,791 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 97 statements into 11 equivalence classes. [2025-01-10 01:44:01,181 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 97 of 97 statements. [2025-01-10 01:44:01,181 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-01-10 01:44:01,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:01,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:44:01,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:44:01,226 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2025-01-10 01:44:01,226 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:44:01,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961052351] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:44:01,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:44:01,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 11 [2025-01-10 01:44:01,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504635951] [2025-01-10 01:44:01,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:44:01,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:44:01,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:44:01,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:44:01,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:44:01,228 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-10 01:44:01,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:44:01,270 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2025-01-10 01:44:01,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:44:01,271 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 97 [2025-01-10 01:44:01,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:44:01,271 INFO L225 Difference]: With dead ends: 83 [2025-01-10 01:44:01,271 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 01:44:01,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:44:01,272 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:44:01,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:44:01,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 01:44:01,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 01:44:01,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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-01-10 01:44:01,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 01:44:01,273 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 97 [2025-01-10 01:44:01,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:44:01,274 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 01:44:01,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-10 01:44:01,274 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 01:44:01,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 01:44:01,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-01-10 01:44:01,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-01-10 01:44:01,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-01-10 01:44:01,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-01-10 01:44:01,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-01-10 01:44:01,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-01-10 01:44:01,286 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-01-10 01:44:01,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-10 01:44:01,480 INFO L422 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:44:01,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.