./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/list-simple/dll2c_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/list-simple/dll2c_append_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:12:21,786 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:12:21,841 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-30 10:12:21,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:12:21,844 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:12:21,865 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:12:21,865 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:12:21,865 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:12:21,866 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:12:21,866 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:12:21,867 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:12:21,867 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:12:21,867 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:12:21,867 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:12:21,867 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:12:21,868 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:12:21,868 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:12:21,868 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:12:21,868 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:12:21,868 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:12:21,868 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:12:21,868 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:12:21,868 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:12:21,868 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:12:21,869 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:12:21,869 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:12:21,869 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:12:21,869 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:12:21,869 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:12:21,869 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:12:21,869 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:12:21,869 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:12:21,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:12:21,870 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:12:21,870 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:12:21,870 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:12:21,870 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:12:21,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:12:21,870 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:12:21,870 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:12:21,870 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:12:21,870 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:12:21,870 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:12:21,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:12:21,870 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:12:21,870 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:12:21,871 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:12:21,871 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 [2025-04-30 10:12:22,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:12:22,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:12:22,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:12:22,246 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:12:22,246 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:12:22,247 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_append_unequal.i [2025-04-30 10:12:23,590 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/539ac20c3/1c418875fc9947eb9c3795c5ca78994f/FLAG76729a484 [2025-04-30 10:12:23,824 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:12:23,825 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_append_unequal.i [2025-04-30 10:12:23,835 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/539ac20c3/1c418875fc9947eb9c3795c5ca78994f/FLAG76729a484 [2025-04-30 10:12:24,641 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/539ac20c3/1c418875fc9947eb9c3795c5ca78994f [2025-04-30 10:12:24,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:12:24,644 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:12:24,645 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:12:24,645 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:12:24,648 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:12:24,648 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:12:24" (1/1) ... [2025-04-30 10:12:24,649 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2368be43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:12:24, skipping insertion in model container [2025-04-30 10:12:24,649 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:12:24" (1/1) ... [2025-04-30 10:12:24,681 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:12:24,919 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_append_unequal.i[24672,24685] [2025-04-30 10:12:24,922 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:12:24,931 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:12:24,974 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_append_unequal.i[24672,24685] [2025-04-30 10:12:24,978 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:12:24,996 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:12:24,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:12:24 WrapperNode [2025-04-30 10:12:24,997 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:12:24,998 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:12:24,998 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:12:24,998 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:12:25,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:12:24" (1/1) ... [2025-04-30 10:12:25,012 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:12:24" (1/1) ... [2025-04-30 10:12:25,032 INFO L138 Inliner]: procedures = 127, calls = 49, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 142 [2025-04-30 10:12:25,032 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:12:25,033 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:12:25,033 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:12:25,033 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:12:25,042 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:12:24" (1/1) ... [2025-04-30 10:12:25,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:12:24" (1/1) ... [2025-04-30 10:12:25,045 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:12:24" (1/1) ... [2025-04-30 10:12:25,061 INFO L175 MemorySlicer]: Split 31 memory accesses to 3 slices as follows [2, 9, 20]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 14 writes are split as follows [0, 1, 13]. [2025-04-30 10:12:25,061 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:12:24" (1/1) ... [2025-04-30 10:12:25,061 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:12:24" (1/1) ... [2025-04-30 10:12:25,067 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:12:24" (1/1) ... [2025-04-30 10:12:25,067 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:12:24" (1/1) ... [2025-04-30 10:12:25,069 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:12:24" (1/1) ... [2025-04-30 10:12:25,071 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:12:24" (1/1) ... [2025-04-30 10:12:25,071 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:12:24" (1/1) ... [2025-04-30 10:12:25,074 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:12:25,075 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:12:25,075 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:12:25,075 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:12:25,076 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:12:24" (1/1) ... [2025-04-30 10:12:25,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:12:25,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:12:25,101 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-30 10:12:25,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-30 10:12:25,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:12:25,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-30 10:12:25,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-30 10:12:25,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:12:25,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:12:25,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-30 10:12:25,121 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-04-30 10:12:25,121 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-04-30 10:12:25,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:12:25,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:12:25,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-30 10:12:25,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:12:25,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-30 10:12:25,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-30 10:12:25,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:12:25,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:12:25,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-30 10:12:25,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:12:25,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-30 10:12:25,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-30 10:12:25,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-30 10:12:25,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:12:25,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:12:25,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-30 10:12:25,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:12:25,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:12:25,230 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:12:25,232 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:12:25,438 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2025-04-30 10:12:25,438 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:12:25,447 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:12:25,447 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-30 10:12:25,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:12:25 BoogieIcfgContainer [2025-04-30 10:12:25,448 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:12:25,449 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:12:25,450 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:12:25,453 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:12:25,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:12:24" (1/3) ... [2025-04-30 10:12:25,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@356a557c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:12:25, skipping insertion in model container [2025-04-30 10:12:25,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:12:24" (2/3) ... [2025-04-30 10:12:25,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@356a557c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:12:25, skipping insertion in model container [2025-04-30 10:12:25,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:12:25" (3/3) ... [2025-04-30 10:12:25,456 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2c_append_unequal.i [2025-04-30 10:12:25,467 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:12:25,468 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_append_unequal.i that has 2 procedures, 34 locations, 49 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-30 10:12:25,512 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:12:25,523 INFO L340 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;@6c292e36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:12:25,523 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-30 10:12:25,527 INFO L278 IsEmpty]: Start isEmpty. Operand has 34 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 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-04-30 10:12:25,532 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-30 10:12:25,532 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:12:25,533 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:12:25,533 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:12:25,537 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:12:25,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1926346031, now seen corresponding path program 1 times [2025-04-30 10:12:25,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:12:25,543 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747254716] [2025-04-30 10:12:25,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:12:25,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:12:25,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-30 10:12:25,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-30 10:12:25,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:12:25,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:12:25,874 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:12:25,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:12:25,876 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747254716] [2025-04-30 10:12:25,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747254716] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:12:25,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:12:25,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:12:25,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644708538] [2025-04-30 10:12:25,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:12:25,881 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:12:25,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:12:25,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:12:25,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:12:25,895 INFO L87 Difference]: Start difference. First operand has 34 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 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) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-04-30 10:12:25,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:12:25,921 INFO L93 Difference]: Finished difference Result 64 states and 87 transitions. [2025-04-30 10:12:25,922 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:12:25,924 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 23 [2025-04-30 10:12:25,924 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:12:25,928 INFO L225 Difference]: With dead ends: 64 [2025-04-30 10:12:25,929 INFO L226 Difference]: Without dead ends: 32 [2025-04-30 10:12:25,931 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:12:25,935 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 4 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:12:25,936 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 79 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:12:25,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-04-30 10:12:25,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2025-04-30 10:12:25,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 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-04-30 10:12:25,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2025-04-30 10:12:25,963 INFO L79 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 23 [2025-04-30 10:12:25,963 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:12:25,963 INFO L485 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2025-04-30 10:12:25,964 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-04-30 10:12:25,964 INFO L278 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2025-04-30 10:12:25,965 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-30 10:12:25,965 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:12:25,965 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:12:25,965 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:12:25,966 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:12:25,966 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:12:25,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1822042565, now seen corresponding path program 1 times [2025-04-30 10:12:25,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:12:25,966 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116924103] [2025-04-30 10:12:25,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:12:25,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:12:25,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-30 10:12:26,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:12:26,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:12:26,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:12:26,389 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:12:26,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:12:26,389 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116924103] [2025-04-30 10:12:26,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116924103] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:12:26,389 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301681682] [2025-04-30 10:12:26,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:12:26,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:12:26,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:12:26,393 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:12:26,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-30 10:12:26,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-30 10:12:26,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:12:26,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:12:26,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:12:26,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-30 10:12:26,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:12:26,679 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-04-30 10:12:26,693 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:12:26,694 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:12:26,752 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:12:26,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301681682] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:12:26,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:12:26,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 13 [2025-04-30 10:12:26,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539308172] [2025-04-30 10:12:26,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:12:26,767 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-30 10:12:26,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:12:26,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-30 10:12:26,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:12:26,769 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-04-30 10:12:30,796 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-30 10:12:34,820 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-30 10:12:38,832 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-30 10:12:42,857 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-30 10:12:47,029 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-30 10:12:51,048 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-30 10:12:51,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:12:51,053 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2025-04-30 10:12:51,058 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-30 10:12:51,058 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 33 [2025-04-30 10:12:51,058 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:12:51,059 INFO L225 Difference]: With dead ends: 59 [2025-04-30 10:12:51,059 INFO L226 Difference]: Without dead ends: 36 [2025-04-30 10:12:51,059 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:12:51,060 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 1 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:12:51,060 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 242 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 151 Invalid, 6 Unknown, 0 Unchecked, 24.2s Time] [2025-04-30 10:12:51,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-04-30 10:12:51,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-04-30 10:12:51,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-30 10:12:51,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2025-04-30 10:12:51,069 INFO L79 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 33 [2025-04-30 10:12:51,069 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:12:51,069 INFO L485 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2025-04-30 10:12:51,069 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-04-30 10:12:51,069 INFO L278 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2025-04-30 10:12:51,070 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-30 10:12:51,070 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:12:51,070 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:12:51,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-30 10:12:51,270 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:12:51,271 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:12:51,271 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:12:51,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1820195523, now seen corresponding path program 1 times [2025-04-30 10:12:51,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:12:51,271 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747155531] [2025-04-30 10:12:51,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:12:51,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:12:51,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-30 10:12:51,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:12:51,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:12:51,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:12:53,411 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:12:53,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:12:53,412 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747155531] [2025-04-30 10:12:53,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747155531] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:12:53,412 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25488573] [2025-04-30 10:12:53,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:12:53,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:12:53,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:12:53,414 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:12:53,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-30 10:12:53,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-30 10:12:53,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:12:53,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:12:53,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:12:53,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 114 conjuncts are in the unsatisfiable core [2025-04-30 10:12:53,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:12:53,948 INFO L354 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-04-30 10:12:54,170 INFO L354 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-04-30 10:12:54,240 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-30 10:12:54,240 INFO L354 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-04-30 10:12:54,305 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-30 10:12:54,374 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-30 10:12:54,496 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2025-04-30 10:12:54,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:12:54,508 INFO L354 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 30 treesize of output 27 [2025-04-30 10:12:54,513 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2025-04-30 10:12:54,526 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-30 10:12:54,701 INFO L354 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 104 treesize of output 56 [2025-04-30 10:12:54,705 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2025-04-30 10:12:54,712 INFO L354 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 11 treesize of output 3 [2025-04-30 10:12:54,887 INFO L325 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-04-30 10:12:54,888 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2025-04-30 10:12:54,903 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:12:54,904 INFO L354 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 112 treesize of output 65 [2025-04-30 10:12:54,918 INFO L325 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-04-30 10:12:54,918 INFO L354 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-04-30 10:12:54,927 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2025-04-30 10:12:55,090 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 52 [2025-04-30 10:12:55,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:12:55,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:12:55,095 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2025-04-30 10:12:55,098 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2025-04-30 10:12:55,150 INFO L354 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 19 treesize of output 11 [2025-04-30 10:12:55,221 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:12:55,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:12:55,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25488573] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:12:55,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:12:55,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 44 [2025-04-30 10:12:55,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142547727] [2025-04-30 10:12:55,826 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:12:55,826 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-04-30 10:12:55,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:12:55,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-04-30 10:12:55,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=2161, Unknown=34, NotChecked=0, Total=2352 [2025-04-30 10:12:55,828 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 44 states, 40 states have (on average 1.25) internal successors, (50), 35 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:12:57,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:12:57,433 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2025-04-30 10:12:57,433 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-30 10:12:57,433 INFO L79 Accepts]: Start accepts. Automaton has has 44 states, 40 states have (on average 1.25) internal successors, (50), 35 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 33 [2025-04-30 10:12:57,434 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:12:57,435 INFO L225 Difference]: With dead ends: 62 [2025-04-30 10:12:57,435 INFO L226 Difference]: Without dead ends: 60 [2025-04-30 10:12:57,437 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=263, Invalid=3484, Unknown=35, NotChecked=0, Total=3782 [2025-04-30 10:12:57,437 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 32 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:12:57,437 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 411 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 913 Invalid, 1 Unknown, 0 Unchecked, 1.1s Time] [2025-04-30 10:12:57,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-04-30 10:12:57,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 50. [2025-04-30 10:12:57,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-04-30 10:12:57,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2025-04-30 10:12:57,445 INFO L79 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 33 [2025-04-30 10:12:57,445 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:12:57,445 INFO L485 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2025-04-30 10:12:57,446 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 40 states have (on average 1.25) internal successors, (50), 35 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:12:57,446 INFO L278 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2025-04-30 10:12:57,446 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-30 10:12:57,446 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:12:57,446 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:12:57,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-30 10:12:57,647 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-04-30 10:12:57,647 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:12:57,648 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:12:57,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1481786068, now seen corresponding path program 1 times [2025-04-30 10:12:57,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:12:57,648 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819785142] [2025-04-30 10:12:57,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:12:57,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:12:57,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:12:57,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:12:57,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:12:57,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:00,237 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:13:00,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:13:00,238 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819785142] [2025-04-30 10:13:00,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819785142] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:13:00,238 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729399201] [2025-04-30 10:13:00,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:13:00,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:13:00,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:13:00,246 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:13:00,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-30 10:13:00,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:13:00,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:13:00,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:13:00,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:00,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 160 conjuncts are in the unsatisfiable core [2025-04-30 10:13:00,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:13:00,685 INFO L354 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-04-30 10:13:00,698 INFO L354 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-04-30 10:13:00,938 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-30 10:13:00,938 INFO L354 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-04-30 10:13:00,964 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-30 10:13:00,964 INFO L354 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-04-30 10:13:01,056 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:13:01,062 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:13:01,080 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-30 10:13:01,194 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-30 10:13:01,194 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 80 [2025-04-30 10:13:01,204 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2025-04-30 10:13:01,210 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-04-30 10:13:01,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:13:01,354 INFO L325 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2025-04-30 10:13:01,354 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 99 [2025-04-30 10:13:01,364 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:13:01,365 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2025-04-30 10:13:01,372 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 11 [2025-04-30 10:13:01,378 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-04-30 10:13:01,518 INFO L354 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 64 treesize of output 24 [2025-04-30 10:13:01,522 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-04-30 10:13:01,527 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2025-04-30 10:13:01,532 INFO L354 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-04-30 10:13:01,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:13:01,734 INFO L354 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 72 treesize of output 43 [2025-04-30 10:13:01,752 INFO L325 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2025-04-30 10:13:01,752 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 31 [2025-04-30 10:13:01,771 INFO L325 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-04-30 10:13:01,771 INFO L354 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-04-30 10:13:01,783 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2025-04-30 10:13:01,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:13:02,009 INFO L325 Elim1Store]: treesize reduction 108, result has 7.7 percent of original size [2025-04-30 10:13:02,009 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 583 treesize of output 367 [2025-04-30 10:13:02,024 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 249 treesize of output 120 [2025-04-30 10:13:02,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:13:02,044 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 53 [2025-04-30 10:13:02,052 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 162 [2025-04-30 10:13:02,059 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2025-04-30 10:13:02,420 INFO L354 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 221 treesize of output 153 [2025-04-30 10:13:02,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:13:02,428 INFO L325 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2025-04-30 10:13:02,428 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 298 treesize of output 205 [2025-04-30 10:13:02,435 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 19 [2025-04-30 10:13:02,441 INFO L354 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 23 treesize of output 15 [2025-04-30 10:13:02,519 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:13:02,520 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:13:02,611 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_689 (Array Int Int)) (v_ArrVal_686 Int) (v_ArrVal_688 (Array Int Int)) (v_ArrVal_693 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse10 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse5 (+ .cse10 4))) (let ((.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse2) .cse5)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| .cse2) .cse5)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int#2| .cse0 (store (select |c_#memory_int#2| .cse0) .cse1 v_ArrVal_686)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_689) .cse2 v_ArrVal_688) (select (select (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_695))) (store (store .cse3 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_693) .cse2 (store (select (store .cse3 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (select .cse3 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse4 .cse0) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| .cse2)) .cse2) .cse5 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) .cse6) .cse7)) (+ (select (select (let ((.cse8 (let ((.cse9 (store |c_#memory_$Pointer$#2.offset| .cse0 (store (select |c_#memory_$Pointer$#2.offset| .cse0) .cse1 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)))) (store .cse9 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (select .cse9 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse4 .cse1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| .cse10))))) (store .cse8 .cse2 (store (select .cse8 .cse2) .cse5 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) .cse6) .cse7) 8))))))) is different from false [2025-04-30 10:13:02,628 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_689 (Array Int Int)) (v_ArrVal_686 Int) (v_ArrVal_688 (Array Int Int)) (v_ArrVal_693 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse10 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse5 (+ .cse10 4))) (let ((.cse4 (+ 4 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse2) .cse5)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| .cse2) .cse5)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int#2| .cse0 (store (select |c_#memory_int#2| .cse0) .cse1 v_ArrVal_686)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_689) .cse2 v_ArrVal_688) (select (select (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_695))) (store (store .cse3 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_693) .cse2 (store (select (store .cse3 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (store (store (select .cse3 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) .cse4 .cse0) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset| .cse2)) .cse2) .cse5 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|))) .cse6) .cse7)) (+ (select (select (let ((.cse8 (let ((.cse9 (store |c_#memory_$Pointer$#2.offset| .cse0 (store (select |c_#memory_$Pointer$#2.offset| .cse0) .cse1 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|)))) (store .cse9 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (store (store (select .cse9 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) .cse4 .cse1) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset| .cse10))))) (store .cse8 .cse2 (store (select .cse8 .cse2) .cse5 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|))) .cse6) .cse7) 8))))))) is different from false [2025-04-30 10:13:02,698 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_689 (Array Int Int)) (v_ArrVal_686 Int) (v_ArrVal_688 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_18| Int) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_693 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_18|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse11 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse10 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_18| v_ArrVal_704)) (.cse4 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_18| v_ArrVal_705)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse5 (+ .cse11 4))) (let ((.cse0 (select (select .cse4 .cse2) .cse5)) (.cse1 (select (select .cse10 .cse2) .cse5)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int#2| .cse0 (store (select (store |c_#memory_int#2| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_18| v_ArrVal_706) .cse0) .cse1 v_ArrVal_686)) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_18| v_ArrVal_689) .cse2 v_ArrVal_688) (select (select (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_695))) (store (store .cse3 |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_18| v_ArrVal_693) .cse2 (store (select (store .cse3 |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_18| (store (store (select (store .cse4 .cse0 v_ArrVal_695) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_18|) 4 .cse0) 0 .cse2)) .cse2) .cse5 |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_18|))) .cse6) .cse7)) (+ (select (select (let ((.cse8 (let ((.cse9 (store (select .cse10 .cse0) .cse1 0))) (store (store |c_#memory_$Pointer$#2.offset| .cse0 .cse9) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_18| (store (store (select (store .cse10 .cse0 .cse9) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_18|) 4 .cse1) 0 .cse11))))) (store .cse8 .cse2 (store (select .cse8 .cse2) .cse5 0))) .cse6) .cse7) 8)))))))) is different from false [2025-04-30 10:13:02,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729399201] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:13:02,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:13:02,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 44 [2025-04-30 10:13:02,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097752817] [2025-04-30 10:13:02,701 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:13:02,701 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-04-30 10:13:02,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:13:02,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-04-30 10:13:02,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1936, Unknown=4, NotChecked=270, Total=2352 [2025-04-30 10:13:02,703 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 44 states, 40 states have (on average 1.3) internal successors, (52), 35 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:13:04,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:13:04,167 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2025-04-30 10:13:04,167 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-30 10:13:04,168 INFO L79 Accepts]: Start accepts. Automaton has has 44 states, 40 states have (on average 1.3) internal successors, (52), 35 states have internal predecessors, (52), 6 states have call successors, (6), 4 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 36 [2025-04-30 10:13:04,168 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:13:04,168 INFO L225 Difference]: With dead ends: 66 [2025-04-30 10:13:04,168 INFO L226 Difference]: Without dead ends: 64 [2025-04-30 10:13:04,170 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=250, Invalid=3418, Unknown=4, NotChecked=360, Total=4032 [2025-04-30 10:13:04,170 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 36 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 14 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-30 10:13:04,170 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 297 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 967 Invalid, 2 Unknown, 0 Unchecked, 0.9s Time] [2025-04-30 10:13:04,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-04-30 10:13:04,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2025-04-30 10:13:04,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-04-30 10:13:04,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2025-04-30 10:13:04,179 INFO L79 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 36 [2025-04-30 10:13:04,179 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:13:04,179 INFO L485 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2025-04-30 10:13:04,179 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 40 states have (on average 1.3) internal successors, (52), 35 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:13:04,179 INFO L278 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2025-04-30 10:13:04,180 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-30 10:13:04,180 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:13:04,180 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:13:04,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-30 10:13:04,381 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:13:04,381 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:13:04,382 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:13:04,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1481711606, now seen corresponding path program 1 times [2025-04-30 10:13:04,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:13:04,382 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526027792] [2025-04-30 10:13:04,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:13:04,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:13:04,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:13:04,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:13:04,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:13:04,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:05,792 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:13:05,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:13:05,793 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526027792] [2025-04-30 10:13:05,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526027792] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:13:05,793 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647692972] [2025-04-30 10:13:05,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:13:05,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:13:05,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:13:05,795 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:13:05,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-30 10:13:05,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:13:06,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:13:06,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:13:06,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:06,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 101 conjuncts are in the unsatisfiable core [2025-04-30 10:13:06,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:13:06,331 INFO L354 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-04-30 10:13:06,422 WARN L849 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)) is different from false [2025-04-30 10:13:06,423 WARN L871 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)) is different from true [2025-04-30 10:13:06,430 INFO L354 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-04-30 10:13:06,440 WARN L849 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from false [2025-04-30 10:13:06,445 WARN L871 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from true [2025-04-30 10:13:06,456 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-30 10:13:06,456 INFO L354 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-04-30 10:13:06,459 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-30 10:13:06,474 WARN L849 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)))) is different from false [2025-04-30 10:13:06,475 WARN L871 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)))) is different from true [2025-04-30 10:13:06,491 WARN L849 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from false [2025-04-30 10:13:06,492 WARN L871 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from true [2025-04-30 10:13:06,513 INFO L325 Elim1Store]: treesize reduction 57, result has 25.0 percent of original size [2025-04-30 10:13:06,514 INFO L354 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 2 case distinctions, treesize of input 83 treesize of output 35 [2025-04-30 10:13:06,536 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse1 4))) (and (or (= .cse0 (select .cse1 0)) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0)))))) is different from false [2025-04-30 10:13:06,537 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse1 4))) (and (or (= .cse0 (select .cse1 0)) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0)))))) is different from true [2025-04-30 10:13:06,556 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse1 (select .cse2 4))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse1 (select .cse2 0)) (= .cse1 .cse0)) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |c_#valid| .cse3)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2025-04-30 10:13:06,557 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse1 (select .cse2 4))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse1 (select .cse2 0)) (= .cse1 .cse0)) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |c_#valid| .cse3)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2025-04-30 10:13:06,565 INFO L354 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 49 treesize of output 17 [2025-04-30 10:13:06,582 WARN L849 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_68 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_68) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0)))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2025-04-30 10:13:06,584 WARN L871 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_68 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_68) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0)))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2025-04-30 10:13:06,599 WARN L849 $PredicateComparison]: unable to prove that (and (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_68 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_68) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0)))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2025-04-30 10:13:06,600 WARN L871 $PredicateComparison]: unable to prove that (and (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_68 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_68) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0)))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2025-04-30 10:13:06,634 WARN L849 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_68 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_68) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0))))) is different from false [2025-04-30 10:13:06,636 WARN L871 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_68 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_68) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0))))) is different from true [2025-04-30 10:13:06,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:13:06,685 INFO L354 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 57 treesize of output 34 [2025-04-30 10:13:06,708 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse2))) (let ((.cse0 (select .cse1 4))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse0 (select .cse1 0)) (= .cse0 .cse2)) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3))) |v_old(#valid)_AFTER_CALL_12|))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_68 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse5 (select |v_#valid_BEFORE_CALL_11| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_68) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 0)))) (= 0 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2025-04-30 10:13:06,710 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse2))) (let ((.cse0 (select .cse1 4))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse0 (select .cse1 0)) (= .cse0 .cse2)) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3))) |v_old(#valid)_AFTER_CALL_12|))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_68 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse5 (select |v_#valid_BEFORE_CALL_11| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_68) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 0)))) (= 0 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2025-04-30 10:13:06,752 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse2))) (let ((.cse0 (select .cse1 4))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse0 (select .cse1 0)) (= .cse0 .cse2)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_68 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse3) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse4 (select |v_#valid_BEFORE_CALL_11| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_68) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse3) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse5 (select |v_old(#valid)_AFTER_CALL_12| .cse5))) |v_old(#valid)_AFTER_CALL_12|))))))) is different from false [2025-04-30 10:13:06,754 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse2))) (let ((.cse0 (select .cse1 4))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse0 (select .cse1 0)) (= .cse0 .cse2)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_68 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse3) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse4 (select |v_#valid_BEFORE_CALL_11| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_68) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse3) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse5 (select |v_old(#valid)_AFTER_CALL_12| .cse5))) |v_old(#valid)_AFTER_CALL_12|))))))) is different from true [2025-04-30 10:13:06,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:13:06,794 INFO L325 Elim1Store]: treesize reduction 108, result has 7.7 percent of original size [2025-04-30 10:13:06,795 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 343 treesize of output 187 [2025-04-30 10:13:06,802 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 111 [2025-04-30 10:13:06,817 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 51 [2025-04-30 10:13:06,831 INFO L325 Elim1Store]: treesize reduction 79, result has 1.3 percent of original size [2025-04-30 10:13:06,831 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 193 treesize of output 125 [2025-04-30 10:13:06,838 WARN L195 Elim1Store]: Array PQE input equivalent to false [2025-04-30 10:13:06,842 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 103 [2025-04-30 10:13:06,846 WARN L195 Elim1Store]: Array PQE input equivalent to false [2025-04-30 10:13:06,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:13:06,851 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 146 [2025-04-30 10:13:06,861 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 33 [2025-04-30 10:13:06,873 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse2 (select .cse6 4)) (.cse1 (select .cse6 0))) (and (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3))) |v_old(#valid)_AFTER_CALL_12|))) (not (= .cse2 .cse0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 .cse1)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_68 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse5 (select |v_#valid_BEFORE_CALL_11| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_68) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 0)))) (not (= .cse2 .cse1)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2025-04-30 10:13:06,876 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse2 (select .cse6 4)) (.cse1 (select .cse6 0))) (and (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3))) |v_old(#valid)_AFTER_CALL_12|))) (not (= .cse2 .cse0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 .cse1)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_68 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse5 (select |v_#valid_BEFORE_CALL_11| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_68) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 0)))) (not (= .cse2 .cse1)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2025-04-30 10:13:06,924 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse2 (select .cse6 4)) (.cse1 (select .cse6 0))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3))) |v_old(#valid)_AFTER_CALL_12|))) (not (= .cse2 .cse0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 .cse1)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_68 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse5 (select |v_#valid_BEFORE_CALL_11| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_68) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 0)))) (not (= .cse2 .cse1)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2025-04-30 10:13:06,926 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse2 (select .cse6 4)) (.cse1 (select .cse6 0))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3))) |v_old(#valid)_AFTER_CALL_12|))) (not (= .cse2 .cse0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 .cse1)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_68 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse5 (select |v_#valid_BEFORE_CALL_11| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_68) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 0)))) (not (= .cse2 .cse1)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2025-04-30 10:13:06,982 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:06,983 INFO L354 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 137 treesize of output 89 [2025-04-30 10:13:06,990 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-30 10:13:06,991 INFO L354 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 15 treesize of output 7 [2025-04-30 10:13:06,995 INFO L354 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 61 treesize of output 29 [2025-04-30 10:13:07,015 WARN L849 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (v_arrayElimCell_80 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_13| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimCell_80) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_12| v_arrayElimCell_80) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_#t~mem21#1.base|) 0))) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base|))) is different from false [2025-04-30 10:13:07,016 WARN L871 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (v_arrayElimCell_80 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_13| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimCell_80) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_12| v_arrayElimCell_80) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_#t~mem21#1.base|) 0))) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base|))) is different from true [2025-04-30 10:13:07,017 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2025-04-30 10:13:07,017 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:13:07,068 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_910 (Array Int Int)) (v_ArrVal_909 (Array Int Int))) (not (let ((.cse0 (select (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse5 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse3) .cse5))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| .cse4 v_ArrVal_910))) (store (store .cse2 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_909) .cse3 (store (select (store .cse2 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (select .cse2 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4) .cse4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| .cse3)) .cse3) .cse5 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))))) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse0 (+ .cse1 4)) (select .cse0 .cse1))))) is different from false [2025-04-30 10:13:07,077 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_910 (Array Int Int)) (v_ArrVal_909 (Array Int Int))) (not (let ((.cse0 (select (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse5 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse3) .cse5))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| .cse4 v_ArrVal_910))) (store (store .cse2 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_909) .cse3 (store (select (store .cse2 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (store (store (select .cse2 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|) .cse4) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset| .cse3)) .cse3) .cse5 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|))))) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse0 .cse1) (select .cse0 (+ .cse1 4)))))) is different from false [2025-04-30 10:13:07,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647692972] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:13:07,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:13:07,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 40 [2025-04-30 10:13:07,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285783200] [2025-04-30 10:13:07,177 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:13:07,177 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-30 10:13:07,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:13:07,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-30 10:13:07,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=747, Unknown=30, NotChecked=1104, Total=1980 [2025-04-30 10:13:07,178 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 40 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 31 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:13:07,334 WARN L849 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) is different from false [2025-04-30 10:13:07,336 WARN L871 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) is different from true [2025-04-30 10:13:07,338 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2025-04-30 10:13:07,339 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from true [2025-04-30 10:13:07,341 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (or .cse0 .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) .cse1 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not .cse0))) is different from false [2025-04-30 10:13:07,343 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (or .cse0 .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) .cse1 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not .cse0))) is different from true [2025-04-30 10:13:07,345 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (and (or .cse0 .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not .cse0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) .cse1)) is different from false [2025-04-30 10:13:07,346 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (and (or .cse0 .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not .cse0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) .cse1)) is different from true [2025-04-30 10:13:07,351 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse4 4))) (let ((.cse2 (= .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (.cse1 (select .cse4 0))) (and (or (= .cse0 .cse1) .cse2) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not .cse2) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))))))) is different from false [2025-04-30 10:13:07,354 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse4 4))) (let ((.cse2 (= .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (.cse1 (select .cse4 0))) (and (or (= .cse0 .cse1) .cse2) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not .cse2) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))))))) is different from true [2025-04-30 10:13:07,370 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse6 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse1 (select .cse2 4)) (.cse5 (select |c_#memory_$Pointer$#2.base| .cse4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse1 (select .cse2 0)) (= .cse1 .cse0)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |c_#valid| .cse3)))))) (= (select |c_#valid| .cse4) 1) (not (= (select .cse5 4) (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse7 0) 0) (= (select |c_#valid| (select .cse5 0)) 1) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from false [2025-04-30 10:13:07,372 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse6 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse1 (select .cse2 4)) (.cse5 (select |c_#memory_$Pointer$#2.base| .cse4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse1 (select .cse2 0)) (= .cse1 .cse0)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |c_#valid| .cse3)))))) (= (select |c_#valid| .cse4) 1) (not (= (select .cse5 4) (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse7 0) 0) (= (select |c_#valid| (select .cse5 0)) 1) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from true [2025-04-30 10:13:07,386 WARN L849 $PredicateComparison]: unable to prove that (and (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_68 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_68) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0)))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2025-04-30 10:13:07,388 WARN L871 $PredicateComparison]: unable to prove that (and (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_68 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_68) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0)))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2025-04-30 10:13:07,391 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (or (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| .cse0) 0)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_68 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |v_#valid_BEFORE_CALL_11| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_68) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 0)))) (= (store |c_old(#memory_$Pointer$#2.base)| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0)) |c_#memory_$Pointer$#2.base|))) is different from false [2025-04-30 10:13:07,393 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (or (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| .cse0) 0)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_68 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |v_#valid_BEFORE_CALL_11| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_68) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 0)))) (= (store |c_old(#memory_$Pointer$#2.base)| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0)) |c_#memory_$Pointer$#2.base|))) is different from true [2025-04-30 10:13:07,401 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (select |c_#memory_$Pointer$#2.base| .cse4))) (let ((.cse2 (select .cse3 4)) (.cse0 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (not (= (select .cse0 4) .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse1)) (or (= .cse2 (select .cse3 0)) (= .cse2 .cse4)) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse2) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse5 (select |v_old(#valid)_AFTER_CALL_12| .cse5))) |v_old(#valid)_AFTER_CALL_12|))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (select .cse0 0))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_68 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse6) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse7 (select |v_#valid_BEFORE_CALL_11| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_68) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse6) 0)))) (= 0 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|) (= (select .cse8 0) 0) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2025-04-30 10:13:07,403 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (select |c_#memory_$Pointer$#2.base| .cse4))) (let ((.cse2 (select .cse3 4)) (.cse0 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (not (= (select .cse0 4) .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse1)) (or (= .cse2 (select .cse3 0)) (= .cse2 .cse4)) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse2) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse5 (select |v_old(#valid)_AFTER_CALL_12| .cse5))) |v_old(#valid)_AFTER_CALL_12|))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (select .cse0 0))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_68 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse6) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse7 (select |v_#valid_BEFORE_CALL_11| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_68) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse6) 0)))) (= 0 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|) (= (select .cse8 0) 0) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2025-04-30 10:13:07,425 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse2 (select .cse3 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (not (= (select .cse0 4) .cse1)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse2 (select .cse3 0)) (= .cse2 .cse4)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse0 0))) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_68 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse6 (select |v_#valid_BEFORE_CALL_11| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_68) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse5) 0)))) (= (select .cse7 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse2) 1) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse8 (select |v_old(#valid)_AFTER_CALL_12| .cse8))) |v_old(#valid)_AFTER_CALL_12|))) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2025-04-30 10:13:07,428 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse2 (select .cse3 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (not (= (select .cse0 4) .cse1)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse2 (select .cse3 0)) (= .cse2 .cse4)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse0 0))) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_68 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse6 (select |v_#valid_BEFORE_CALL_11| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_68) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse5) 0)))) (= (select .cse7 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse2) 1) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse8 (select |v_old(#valid)_AFTER_CALL_12| .cse8))) |v_old(#valid)_AFTER_CALL_12|))) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2025-04-30 10:13:07,437 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse7 0))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse2 (select .cse9 4)) (.cse1 (select .cse9 0)) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3))) |v_old(#valid)_AFTER_CALL_12|))) (not (= .cse2 .cse0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 .cse1)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_68 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse5 (select |v_#valid_BEFORE_CALL_11| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_68) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 0)))) (not (let ((.cse6 (select |c_#memory_$Pointer$#2.base| (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (= (select .cse6 4) (select .cse6 0)))) (not (= .cse2 .cse1)) (= (select .cse8 0) 0) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from false [2025-04-30 10:13:07,439 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse7 0))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse2 (select .cse9 4)) (.cse1 (select .cse9 0)) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3))) |v_old(#valid)_AFTER_CALL_12|))) (not (= .cse2 .cse0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 .cse1)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_68 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse5 (select |v_#valid_BEFORE_CALL_11| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_68) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 0)))) (not (let ((.cse6 (select |c_#memory_$Pointer$#2.base| (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (= (select .cse6 4) (select .cse6 0)))) (not (= .cse2 .cse1)) (= (select .cse8 0) 0) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from true [2025-04-30 10:13:07,477 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse7 0))) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse2 (select .cse8 4)) (.cse1 (select .cse8 0)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3))) |v_old(#valid)_AFTER_CALL_12|))) (not (= .cse2 .cse0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 .cse1)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_68 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse5 (select |v_#valid_BEFORE_CALL_11| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_68) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 0)))) (not (= .cse2 .cse1)) (= (select .cse6 0) 0) (not (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|) (select (select |c_#memory_$Pointer$#2.base| (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 4))) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from false [2025-04-30 10:13:07,480 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse7 0))) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse2 (select .cse8 4)) (.cse1 (select .cse8 0)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3))) |v_old(#valid)_AFTER_CALL_12|))) (not (= .cse2 .cse0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 .cse1)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_68 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse5 (select |v_#valid_BEFORE_CALL_11| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_68) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 0)))) (not (= .cse2 .cse1)) (= (select .cse6 0) 0) (not (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|) (select (select |c_#memory_$Pointer$#2.base| (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 4))) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from true [2025-04-30 10:13:07,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:13:07,521 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2025-04-30 10:13:07,521 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-30 10:13:07,522 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 31 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 36 [2025-04-30 10:13:07,523 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:13:07,523 INFO L225 Difference]: With dead ends: 73 [2025-04-30 10:13:07,523 INFO L226 Difference]: Without dead ends: 68 [2025-04-30 10:13:07,524 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 28 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=133, Invalid=855, Unknown=54, NotChecked=2380, Total=3422 [2025-04-30 10:13:07,524 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 1478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1194 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:13:07,524 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 374 Invalid, 1478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 279 Invalid, 0 Unknown, 1194 Unchecked, 0.2s Time] [2025-04-30 10:13:07,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-04-30 10:13:07,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-04-30 10:13:07,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 57 states have internal predecessors, (65), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:13:07,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2025-04-30 10:13:07,536 INFO L79 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 36 [2025-04-30 10:13:07,536 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:13:07,536 INFO L485 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2025-04-30 10:13:07,538 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 31 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:13:07,538 INFO L278 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2025-04-30 10:13:07,539 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-30 10:13:07,539 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:13:07,539 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:13:07,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-30 10:13:07,739 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:13:07,740 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:13:07,740 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:13:07,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1124311948, now seen corresponding path program 1 times [2025-04-30 10:13:07,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:13:07,740 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123714666] [2025-04-30 10:13:07,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:13:07,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:13:07,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:13:07,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:13:07,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:13:07,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:07,801 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:13:07,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:13:07,802 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123714666] [2025-04-30 10:13:07,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123714666] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:13:07,802 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456167511] [2025-04-30 10:13:07,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:13:07,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:13:07,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:13:07,804 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:13:07,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-30 10:13:07,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:13:07,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:13:07,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:13:07,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:07,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-30 10:13:07,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:13:07,951 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:13:07,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:13:07,971 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:13:07,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456167511] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:13:07,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:13:07,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-04-30 10:13:07,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702598308] [2025-04-30 10:13:07,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:13:07,972 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:13:07,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:13:07,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:13:07,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:13:07,972 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-30 10:13:07,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:13:07,996 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2025-04-30 10:13:07,996 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:13:07,996 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 36 [2025-04-30 10:13:07,996 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:13:07,996 INFO L225 Difference]: With dead ends: 98 [2025-04-30 10:13:07,997 INFO L226 Difference]: Without dead ends: 53 [2025-04-30 10:13:07,997 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:13:07,997 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:13:07,997 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:13:07,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-04-30 10:13:08,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-04-30 10:13:08,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 44 states have internal predecessors, (49), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-04-30 10:13:08,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2025-04-30 10:13:08,002 INFO L79 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 36 [2025-04-30 10:13:08,002 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:13:08,002 INFO L485 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2025-04-30 10:13:08,002 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-30 10:13:08,002 INFO L278 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2025-04-30 10:13:08,003 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-30 10:13:08,003 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:13:08,003 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:13:08,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-30 10:13:08,203 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:13:08,203 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:13:08,204 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:13:08,204 INFO L85 PathProgramCache]: Analyzing trace with hash -213955875, now seen corresponding path program 2 times [2025-04-30 10:13:08,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:13:08,204 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739594903] [2025-04-30 10:13:08,204 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:13:08,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:13:08,219 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-04-30 10:13:08,266 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-30 10:13:08,267 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:13:08,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:12,552 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:13:12,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:13:12,552 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739594903] [2025-04-30 10:13:12,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739594903] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:13:12,552 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094653841] [2025-04-30 10:13:12,552 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:13:12,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:13:12,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:13:12,554 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:13:12,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-30 10:13:12,667 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-04-30 10:13:12,911 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-30 10:13:12,911 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:13:12,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:12,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 145 conjuncts are in the unsatisfiable core [2025-04-30 10:13:12,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:13:12,953 INFO L354 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-04-30 10:13:13,182 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-30 10:13:13,182 INFO L354 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-04-30 10:13:13,255 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:13:13,263 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:13:13,322 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-30 10:13:13,329 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-30 10:13:13,445 INFO L325 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2025-04-30 10:13:13,446 INFO L354 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 73 [2025-04-30 10:13:13,455 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 18 [2025-04-30 10:13:13,591 INFO L354 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 49 treesize of output 17 [2025-04-30 10:13:13,595 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2025-04-30 10:13:13,598 INFO L354 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-04-30 10:13:13,819 INFO L325 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-04-30 10:13:13,819 INFO L354 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 31 treesize of output 28 [2025-04-30 10:13:13,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:13:13,837 INFO L354 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 57 treesize of output 34 [2025-04-30 10:13:13,857 INFO L325 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-04-30 10:13:13,857 INFO L354 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-04-30 10:13:14,148 INFO L325 Elim1Store]: treesize reduction 87, result has 17.9 percent of original size [2025-04-30 10:13:14,149 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 304 treesize of output 194 [2025-04-30 10:13:14,185 INFO L325 Elim1Store]: treesize reduction 228, result has 6.2 percent of original size [2025-04-30 10:13:14,185 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 474 treesize of output 326 [2025-04-30 10:13:14,196 INFO L325 Elim1Store]: treesize reduction 130, result has 0.8 percent of original size [2025-04-30 10:13:14,196 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 438 treesize of output 184 [2025-04-30 10:13:14,209 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 56 [2025-04-30 10:13:14,216 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 63 [2025-04-30 10:13:14,222 INFO L354 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 23 treesize of output 19 [2025-04-30 10:13:14,228 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 61 [2025-04-30 10:13:14,850 INFO L354 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 165 treesize of output 113 [2025-04-30 10:13:14,857 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:13:14,858 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 46 [2025-04-30 10:13:14,862 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2025-04-30 10:13:14,901 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:13:14,902 INFO L312 TraceCheckSpWp]: Computing backward predicates... Killed by 15