./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/list-simple/sll2c_prepend_unequal.c --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/sll2c_prepend_unequal.c -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 6ac68ac639a07ffe3377df6705a3d40d8ae3d648248881663949ee674511c5a7 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 10:56:09,518 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 10:56:09,565 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-29 10:56:09,568 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 10:56:09,568 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 10:56:09,582 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 10:56:09,582 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 10:56:09,582 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 10:56:09,583 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 10:56:09,583 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 10:56:09,583 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 10:56:09,583 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 10:56:09,583 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 10:56:09,583 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 10:56:09,583 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 10:56:09,583 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 10:56:09,584 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 10:56:09,584 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 10:56:09,584 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 10:56:09,584 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 10:56:09,584 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 10:56:09,584 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 10:56:09,584 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 10:56:09,584 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 10:56:09,584 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 10:56:09,584 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 10:56:09,584 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 10:56:09,584 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 10:56:09,585 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 10:56:09,585 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:56:09,585 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:56:09,585 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:56:09,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:56:09,585 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 10:56:09,585 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:56:09,585 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:56:09,585 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:56:09,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:56:09,585 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 10:56:09,585 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 10:56:09,585 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 10:56:09,586 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 10:56:09,586 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 10:56:09,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 10:56:09,586 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 10:56:09,586 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 10:56:09,586 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 10:56:09,586 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 -> 6ac68ac639a07ffe3377df6705a3d40d8ae3d648248881663949ee674511c5a7 [2025-04-29 10:56:09,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 10:56:09,812 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 10:56:09,816 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 10:56:09,818 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 10:56:09,818 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 10:56:09,819 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2c_prepend_unequal.c [2025-04-29 10:56:11,069 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c549ea24e/ffa92fc0dbd9480ba8b935a04fad2260/FLAG06a323d6b [2025-04-29 10:56:11,275 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 10:56:11,276 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_prepend_unequal.c [2025-04-29 10:56:11,278 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:56:11,278 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:56:11,284 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c549ea24e/ffa92fc0dbd9480ba8b935a04fad2260/FLAG06a323d6b [2025-04-29 10:56:12,119 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c549ea24e/ffa92fc0dbd9480ba8b935a04fad2260 [2025-04-29 10:56:12,121 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 10:56:12,122 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 10:56:12,123 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 10:56:12,123 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 10:56:12,129 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 10:56:12,130 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:56:12" (1/1) ... [2025-04-29 10:56:12,130 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6135d8f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:12, skipping insertion in model container [2025-04-29 10:56:12,130 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:56:12" (1/1) ... [2025-04-29 10:56:12,143 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 10:56:12,292 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/sll2c_prepend_unequal.c[1728,1741] [2025-04-29 10:56:12,299 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:56:12,305 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 10:56:12,330 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/sll2c_prepend_unequal.c[1728,1741] [2025-04-29 10:56:12,330 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:56:12,339 INFO L204 MainTranslator]: Completed translation [2025-04-29 10:56:12,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:12 WrapperNode [2025-04-29 10:56:12,340 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 10:56:12,340 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 10:56:12,341 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 10:56:12,341 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 10:56:12,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:12" (1/1) ... [2025-04-29 10:56:12,351 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:12" (1/1) ... [2025-04-29 10:56:12,367 INFO L138 Inliner]: procedures = 18, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 137 [2025-04-29 10:56:12,367 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 10:56:12,368 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 10:56:12,368 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 10:56:12,368 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 10:56:12,374 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:12" (1/1) ... [2025-04-29 10:56:12,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:12" (1/1) ... [2025-04-29 10:56:12,376 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:12" (1/1) ... [2025-04-29 10:56:12,389 INFO L175 MemorySlicer]: Split 25 memory accesses to 2 slices as follows [15, 10]. 60 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [0, 1]. The 9 writes are split as follows [7, 2]. [2025-04-29 10:56:12,392 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:12" (1/1) ... [2025-04-29 10:56:12,393 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:12" (1/1) ... [2025-04-29 10:56:12,399 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:12" (1/1) ... [2025-04-29 10:56:12,399 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:12" (1/1) ... [2025-04-29 10:56:12,401 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:12" (1/1) ... [2025-04-29 10:56:12,402 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:12" (1/1) ... [2025-04-29 10:56:12,403 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:12" (1/1) ... [2025-04-29 10:56:12,406 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 10:56:12,406 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 10:56:12,407 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 10:56:12,407 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 10:56:12,408 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:12" (1/1) ... [2025-04-29 10:56:12,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:56:12,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:12,431 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-29 10:56:12,432 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-29 10:56:12,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 10:56:12,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 10:56:12,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 10:56:12,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 10:56:12,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 10:56:12,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 10:56:12,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 10:56:12,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 10:56:12,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 10:56:12,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 10:56:12,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 10:56:12,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 10:56:12,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 10:56:12,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 10:56:12,448 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-04-29 10:56:12,448 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-04-29 10:56:12,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 10:56:12,528 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 10:56:12,529 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 10:56:12,718 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2025-04-29 10:56:12,718 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 10:56:12,725 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 10:56:12,725 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-29 10:56:12,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:56:12 BoogieIcfgContainer [2025-04-29 10:56:12,726 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 10:56:12,727 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 10:56:12,727 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 10:56:12,731 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 10:56:12,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 10:56:12" (1/3) ... [2025-04-29 10:56:12,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e4cb22d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:56:12, skipping insertion in model container [2025-04-29 10:56:12,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:12" (2/3) ... [2025-04-29 10:56:12,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e4cb22d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:56:12, skipping insertion in model container [2025-04-29 10:56:12,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:56:12" (3/3) ... [2025-04-29 10:56:12,732 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_unequal.c [2025-04-29 10:56:12,742 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 10:56:12,743 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2c_prepend_unequal.c that has 2 procedures, 35 locations, 51 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-29 10:56:12,782 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 10:56:12,790 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;@3432888c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 10:56:12,790 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-29 10:56:12,793 INFO L278 IsEmpty]: Start isEmpty. Operand has 35 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 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-29 10:56:12,797 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-29 10:56:12,798 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:12,798 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:12,799 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:12,802 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:12,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1254604616, now seen corresponding path program 1 times [2025-04-29 10:56:12,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:12,807 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593356730] [2025-04-29 10:56:12,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:12,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:12,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 10:56:12,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 10:56:12,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:12,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:13,098 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-29 10:56:13,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:13,100 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593356730] [2025-04-29 10:56:13,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593356730] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:56:13,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:56:13,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:56:13,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542932921] [2025-04-29 10:56:13,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:56:13,104 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:56:13,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:13,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:56:13,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:56:13,120 INFO L87 Difference]: Start difference. First operand has 35 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 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 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:56:13,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:13,153 INFO L93 Difference]: Finished difference Result 66 states and 91 transitions. [2025-04-29 10:56:13,153 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:56:13,154 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2025-04-29 10:56:13,155 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:13,159 INFO L225 Difference]: With dead ends: 66 [2025-04-29 10:56:13,159 INFO L226 Difference]: Without dead ends: 31 [2025-04-29 10:56:13,161 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-29 10:56:13,164 INFO L437 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 81 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-29 10:56:13,166 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 81 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:56:13,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-04-29 10:56:13,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2025-04-29 10:56:13,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:56:13,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2025-04-29 10:56:13,194 INFO L79 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 22 [2025-04-29 10:56:13,195 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:13,195 INFO L485 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2025-04-29 10:56:13,195 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:56:13,195 INFO L278 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2025-04-29 10:56:13,196 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 10:56:13,197 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:13,197 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] [2025-04-29 10:56:13,198 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 10:56:13,198 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:13,198 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:13,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1003413184, now seen corresponding path program 1 times [2025-04-29 10:56:13,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:13,199 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048594360] [2025-04-29 10:56:13,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:13,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:13,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 10:56:13,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 10:56:13,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:13,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:13,580 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-29 10:56:13,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:13,580 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048594360] [2025-04-29 10:56:13,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048594360] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:13,580 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735303669] [2025-04-29 10:56:13,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:13,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:13,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:13,583 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-29 10:56:13,584 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-29 10:56:13,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 10:56:13,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 10:56:13,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:13,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:13,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-29 10:56:13,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:13,831 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-29 10:56:13,844 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-29 10:56:13,844 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:56:13,895 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-29 10:56:13,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735303669] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:56:13,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:56:13,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 12 [2025-04-29 10:56:13,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770626719] [2025-04-29 10:56:13,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:56:13,896 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 10:56:13,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:13,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 10:56:13,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-04-29 10:56:13,897 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 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-29 10:56:17,922 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-29 10:56:21,941 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-29 10:56:25,954 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-29 10:56:30,052 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-29 10:56:34,082 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-29 10:56:34,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:34,085 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2025-04-29 10:56:34,085 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 10:56:34,085 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 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 30 [2025-04-29 10:56:34,085 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:34,086 INFO L225 Difference]: With dead ends: 44 [2025-04-29 10:56:34,086 INFO L226 Difference]: Without dead ends: 36 [2025-04-29 10:56:34,086 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-04-29 10:56:34,087 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 7 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:34,087 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 235 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 5 Unknown, 0 Unchecked, 20.1s Time] [2025-04-29 10:56:34,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-04-29 10:56:34,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2025-04-29 10:56:34,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:56:34,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2025-04-29 10:56:34,092 INFO L79 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 30 [2025-04-29 10:56:34,092 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:34,092 INFO L485 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2025-04-29 10:56:34,092 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 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-29 10:56:34,092 INFO L278 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2025-04-29 10:56:34,093 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-29 10:56:34,093 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:34,093 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-29 10:56:34,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-29 10:56:34,296 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-29 10:56:34,296 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:34,296 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:34,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1101151327, now seen corresponding path program 1 times [2025-04-29 10:56:34,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:34,297 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686826459] [2025-04-29 10:56:34,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:34,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:34,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 10:56:34,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 10:56:34,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:34,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:35,435 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-29 10:56:35,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:35,436 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686826459] [2025-04-29 10:56:35,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686826459] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:35,436 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710300716] [2025-04-29 10:56:35,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:35,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:35,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:35,438 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-29 10:56:35,440 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-29 10:56:35,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 10:56:35,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 10:56:35,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:35,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:35,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-04-29 10:56:35,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:35,589 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-29 10:56:35,690 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 9 treesize of output 3 [2025-04-29 10:56:35,725 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 13 treesize of output 9 [2025-04-29 10:56:35,781 INFO L325 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-04-29 10:56:35,781 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-04-29 10:56:35,946 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 0 case distinctions, treesize of input 54 treesize of output 52 [2025-04-29 10:56:35,951 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 34 treesize of output 21 [2025-04-29 10:56:35,957 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 0 case distinctions, treesize of input 28 treesize of output 8 [2025-04-29 10:56:35,960 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 15 treesize of output 1 [2025-04-29 10:56:35,993 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 35 treesize of output 27 [2025-04-29 10:56:35,995 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 27 treesize of output 19 [2025-04-29 10:56:35,997 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 7 [2025-04-29 10:56:36,022 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-29 10:56:36,022 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:56:36,033 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 86 treesize of output 82 [2025-04-29 10:56:36,097 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) (.cse4 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (forall ((v_ArrVal_310 Int) (v_ArrVal_311 (Array Int Int)) (v_arrayElimCell_11 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_310)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_311) .cse1) (+ 4 v_arrayElimCell_11))))) (.cse5 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (forall ((v_ArrVal_310 Int) (v_ArrVal_311 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_310)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_311))) (or (forall ((v_arrayElimCell_11 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse0 .cse1) (+ 4 v_arrayElimCell_11)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2))))) (or (not .cse4) (not .cse5) (forall ((v_ArrVal_310 Int) (v_ArrVal_311 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_310)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_311) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse2)))) (or .cse6 .cse4) (or .cse6 .cse5)))) is different from false [2025-04-29 10:56:36,221 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse3 (select |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse4 (select .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse8 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) (.cse2 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (forall ((v_ArrVal_310 Int) (v_ArrVal_311 (Array Int Int)) (v_arrayElimCell_11 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_310)) .cse4 v_ArrVal_311) .cse8) (+ 4 v_arrayElimCell_11)))))) (and (or .cse0 .cse1) (or (not .cse2) (forall ((v_ArrVal_310 Int) (v_ArrVal_311 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_310)) .cse4 v_ArrVal_311) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse5))) (not .cse0)) (forall ((v_ArrVal_310 Int) (v_ArrVal_311 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_310)) .cse4 v_ArrVal_311))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse6 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse5)) (forall ((v_arrayElimCell_11 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse6 .cse8) (+ 4 v_arrayElimCell_11))))))) (or .cse2 .cse1))))) is different from false [2025-04-29 10:56:36,270 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse6 (select |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_#t~ret6#1.base|)) (.cse7 (select .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (forall ((v_ArrVal_310 Int) (v_ArrVal_311 (Array Int Int)) (v_arrayElimCell_11 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_#t~ret6#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_#t~ret6#1.offset| v_ArrVal_310)) .cse7 v_ArrVal_311) .cse5) (+ 4 v_arrayElimCell_11))))) (.cse0 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret6#1.offset| 4))) (and (or .cse0 .cse1) (forall ((v_ArrVal_310 Int) (v_ArrVal_311 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_#t~ret6#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_#t~ret6#1.offset| v_ArrVal_310)) .cse7 v_ArrVal_311))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse2 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret6#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4)) (forall ((v_arrayElimCell_11 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse2 .cse5) (+ 4 v_arrayElimCell_11))))))) (or .cse1 .cse8) (or (not .cse0) (not .cse8) (forall ((v_ArrVal_310 Int) (v_ArrVal_311 (Array Int Int))) (= (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_#t~ret6#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_#t~ret6#1.offset| v_ArrVal_310)) .cse7 v_ArrVal_311) |c_ULTIMATE.start_sll_circular_prepend_#t~ret6#1.base|) .cse4) |c_ULTIMATE.start_main_~uneq~0#1|))))))) is different from false [2025-04-29 10:56:36,364 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:56:36,364 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 188 treesize of output 250 [2025-04-29 10:56:36,459 INFO L325 Elim1Store]: treesize reduction 80, result has 52.1 percent of original size [2025-04-29 10:56:36,460 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 579 treesize of output 616 [2025-04-29 10:56:36,480 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:56:36,480 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 405 treesize of output 398 [2025-04-29 10:56:36,499 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:56:36,499 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 398 treesize of output 394 [2025-04-29 10:56:36,544 INFO L325 Elim1Store]: treesize reduction 12, result has 78.9 percent of original size [2025-04-29 10:56:36,544 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 463 treesize of output 483 [2025-04-29 10:56:36,558 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 396 treesize of output 392 [2025-04-29 10:56:36,574 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 392 treesize of output 388 [2025-04-29 10:56:36,595 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:56:36,596 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 397 treesize of output 397 [2025-04-29 10:56:36,622 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 384 treesize of output 376 [2025-04-29 10:56:37,113 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 8 treesize of output 4 [2025-04-29 10:56:37,150 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 183 treesize of output 175 [2025-04-29 10:56:37,292 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 76 treesize of output 68 [2025-04-29 10:56:37,324 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 183 treesize of output 175 [2025-04-29 10:56:37,536 INFO L325 Elim1Store]: treesize reduction 168, result has 0.6 percent of original size [2025-04-29 10:56:37,536 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 128 treesize of output 1 [2025-04-29 10:56:37,926 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:56:37,926 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 234 treesize of output 694 [2025-04-29 10:56:52,843 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:56:52,843 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 15 select indices, 15 select index equivalence classes, 0 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 105 case distinctions, treesize of input 308 treesize of output 1064 [2025-04-29 10:56:59,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710300716] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:59,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:56:59,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 30 [2025-04-29 10:56:59,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119589604] [2025-04-29 10:56:59,160 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 10:56:59,160 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-29 10:56:59,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:59,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-29 10:56:59,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=862, Unknown=3, NotChecked=180, Total=1122 [2025-04-29 10:56:59,161 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 30 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 24 states have internal predecessors, (47), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-04-29 10:56:59,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:59,657 INFO L93 Difference]: Finished difference Result 64 states and 79 transitions. [2025-04-29 10:56:59,657 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-29 10:56:59,657 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 24 states have internal predecessors, (47), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 33 [2025-04-29 10:56:59,658 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:59,659 INFO L225 Difference]: With dead ends: 64 [2025-04-29 10:56:59,659 INFO L226 Difference]: Without dead ends: 55 [2025-04-29 10:56:59,660 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=124, Invalid=1367, Unknown=3, NotChecked=228, Total=1722 [2025-04-29 10:56:59,660 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 25 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:59,660 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 419 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 10:56:59,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-04-29 10:56:59,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2025-04-29 10:56:59,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-04-29 10:56:59,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2025-04-29 10:56:59,665 INFO L79 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 33 [2025-04-29 10:56:59,665 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:59,665 INFO L485 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2025-04-29 10:56:59,666 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 24 states have internal predecessors, (47), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-04-29 10:56:59,666 INFO L278 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2025-04-29 10:56:59,666 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-29 10:56:59,666 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:59,666 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-29 10:56:59,672 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-29 10:56:59,869 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-29 10:56:59,869 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:59,869 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:59,869 INFO L85 PathProgramCache]: Analyzing trace with hash 609634588, now seen corresponding path program 1 times [2025-04-29 10:56:59,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:59,870 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350271031] [2025-04-29 10:56:59,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:59,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:59,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 10:56:59,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 10:56:59,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:59,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:57:00,982 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:57:00,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:57:00,982 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350271031] [2025-04-29 10:57:00,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350271031] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:57:00,982 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425996878] [2025-04-29 10:57:00,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:57:00,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:57:00,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:57:00,985 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-29 10:57:00,985 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-29 10:57:01,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 10:57:01,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 10:57:01,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:57:01,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:57:01,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 98 conjuncts are in the unsatisfiable core [2025-04-29 10:57:01,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:57:01,090 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-29 10:57:01,225 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 10:57:01,225 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-29 10:57:01,260 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-29 10:57:01,301 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-29 10:57:01,302 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 34 treesize of output 33 [2025-04-29 10:57:01,374 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 38 treesize of output 14 [2025-04-29 10:57:01,378 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-29 10:57:01,438 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 13 treesize of output 9 [2025-04-29 10:57:01,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:57:01,487 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 46 treesize of output 35 [2025-04-29 10:57:01,501 INFO L325 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2025-04-29 10:57:01,502 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 32 treesize of output 34 [2025-04-29 10:57:01,696 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:57:01,699 INFO L325 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2025-04-29 10:57:01,699 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 1 case distinctions, treesize of input 52 treesize of output 19 [2025-04-29 10:57:01,771 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 46 treesize of output 44 [2025-04-29 10:57:01,774 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 26 treesize of output 21 [2025-04-29 10:57:01,778 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 0 case distinctions, treesize of input 28 treesize of output 8 [2025-04-29 10:57:01,780 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 15 treesize of output 1 [2025-04-29 10:57:01,818 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 35 treesize of output 27 [2025-04-29 10:57:01,819 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 27 treesize of output 19 [2025-04-29 10:57:01,821 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 7 [2025-04-29 10:57:01,822 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:57:01,822 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:57:03,684 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_463 Int) (v_ArrVal_462 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_463)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_462) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2025-04-29 10:57:03,997 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:57:03,997 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 70 [2025-04-29 10:57:04,004 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:57:04,004 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 126 treesize of output 125 [2025-04-29 10:57:04,010 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 50 treesize of output 34 [2025-04-29 10:57:04,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425996878] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:57:04,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:57:04,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 42 [2025-04-29 10:57:04,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021663574] [2025-04-29 10:57:04,157 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 10:57:04,157 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-29 10:57:04,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:57:04,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-29 10:57:04,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1910, Unknown=52, NotChecked=88, Total=2162 [2025-04-29 10:57:04,158 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 42 states, 40 states have (on average 1.4) internal successors, (56), 33 states have internal predecessors, (56), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-04-29 10:57:07,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:57:07,629 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2025-04-29 10:57:07,629 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-29 10:57:07,629 INFO L79 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 1.4) internal successors, (56), 33 states have internal predecessors, (56), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 36 [2025-04-29 10:57:07,630 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:57:07,631 INFO L225 Difference]: With dead ends: 68 [2025-04-29 10:57:07,631 INFO L226 Difference]: Without dead ends: 66 [2025-04-29 10:57:07,632 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=302, Invalid=4617, Unknown=55, NotChecked=138, Total=5112 [2025-04-29 10:57:07,633 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 70 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-29 10:57:07,633 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 462 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-29 10:57:07,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-04-29 10:57:07,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 51. [2025-04-29 10:57:07,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-04-29 10:57:07,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2025-04-29 10:57:07,645 INFO L79 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 36 [2025-04-29 10:57:07,645 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:57:07,645 INFO L485 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2025-04-29 10:57:07,646 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 1.4) internal successors, (56), 33 states have internal predecessors, (56), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-04-29 10:57:07,646 INFO L278 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2025-04-29 10:57:07,646 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-29 10:57:07,646 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:57:07,646 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, 1, 1] [2025-04-29 10:57:07,657 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-29 10:57:07,846 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-29 10:57:07,847 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:57:07,847 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:57:07,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1743315351, now seen corresponding path program 1 times [2025-04-29 10:57:07,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:57:07,847 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314547317] [2025-04-29 10:57:07,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:57:07,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:57:07,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-29 10:57:07,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 10:57:07,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:57:07,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:57:09,301 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:57:09,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:57:09,301 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314547317] [2025-04-29 10:57:09,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314547317] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:57:09,302 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791347983] [2025-04-29 10:57:09,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:57:09,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:57:09,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:57:09,303 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-29 10:57:09,304 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-29 10:57:09,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-29 10:57:09,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 10:57:09,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:57:09,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:57:09,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 122 conjuncts are in the unsatisfiable core [2025-04-29 10:57:09,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:57:09,439 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-29 10:57:09,585 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-29 10:57:09,637 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 10:57:09,637 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-29 10:57:09,679 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-29 10:57:09,683 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-29 10:57:09,731 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-29 10:57:09,731 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 50 treesize of output 45 [2025-04-29 10:57:09,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 24 treesize of output 11 [2025-04-29 10:57:09,828 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 30 treesize of output 14 [2025-04-29 10:57:09,830 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 11 treesize of output 3 [2025-04-29 10:57:09,833 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-29 10:57:09,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:57:09,993 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 38 treesize of output 27 [2025-04-29 10:57:10,005 INFO L325 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-04-29 10:57:10,005 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-29 10:57:10,018 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 20 treesize of output 15 [2025-04-29 10:57:10,431 INFO L325 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2025-04-29 10:57:10,432 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 22 [2025-04-29 10:57:10,437 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2025-04-29 10:57:10,441 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 0 case distinctions, treesize of input 142 treesize of output 84 [2025-04-29 10:57:10,444 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 49 treesize of output 15 [2025-04-29 10:57:10,447 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 0 case distinctions, treesize of input 138 treesize of output 83 [2025-04-29 10:57:10,459 INFO L325 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2025-04-29 10:57:10,460 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 176 treesize of output 99 [2025-04-29 10:57:10,462 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 56 treesize of output 19 [2025-04-29 10:57:10,519 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 118 treesize of output 82 [2025-04-29 10:57:10,521 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 86 treesize of output 58 [2025-04-29 10:57:10,609 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-29 10:57:10,609 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 26 [2025-04-29 10:57:10,613 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-29 10:57:10,705 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:57:10,705 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:57:10,825 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:57:10,825 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 102 [2025-04-29 10:57:10,834 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:57:10,834 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 204 treesize of output 207 [2025-04-29 10:57:10,843 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 88 treesize of output 74 [2025-04-29 10:57:10,974 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse2)) (.cse9 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse7 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse13 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse7)) (.cse10 (+ (select .cse9 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 4)) (.cse0 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse1 (select .cse13 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (not .cse4))) (and (or (and (or (forall ((v_ArrVal_623 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_114 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_621) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_620) (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse1)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_623) .cse2) .cse3)) (+ v_arrayElimCell_114 4)))) .cse4) (or (forall ((v_ArrVal_623 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_115 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_621) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_620) (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse1)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_623) .cse2) .cse3)) (+ v_arrayElimCell_115 4)))) .cse5) (forall ((v_ArrVal_623 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_114 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_621) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_620) (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse1)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_623) .cse2) .cse3)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse6 (+ v_arrayElimCell_115 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse6 (+ v_arrayElimCell_114 4))))))) (= .cse7 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (or (not .cse8) (forall ((v_ArrVal_623 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_115 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_621) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_620) (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse1)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_623) .cse7) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ v_arrayElimCell_115 4))))) (or (forall ((v_ArrVal_623 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_621) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_620) (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse1)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_623) .cse7) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse10))) .cse8) (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (forall ((v_ArrVal_623 (Array Int Int)) (v_arrayElimCell_115 Int) (v_arrayElimCell_114 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_621) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_620) (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse1)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_623) .cse2) .cse3)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 (+ v_arrayElimCell_115 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 (+ v_arrayElimCell_114 4)))))))) (forall ((v_ArrVal_623 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_115 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_621) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_620) (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse1)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_623) .cse7) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse12 (+ v_arrayElimCell_115 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse12 .cse10))))) (or (forall ((v_ArrVal_623 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_114 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_621) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_620) (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse1)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_623) .cse2) .cse3)) (+ v_arrayElimCell_114 4))))) .cse4) (or (forall ((v_ArrVal_623 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_115 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_621) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_620) (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse1)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_623) .cse2) .cse3)) (+ v_arrayElimCell_115 4))))) .cse5))))) is different from false [2025-04-29 10:57:11,197 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse14 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse14 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse9 (= .cse1 .cse6))) (let ((.cse8 (not .cse9)) (.cse12 (+ (select .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 4)) (.cse0 (= .cse1 .cse4)) (.cse2 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse3 (select .cse14 |c_ULTIMATE.start_sll_circular_prepend_~head#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|))) (and (or (not .cse0) (forall ((v_ArrVal_623 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_115 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_621) .cse1 v_ArrVal_620) (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_623) .cse4) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ v_arrayElimCell_115 4))))) (or (forall ((v_ArrVal_623 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_115 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_621) .cse1 v_ArrVal_620) (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_623) .cse6) .cse7)) (+ v_arrayElimCell_115 4))))) .cse8) (or (= .cse4 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (and (or .cse9 (forall ((v_ArrVal_623 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_114 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_621) .cse1 v_ArrVal_620) (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_623) .cse6) .cse7)) (+ v_arrayElimCell_114 4))))) (or (forall ((v_ArrVal_623 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_115 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_621) .cse1 v_ArrVal_620) (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_623) .cse6) .cse7)) (+ v_arrayElimCell_115 4)))) .cse8) (forall ((v_ArrVal_623 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_114 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_621) .cse1 v_ArrVal_620) (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_623) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 (+ v_arrayElimCell_114 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 (+ v_arrayElimCell_115 4)))))))) (forall ((v_ArrVal_623 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_115 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_621) .cse1 v_ArrVal_620) (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_623) .cse4) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 (+ v_arrayElimCell_115 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 .cse12))))) (or .cse9 (forall ((v_ArrVal_623 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_114 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_621) .cse1 v_ArrVal_620) (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_623) .cse6) .cse7)) (+ v_arrayElimCell_114 4)))))) (or (forall ((v_ArrVal_623 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_621) .cse1 v_ArrVal_620) (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_623) .cse4) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse12))) .cse0) (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (forall ((v_ArrVal_623 (Array Int Int)) (v_arrayElimCell_115 Int) (v_arrayElimCell_114 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_621) .cse1 v_ArrVal_620) (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_623) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse13 (+ v_arrayElimCell_114 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse13 (+ v_arrayElimCell_115 4)))))))))))) is different from false [2025-04-29 10:57:11,416 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse15 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse3 (select .cse15 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse14 (select .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#0.base| .cse3) .cse14)) (.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse12 (= .cse1 .cse7)) (.cse4 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse15 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (= .cse1 .cse4)) (.cse9 (not .cse12)) (.cse6 (+ .cse14 4)) (.cse2 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse8 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (or .cse0 (forall ((v_ArrVal_623 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_621) .cse1 v_ArrVal_620) (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_623) .cse4) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse6)))) (or (forall ((v_ArrVal_623 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_115 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_621) .cse1 v_ArrVal_620) (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_623) .cse7) .cse8)) (+ v_arrayElimCell_115 4))))) .cse9) (or (not .cse0) (forall ((v_ArrVal_623 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_115 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_621) .cse1 v_ArrVal_620) (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_623) .cse4) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ v_arrayElimCell_115 4))))) (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (forall ((v_ArrVal_623 (Array Int Int)) (v_arrayElimCell_115 Int) (v_arrayElimCell_114 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_621) .cse1 v_ArrVal_620) (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_623) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 (+ v_arrayElimCell_114 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 (+ v_arrayElimCell_115 4)))))))) (or (= .cse4 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (and (forall ((v_ArrVal_623 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_114 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_621) .cse1 v_ArrVal_620) (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_623) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 (+ v_arrayElimCell_114 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 (+ v_arrayElimCell_115 4)))))) (or (forall ((v_ArrVal_623 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_115 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_621) .cse1 v_ArrVal_620) (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_623) .cse7) .cse8)) (+ v_arrayElimCell_115 4)))) .cse9) (or (forall ((v_ArrVal_623 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_114 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_621) .cse1 v_ArrVal_620) (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_623) .cse7) .cse8)) (+ v_arrayElimCell_114 4)))) .cse12))) (forall ((v_ArrVal_623 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_115 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_621) .cse1 v_ArrVal_620) (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_623) .cse4) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse13 (+ v_arrayElimCell_115 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse13 .cse6))))) (or (forall ((v_ArrVal_623 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_114 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_621) .cse1 v_ArrVal_620) (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_623) .cse7) .cse8)) (+ v_arrayElimCell_114 4))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) .cse12))))))) is different from false [2025-04-29 10:57:11,500 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse15 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse3 (select .cse15 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse14 (select .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#0.base| .cse3) .cse14)) (.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse12 (= .cse1 .cse9)) (.cse4 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse15 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret6#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (= .cse1 .cse4)) (.cse7 (+ .cse14 4)) (.cse2 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret6#1.base|)) (.cse10 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse11 (not .cse12))) (and (or (not .cse0) (forall ((v_ArrVal_623 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_115 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_#t~ret6#1.base| v_ArrVal_621) .cse1 v_ArrVal_620) (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret6#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_623) .cse4) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ v_arrayElimCell_115 4))))) (forall ((v_ArrVal_623 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_115 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_#t~ret6#1.base| v_ArrVal_621) .cse1 v_ArrVal_620) (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret6#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_623) .cse4) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse6 (+ v_arrayElimCell_115 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse6 .cse7))))) (or .cse0 (forall ((v_ArrVal_623 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_#t~ret6#1.base| v_ArrVal_621) .cse1 v_ArrVal_620) (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret6#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_623) .cse4) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse7)))) (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (or (forall ((v_ArrVal_623 (Array Int Int)) (v_arrayElimCell_115 Int) (v_arrayElimCell_114 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_#t~ret6#1.base| v_ArrVal_621) .cse1 v_ArrVal_620) (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret6#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_623) .cse9) .cse10)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 (+ v_arrayElimCell_114 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 (+ v_arrayElimCell_115 4)))))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (or (forall ((v_ArrVal_623 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_115 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_#t~ret6#1.base| v_ArrVal_621) .cse1 v_ArrVal_620) (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret6#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_623) .cse9) .cse10)) (+ v_arrayElimCell_115 4))))) .cse11) (or .cse12 (forall ((v_ArrVal_623 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_114 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_#t~ret6#1.base| v_ArrVal_621) .cse1 v_ArrVal_620) (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret6#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_623) .cse9) .cse10)) (+ v_arrayElimCell_114 4)))))) (or (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret6#1.base| .cse4) (and (or .cse12 (forall ((v_ArrVal_623 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_114 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_#t~ret6#1.base| v_ArrVal_621) .cse1 v_ArrVal_620) (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret6#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_623) .cse9) .cse10)) (+ v_arrayElimCell_114 4))))) (forall ((v_ArrVal_623 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_114 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_#t~ret6#1.base| v_ArrVal_621) .cse1 v_ArrVal_620) (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret6#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_623) .cse9) .cse10)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse13 (+ v_arrayElimCell_114 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse13 (+ v_arrayElimCell_115 4)))))) (or (forall ((v_ArrVal_623 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_115 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_#t~ret6#1.base| v_ArrVal_621) .cse1 v_ArrVal_620) (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret6#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_623) .cse9) .cse10)) (+ v_arrayElimCell_115 4)))) .cse11))))))))) is different from false [2025-04-29 10:57:15,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791347983] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:57:15,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:57:15,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 49 [2025-04-29 10:57:15,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472343137] [2025-04-29 10:57:15,151 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 10:57:15,151 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-04-29 10:57:15,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:57:15,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-04-29 10:57:15,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2618, Unknown=4, NotChecked=420, Total=3192 [2025-04-29 10:57:15,153 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 49 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 40 states have internal predecessors, (62), 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-29 10:57:18,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:57:18,250 INFO L93 Difference]: Finished difference Result 79 states and 92 transitions. [2025-04-29 10:57:18,250 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-29 10:57:18,251 INFO L79 Accepts]: Start accepts. Automaton has has 49 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 40 states have internal predecessors, (62), 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 38 [2025-04-29 10:57:18,251 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:57:18,251 INFO L225 Difference]: With dead ends: 79 [2025-04-29 10:57:18,251 INFO L226 Difference]: Without dead ends: 77 [2025-04-29 10:57:18,253 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 909 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=298, Invalid=4826, Unknown=4, NotChecked=572, Total=5700 [2025-04-29 10:57:18,253 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 63 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-29 10:57:18,253 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 521 Invalid, 1098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-29 10:57:18,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-04-29 10:57:18,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 64. [2025-04-29 10:57:18,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 55 states have internal predecessors, (64), 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-29 10:57:18,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2025-04-29 10:57:18,261 INFO L79 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 38 [2025-04-29 10:57:18,262 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:57:18,262 INFO L485 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2025-04-29 10:57:18,262 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 40 states have internal predecessors, (62), 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-29 10:57:18,262 INFO L278 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2025-04-29 10:57:18,262 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-29 10:57:18,262 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:57:18,262 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-29 10:57:18,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-29 10:57:18,463 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-29 10:57:18,463 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:57:18,463 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:57:18,463 INFO L85 PathProgramCache]: Analyzing trace with hash -622024897, now seen corresponding path program 2 times [2025-04-29 10:57:18,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:57:18,463 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714181408] [2025-04-29 10:57:18,463 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:57:18,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:57:18,476 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-04-29 10:57:18,495 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 10:57:18,495 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:57:18,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15