./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 01:52:32,050 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 01:52:32,132 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 01:52:32,137 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 01:52:32,138 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 01:52:32,170 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 01:52:32,172 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 01:52:32,172 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 01:52:32,173 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 01:52:32,175 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 01:52:32,175 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 01:52:32,176 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 01:52:32,176 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 01:52:32,179 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 01:52:32,180 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 01:52:32,180 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 01:52:32,181 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 01:52:32,181 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 01:52:32,181 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 01:52:32,182 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 01:52:32,182 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 01:52:32,182 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 01:52:32,183 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 01:52:32,183 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 01:52:32,183 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 01:52:32,184 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 01:52:32,184 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 01:52:32,184 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 01:52:32,185 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 01:52:32,185 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 01:52:32,185 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 01:52:32,185 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 01:52:32,185 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 01:52:32,186 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 01:52:32,186 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 01:52:32,186 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 01:52:32,186 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 01:52:32,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 01:52:32,187 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 01:52:32,187 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 01:52:32,187 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 01:52:32,189 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 01:52:32,189 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda [2024-10-14 01:52:32,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 01:52:32,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 01:52:32,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 01:52:32,476 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 01:52:32,477 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 01:52:32,478 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i [2024-10-14 01:52:33,909 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 01:52:34,161 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 01:52:34,161 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i [2024-10-14 01:52:34,173 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60365f339/14dec939fb764b3582ecd22dbd30ed71/FLAG738dedb3f [2024-10-14 01:52:34,185 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60365f339/14dec939fb764b3582ecd22dbd30ed71 [2024-10-14 01:52:34,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 01:52:34,189 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 01:52:34,190 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 01:52:34,191 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 01:52:34,196 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 01:52:34,197 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:52:34" (1/1) ... [2024-10-14 01:52:34,199 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53d6a443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:52:34, skipping insertion in model container [2024-10-14 01:52:34,200 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:52:34" (1/1) ... [2024-10-14 01:52:34,248 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 01:52:34,550 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i[24333,24346] [2024-10-14 01:52:34,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 01:52:34,565 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 01:52:34,629 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i[24333,24346] [2024-10-14 01:52:34,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 01:52:34,663 INFO L204 MainTranslator]: Completed translation [2024-10-14 01:52:34,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:52:34 WrapperNode [2024-10-14 01:52:34,664 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 01:52:34,665 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 01:52:34,666 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 01:52:34,666 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 01:52:34,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:52:34" (1/1) ... [2024-10-14 01:52:34,691 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:52:34" (1/1) ... [2024-10-14 01:52:34,720 INFO L138 Inliner]: procedures = 127, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 124 [2024-10-14 01:52:34,720 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 01:52:34,721 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 01:52:34,722 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 01:52:34,722 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 01:52:34,732 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:52:34" (1/1) ... [2024-10-14 01:52:34,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:52:34" (1/1) ... [2024-10-14 01:52:34,736 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:52:34" (1/1) ... [2024-10-14 01:52:34,768 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 6, 13]. 62 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 9 writes are split as follows [0, 1, 8]. [2024-10-14 01:52:34,769 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:52:34" (1/1) ... [2024-10-14 01:52:34,769 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:52:34" (1/1) ... [2024-10-14 01:52:34,801 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:52:34" (1/1) ... [2024-10-14 01:52:34,813 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:52:34" (1/1) ... [2024-10-14 01:52:34,815 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:52:34" (1/1) ... [2024-10-14 01:52:34,821 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:52:34" (1/1) ... [2024-10-14 01:52:34,827 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 01:52:34,835 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 01:52:34,835 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 01:52:34,836 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 01:52:34,837 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:52:34" (1/1) ... [2024-10-14 01:52:34,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 01:52:34,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:52:34,888 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) [2024-10-14 01:52:34,891 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 [2024-10-14 01:52:34,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 01:52:34,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 01:52:34,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 01:52:34,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 01:52:34,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 01:52:34,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 01:52:34,934 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-14 01:52:34,934 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-14 01:52:34,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 01:52:34,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 01:52:34,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 01:52:34,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 01:52:34,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 01:52:34,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 01:52:34,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 01:52:34,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 01:52:34,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 01:52:34,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 01:52:34,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-14 01:52:34,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-14 01:52:34,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-14 01:52:34,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 01:52:34,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 01:52:34,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 01:52:34,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 01:52:34,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 01:52:35,057 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 01:52:35,059 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 01:52:35,242 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-10-14 01:52:35,242 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 01:52:35,289 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 01:52:35,289 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-14 01:52:35,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:52:35 BoogieIcfgContainer [2024-10-14 01:52:35,290 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 01:52:35,291 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 01:52:35,291 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 01:52:35,294 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 01:52:35,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:52:34" (1/3) ... [2024-10-14 01:52:35,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6540d755 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:52:35, skipping insertion in model container [2024-10-14 01:52:35,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:52:34" (2/3) ... [2024-10-14 01:52:35,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6540d755 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:52:35, skipping insertion in model container [2024-10-14 01:52:35,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:52:35" (3/3) ... [2024-10-14 01:52:35,297 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal.i [2024-10-14 01:52:35,314 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 01:52:35,314 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 01:52:35,359 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 01:52:35,369 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2e18f2ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 01:52:35,369 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 01:52:35,374 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 23 states have internal predecessors, (36), 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) [2024-10-14 01:52:35,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 01:52:35,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:52:35,382 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:52:35,382 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:52:35,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:52:35,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1765087503, now seen corresponding path program 1 times [2024-10-14 01:52:35,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:52:35,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965348294] [2024-10-14 01:52:35,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:52:35,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:52:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:35,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 01:52:35,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:35,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:52:35,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:52:35,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965348294] [2024-10-14 01:52:35,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965348294] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:52:35,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:52:35,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 01:52:35,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565503478] [2024-10-14 01:52:35,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:52:35,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 01:52:35,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:52:35,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 01:52:35,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 01:52:35,742 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 23 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 01:52:35,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:52:35,802 INFO L93 Difference]: Finished difference Result 48 states and 70 transitions. [2024-10-14 01:52:35,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 01:52:35,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-10-14 01:52:35,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:52:35,811 INFO L225 Difference]: With dead ends: 48 [2024-10-14 01:52:35,811 INFO L226 Difference]: Without dead ends: 22 [2024-10-14 01:52:35,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 01:52:35,817 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:52:35,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:52:35,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-14 01:52:35,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-14 01:52:35,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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) [2024-10-14 01:52:35,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2024-10-14 01:52:35,858 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 13 [2024-10-14 01:52:35,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:52:35,859 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-10-14 01:52:35,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 01:52:35,859 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2024-10-14 01:52:35,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 01:52:35,860 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:52:35,860 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:52:35,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 01:52:35,861 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:52:35,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:52:35,862 INFO L85 PathProgramCache]: Analyzing trace with hash 851795797, now seen corresponding path program 1 times [2024-10-14 01:52:35,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:52:35,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204187720] [2024-10-14 01:52:35,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:52:35,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:52:35,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:36,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 01:52:36,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:36,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:52:36,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:52:36,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204187720] [2024-10-14 01:52:36,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204187720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:52:36,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:52:36,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 01:52:36,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970620838] [2024-10-14 01:52:36,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:52:36,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 01:52:36,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:52:36,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 01:52:36,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 01:52:36,047 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 01:52:36,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:52:36,104 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2024-10-14 01:52:36,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 01:52:36,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-10-14 01:52:36,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:52:36,106 INFO L225 Difference]: With dead ends: 43 [2024-10-14 01:52:36,107 INFO L226 Difference]: Without dead ends: 27 [2024-10-14 01:52:36,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 01:52:36,108 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:52:36,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 56 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:52:36,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-14 01:52:36,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2024-10-14 01:52:36,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 01:52:36,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2024-10-14 01:52:36,120 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 13 [2024-10-14 01:52:36,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:52:36,121 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2024-10-14 01:52:36,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 01:52:36,121 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2024-10-14 01:52:36,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 01:52:36,122 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:52:36,122 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:52:36,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 01:52:36,123 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:52:36,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:52:36,124 INFO L85 PathProgramCache]: Analyzing trace with hash -853542195, now seen corresponding path program 1 times [2024-10-14 01:52:36,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:52:36,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979814510] [2024-10-14 01:52:36,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:52:36,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:52:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:36,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 01:52:36,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:36,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 01:52:36,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:36,320 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 01:52:36,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:52:36,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979814510] [2024-10-14 01:52:36,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979814510] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:52:36,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:52:36,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 01:52:36,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814483125] [2024-10-14 01:52:36,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:52:36,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 01:52:36,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:52:36,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 01:52:36,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 01:52:36,328 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 01:52:36,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:52:36,389 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2024-10-14 01:52:36,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 01:52:36,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2024-10-14 01:52:36,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:52:36,391 INFO L225 Difference]: With dead ends: 47 [2024-10-14 01:52:36,391 INFO L226 Difference]: Without dead ends: 26 [2024-10-14 01:52:36,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 01:52:36,392 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:52:36,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:52:36,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-14 01:52:36,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-14 01:52:36,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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) [2024-10-14 01:52:36,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-10-14 01:52:36,404 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 21 [2024-10-14 01:52:36,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:52:36,404 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-10-14 01:52:36,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 01:52:36,405 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-10-14 01:52:36,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 01:52:36,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:52:36,405 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:52:36,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 01:52:36,406 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:52:36,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:52:36,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1864659445, now seen corresponding path program 1 times [2024-10-14 01:52:36,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:52:36,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5048466] [2024-10-14 01:52:36,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:52:36,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:52:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:36,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 01:52:36,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:36,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 01:52:36,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:36,603 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 01:52:36,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:52:36,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5048466] [2024-10-14 01:52:36,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5048466] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:52:36,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993005944] [2024-10-14 01:52:36,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:52:36,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:52:36,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:52:36,609 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) [2024-10-14 01:52:36,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 01:52:36,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:36,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 01:52:36,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:52:36,838 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:52:36,839 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:52:36,895 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 01:52:36,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993005944] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:52:36,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:52:36,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2024-10-14 01:52:36,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290183640] [2024-10-14 01:52:36,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:52:36,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 01:52:36,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:52:36,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 01:52:36,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 01:52:36,899 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 01:52:36,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:52:36,966 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2024-10-14 01:52:36,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 01:52:36,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 21 [2024-10-14 01:52:36,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:52:36,969 INFO L225 Difference]: With dead ends: 44 [2024-10-14 01:52:36,969 INFO L226 Difference]: Without dead ends: 28 [2024-10-14 01:52:36,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 01:52:36,970 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:52:36,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 55 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:52:36,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-14 01:52:36,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-14 01:52:36,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 01:52:36,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-10-14 01:52:36,978 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 21 [2024-10-14 01:52:36,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:52:36,979 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-10-14 01:52:36,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 01:52:36,980 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2024-10-14 01:52:36,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 01:52:36,982 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:52:36,983 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:52:37,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 01:52:37,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:52:37,188 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:52:37,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:52:37,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1775178627, now seen corresponding path program 1 times [2024-10-14 01:52:37,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:52:37,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906809537] [2024-10-14 01:52:37,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:52:37,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:52:37,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:37,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 01:52:37,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:37,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 01:52:37,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:37,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 01:52:37,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:37,585 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 01:52:37,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:52:37,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906809537] [2024-10-14 01:52:37,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906809537] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:52:37,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557223009] [2024-10-14 01:52:37,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:52:37,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:52:37,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:52:37,588 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) [2024-10-14 01:52:37,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 01:52:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:37,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-14 01:52:37,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:52:37,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 01:52:37,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-14 01:52:37,927 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 01:52:37,928 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 01:52:37,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557223009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:52:37,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 01:52:37,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 15 [2024-10-14 01:52:37,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240207515] [2024-10-14 01:52:37,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:52:37,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 01:52:37,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:52:37,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 01:52:37,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-14 01:52:37,930 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 01:52:38,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:52:38,018 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2024-10-14 01:52:38,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 01:52:38,019 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2024-10-14 01:52:38,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:52:38,020 INFO L225 Difference]: With dead ends: 41 [2024-10-14 01:52:38,020 INFO L226 Difference]: Without dead ends: 38 [2024-10-14 01:52:38,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-10-14 01:52:38,021 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 14 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:52:38,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 129 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:52:38,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-14 01:52:38,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2024-10-14 01:52:38,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 01:52:38,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-10-14 01:52:38,032 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 29 [2024-10-14 01:52:38,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:52:38,032 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-10-14 01:52:38,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 01:52:38,033 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-10-14 01:52:38,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 01:52:38,034 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:52:38,034 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:52:38,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 01:52:38,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:52:38,235 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:52:38,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:52:38,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1775180301, now seen corresponding path program 1 times [2024-10-14 01:52:38,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:52:38,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571515262] [2024-10-14 01:52:38,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:52:38,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:52:38,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:38,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 01:52:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:38,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 01:52:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:38,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 01:52:38,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:38,555 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 01:52:38,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:52:38,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571515262] [2024-10-14 01:52:38,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571515262] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:52:38,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657826877] [2024-10-14 01:52:38,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:52:38,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:52:38,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:52:38,559 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) [2024-10-14 01:52:38,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 01:52:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:38,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-14 01:52:38,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:52:38,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 01:52:38,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 01:52:38,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 01:52:39,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 01:52:39,060 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 01:52:39,060 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 01:52:39,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657826877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:52:39,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 01:52:39,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2024-10-14 01:52:39,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056717456] [2024-10-14 01:52:39,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:52:39,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 01:52:39,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:52:39,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 01:52:39,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2024-10-14 01:52:39,062 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 11 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 01:52:39,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:52:39,267 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2024-10-14 01:52:39,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 01:52:39,267 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2024-10-14 01:52:39,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:52:39,268 INFO L225 Difference]: With dead ends: 40 [2024-10-14 01:52:39,268 INFO L226 Difference]: Without dead ends: 38 [2024-10-14 01:52:39,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2024-10-14 01:52:39,269 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 21 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:52:39,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 112 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:52:39,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-14 01:52:39,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2024-10-14 01:52:39,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 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) [2024-10-14 01:52:39,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2024-10-14 01:52:39,282 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 29 [2024-10-14 01:52:39,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:52:39,282 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-10-14 01:52:39,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 01:52:39,283 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2024-10-14 01:52:39,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 01:52:39,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:52:39,283 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:52:39,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 01:52:39,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:52:39,484 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:52:39,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:52:39,485 INFO L85 PathProgramCache]: Analyzing trace with hash 846285726, now seen corresponding path program 1 times [2024-10-14 01:52:39,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:52:39,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272264613] [2024-10-14 01:52:39,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:52:39,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:52:39,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:39,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 01:52:39,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:39,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 01:52:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:39,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 01:52:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:39,821 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 01:52:39,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:52:39,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272264613] [2024-10-14 01:52:39,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272264613] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:52:39,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925711179] [2024-10-14 01:52:39,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:52:39,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:52:39,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:52:39,827 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) [2024-10-14 01:52:39,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 01:52:40,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:40,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-14 01:52:40,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:52:40,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-14 01:52:40,117 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 01:52:40,117 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:52:40,155 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 01:52:40,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925711179] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:52:40,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:52:40,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 13 [2024-10-14 01:52:40,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763084862] [2024-10-14 01:52:40,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:52:40,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 01:52:40,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:52:40,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 01:52:40,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-14 01:52:40,158 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 01:52:44,175 WARN L539 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] [2024-10-14 01:52:48,194 WARN L539 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] [2024-10-14 01:52:52,208 WARN L539 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] [2024-10-14 01:52:56,233 WARN L539 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] [2024-10-14 01:53:00,270 WARN L539 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] [2024-10-14 01:53:04,288 WARN L539 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] [2024-10-14 01:53:04,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:53:04,420 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2024-10-14 01:53:04,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 01:53:04,421 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 3 states have call successors, (5), 3 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 31 [2024-10-14 01:53:04,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:53:04,421 INFO L225 Difference]: With dead ends: 55 [2024-10-14 01:53:04,421 INFO L226 Difference]: Without dead ends: 31 [2024-10-14 01:53:04,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-10-14 01:53:04,422 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 17 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.2s IncrementalHoareTripleChecker+Time [2024-10-14 01:53:04,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 181 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 6 Unknown, 0 Unchecked, 24.2s Time] [2024-10-14 01:53:04,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-14 01:53:04,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-14 01:53:04,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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) [2024-10-14 01:53:04,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-10-14 01:53:04,434 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 31 [2024-10-14 01:53:04,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:53:04,436 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-10-14 01:53:04,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 01:53:04,437 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-10-14 01:53:04,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-14 01:53:04,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:53:04,438 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:53:04,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 01:53:04,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:53:04,638 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:53:04,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:53:04,639 INFO L85 PathProgramCache]: Analyzing trace with hash -2018592169, now seen corresponding path program 1 times [2024-10-14 01:53:04,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:53:04,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185632723] [2024-10-14 01:53:04,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:53:04,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:53:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:04,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 01:53:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:04,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 01:53:04,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:04,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 01:53:04,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:05,009 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 01:53:05,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:53:05,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185632723] [2024-10-14 01:53:05,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185632723] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:53:05,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785479135] [2024-10-14 01:53:05,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:53:05,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:53:05,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:53:05,013 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 01:53:05,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 01:53:05,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:05,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 01:53:05,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:53:05,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-14 01:53:05,270 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 01:53:05,270 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:53:05,315 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 01:53:05,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785479135] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:53:05,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:53:05,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 11 [2024-10-14 01:53:05,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255727882] [2024-10-14 01:53:05,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:53:05,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 01:53:05,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:53:05,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 01:53:05,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-14 01:53:05,317 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 01:53:09,331 WARN L539 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] [2024-10-14 01:53:13,338 WARN L539 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] [2024-10-14 01:53:17,351 WARN L539 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] [2024-10-14 01:53:21,360 WARN L539 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] [2024-10-14 01:53:25,384 WARN L539 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] [2024-10-14 01:53:29,400 WARN L539 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] [2024-10-14 01:53:29,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:53:29,497 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2024-10-14 01:53:29,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 01:53:29,497 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2024-10-14 01:53:29,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:53:29,498 INFO L225 Difference]: With dead ends: 38 [2024-10-14 01:53:29,498 INFO L226 Difference]: Without dead ends: 35 [2024-10-14 01:53:29,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-10-14 01:53:29,499 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 18 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:53:29,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 138 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 6 Unknown, 0 Unchecked, 24.1s Time] [2024-10-14 01:53:29,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-14 01:53:29,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2024-10-14 01:53:29,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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) [2024-10-14 01:53:29,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-10-14 01:53:29,505 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 32 [2024-10-14 01:53:29,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:53:29,505 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-10-14 01:53:29,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 01:53:29,505 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-10-14 01:53:29,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-14 01:53:29,506 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:53:29,506 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:53:29,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-14 01:53:29,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:53:29,707 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:53:29,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:53:29,708 INFO L85 PathProgramCache]: Analyzing trace with hash -2018590495, now seen corresponding path program 1 times [2024-10-14 01:53:29,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:53:29,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686675438] [2024-10-14 01:53:29,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:53:29,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:53:29,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:30,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 01:53:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:30,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 01:53:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:31,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 01:53:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:31,207 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 01:53:31,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:53:31,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686675438] [2024-10-14 01:53:31,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686675438] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:53:31,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290817753] [2024-10-14 01:53:31,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:53:31,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:53:31,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:53:31,210 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 01:53:31,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 01:53:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:31,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 100 conjuncts are in the unsatisfiable core [2024-10-14 01:53:31,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:53:31,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 01:53:31,783 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-14 01:53:31,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-14 01:53:31,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-10-14 01:53:31,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-14 01:53:32,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 01:53:32,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-10-14 01:53:32,422 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-10-14 01:53:32,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-10-14 01:53:32,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-14 01:53:32,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2024-10-14 01:53:32,740 INFO L349 Elim1Store]: treesize reduction 49, result has 2.0 percent of original size [2024-10-14 01:53:32,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 1 [2024-10-14 01:53:32,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 01:53:32,891 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:53:32,891 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:53:32,915 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1427 (Array Int Int)) (|ULTIMATE.start_dll_append_~last~0#1.base| Int) (v_ArrVal_1429 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1429) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1427) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (store (select |c_#memory_int#2| |ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 (select v_ArrVal_1429 .cse0))) v_ArrVal_1429)))) is different from false [2024-10-14 01:53:32,950 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1427 (Array Int Int)) (|ULTIMATE.start_dll_append_~last~0#1.base| Int) (v_ArrVal_1429 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1429) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1427) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= v_ArrVal_1429 (let ((.cse0 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (store (select |c_#memory_int#2| |ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 (select v_ArrVal_1429 .cse0))))))) is different from false [2024-10-14 01:53:32,969 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1427 (Array Int Int)) (|ULTIMATE.start_dll_append_~last~0#1.base| Int) (v_ArrVal_1429 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1429) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1427) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= v_ArrVal_1429 (let ((.cse0 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (store (select |c_#memory_int#2| |ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 (select v_ArrVal_1429 .cse0))))))) is different from false [2024-10-14 01:53:33,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290817753] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:53:33,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 01:53:33,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 45 [2024-10-14 01:53:33,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439272102] [2024-10-14 01:53:33,119 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 01:53:33,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-10-14 01:53:33,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:53:33,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-10-14 01:53:33,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1926, Unknown=3, NotChecked=270, Total=2352 [2024-10-14 01:53:33,121 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 45 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 35 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 01:53:34,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:53:34,171 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2024-10-14 01:53:34,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-14 01:53:34,171 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 35 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 32 [2024-10-14 01:53:34,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:53:34,172 INFO L225 Difference]: With dead ends: 48 [2024-10-14 01:53:34,172 INFO L226 Difference]: Without dead ends: 46 [2024-10-14 01:53:34,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=284, Invalid=3385, Unknown=3, NotChecked=360, Total=4032 [2024-10-14 01:53:34,174 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 35 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 01:53:34,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 277 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 01:53:34,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-14 01:53:34,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38. [2024-10-14 01:53:34,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 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) [2024-10-14 01:53:34,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-10-14 01:53:34,181 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 32 [2024-10-14 01:53:34,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:53:34,181 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-10-14 01:53:34,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 35 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 01:53:34,182 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-10-14 01:53:34,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 01:53:34,182 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:53:34,182 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:53:34,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 01:53:34,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:53:34,383 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:53:34,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:53:34,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1459785074, now seen corresponding path program 1 times [2024-10-14 01:53:34,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:53:34,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187520524] [2024-10-14 01:53:34,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:53:34,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:53:34,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:35,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 01:53:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:35,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 01:53:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:35,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 01:53:35,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:35,622 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 01:53:35,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:53:35,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187520524] [2024-10-14 01:53:35,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187520524] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:53:35,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083707006] [2024-10-14 01:53:35,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:53:35,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:53:35,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:53:35,625 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 01:53:35,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-14 01:53:35,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:35,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-10-14 01:53:35,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:53:35,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 01:53:36,092 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-14 01:53:36,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-14 01:53:36,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-14 01:53:36,176 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-14 01:53:36,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 49 [2024-10-14 01:53:36,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 18 [2024-10-14 01:53:36,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 01:53:36,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:53:36,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 51 [2024-10-14 01:53:36,429 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-10-14 01:53:36,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2024-10-14 01:53:36,687 INFO L349 Elim1Store]: treesize reduction 71, result has 19.3 percent of original size [2024-10-14 01:53:36,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 54 [2024-10-14 01:53:36,705 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2024-10-14 01:53:36,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 93 [2024-10-14 01:53:36,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2024-10-14 01:53:36,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2024-10-14 01:53:36,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-10-14 01:53:36,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2024-10-14 01:53:36,820 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:53:36,820 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:53:37,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083707006] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:53:37,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 01:53:37,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25] total 42 [2024-10-14 01:53:37,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055290029] [2024-10-14 01:53:37,332 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 01:53:37,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-10-14 01:53:37,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:53:37,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-10-14 01:53:37,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=2211, Unknown=2, NotChecked=0, Total=2352 [2024-10-14 01:53:37,338 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 42 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 34 states have internal predecessors, (52), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-14 01:53:38,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:53:38,655 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2024-10-14 01:53:38,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-14 01:53:38,656 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 34 states have internal predecessors, (52), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 34 [2024-10-14 01:53:38,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:53:38,656 INFO L225 Difference]: With dead ends: 53 [2024-10-14 01:53:38,656 INFO L226 Difference]: Without dead ends: 44 [2024-10-14 01:53:38,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=337, Invalid=4491, Unknown=2, NotChecked=0, Total=4830 [2024-10-14 01:53:38,659 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 36 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 01:53:38,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 352 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 01:53:38,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-14 01:53:38,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2024-10-14 01:53:38,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 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) [2024-10-14 01:53:38,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2024-10-14 01:53:38,667 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 34 [2024-10-14 01:53:38,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:53:38,667 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2024-10-14 01:53:38,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 34 states have internal predecessors, (52), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-14 01:53:38,667 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2024-10-14 01:53:38,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 01:53:38,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:53:38,668 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:53:38,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-14 01:53:38,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:53:38,869 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:53:38,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:53:38,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1013232572, now seen corresponding path program 1 times [2024-10-14 01:53:38,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:53:38,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827918661] [2024-10-14 01:53:38,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:53:38,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:53:38,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:39,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 01:53:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:40,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 01:53:40,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:40,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 01:53:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:40,333 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 01:53:40,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:53:40,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827918661] [2024-10-14 01:53:40,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827918661] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:53:40,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804382534] [2024-10-14 01:53:40,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:53:40,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:53:40,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:53:40,335 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 01:53:40,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-14 01:53:40,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:40,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 97 conjuncts are in the unsatisfiable core [2024-10-14 01:53:40,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:53:40,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 01:53:40,917 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-14 01:53:40,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-14 01:53:40,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 01:53:40,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-10-14 01:53:41,050 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 01:53:41,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-10-14 01:53:41,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-10-14 01:53:41,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-10-14 01:53:41,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-10-14 01:53:41,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 01:53:41,439 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-14 01:53:41,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-10-14 01:53:41,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:53:41,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2024-10-14 01:53:41,479 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-14 01:53:41,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-10-14 01:53:41,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2024-10-14 01:53:41,956 INFO L378 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 25 treesize of output 15 [2024-10-14 01:53:42,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 01:53:42,089 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:53:42,089 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:53:42,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804382534] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:53:42,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 01:53:42,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 47 [2024-10-14 01:53:42,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901560989] [2024-10-14 01:53:42,620 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 01:53:42,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-10-14 01:53:42,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:53:42,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-10-14 01:53:42,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=2406, Unknown=77, NotChecked=0, Total=2652 [2024-10-14 01:53:42,622 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 47 states, 40 states have (on average 1.35) internal successors, (54), 37 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 01:53:44,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:53:44,053 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2024-10-14 01:53:44,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-14 01:53:44,054 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 40 states have (on average 1.35) internal successors, (54), 37 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2024-10-14 01:53:44,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:53:44,055 INFO L225 Difference]: With dead ends: 53 [2024-10-14 01:53:44,055 INFO L226 Difference]: Without dead ends: 51 [2024-10-14 01:53:44,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1057 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=307, Invalid=4037, Unknown=78, NotChecked=0, Total=4422 [2024-10-14 01:53:44,057 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 22 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 01:53:44,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 325 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 01:53:44,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-14 01:53:44,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 42. [2024-10-14 01:53:44,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 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) [2024-10-14 01:53:44,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2024-10-14 01:53:44,066 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 34 [2024-10-14 01:53:44,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:53:44,066 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2024-10-14 01:53:44,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 40 states have (on average 1.35) internal successors, (54), 37 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 01:53:44,067 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2024-10-14 01:53:44,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-14 01:53:44,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:53:44,067 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:53:44,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-14 01:53:44,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-14 01:53:44,268 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:53:44,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:53:44,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1241039849, now seen corresponding path program 1 times [2024-10-14 01:53:44,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:53:44,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068110597] [2024-10-14 01:53:44,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:53:44,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:53:44,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:46,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 01:53:46,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:46,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 01:53:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:46,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 01:53:46,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:46,867 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 01:53:46,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:53:46,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068110597] [2024-10-14 01:53:46,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068110597] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:53:46,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433405193] [2024-10-14 01:53:46,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:53:46,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:53:46,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:53:46,869 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 01:53:46,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-14 01:53:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:47,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 151 conjuncts are in the unsatisfiable core [2024-10-14 01:53:47,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:53:47,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 01:53:47,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-10-14 01:53:51,628 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (exists ((|v_#memory_int#2_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#2_BEFORE_CALL_6| |c_#memory_int#2|))) (and (= (select (select |v_#memory_int#2_BEFORE_CALL_6| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= (store |v_#memory_int#2_BEFORE_CALL_6| .cse1 (select |c_#memory_int#2| .cse1)) |c_#memory_int#2|) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| .cse1)))))) is different from false [2024-10-14 01:53:51,632 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (exists ((|v_#memory_int#2_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#2_BEFORE_CALL_6| |c_#memory_int#2|))) (and (= (select (select |v_#memory_int#2_BEFORE_CALL_6| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= (store |v_#memory_int#2_BEFORE_CALL_6| .cse1 (select |c_#memory_int#2| .cse1)) |c_#memory_int#2|) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| .cse1)))))) is different from true [2024-10-14 01:53:51,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 01:53:51,694 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-14 01:53:51,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-10-14 01:53:51,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 01:53:51,717 WARN L851 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (exists ((|v_#memory_int#2_305| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int#2_305| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) |c_#memory_int#2|) (exists ((|v_#memory_int#2_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#2_BEFORE_CALL_6| |v_#memory_int#2_305|))) (and (= (select (select |v_#memory_int#2_BEFORE_CALL_6| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= |v_#memory_int#2_305| (store |v_#memory_int#2_BEFORE_CALL_6| .cse0 (select |v_#memory_int#2_305| .cse0))) (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse1 (select |c_#valid| .cse1))))))) is different from false [2024-10-14 01:53:51,721 WARN L873 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (exists ((|v_#memory_int#2_305| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int#2_305| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) |c_#memory_int#2|) (exists ((|v_#memory_int#2_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#2_BEFORE_CALL_6| |v_#memory_int#2_305|))) (and (= (select (select |v_#memory_int#2_BEFORE_CALL_6| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= |v_#memory_int#2_305| (store |v_#memory_int#2_BEFORE_CALL_6| .cse0 (select |v_#memory_int#2_305| .cse0))) (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse1 (select |c_#valid| .cse1))))))) is different from true [2024-10-14 01:53:51,765 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 01:53:51,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 110 [2024-10-14 01:53:51,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23 [2024-10-14 01:53:51,808 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-10-14 01:53:51,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2024-10-14 01:53:51,818 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse1 (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (or (= (select (select |c_#memory_int#2| .cse0) 0) 1) .cse1) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse0) 1) (= 0 (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse2 (select |c_#valid| .cse2)))))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) .cse1)))) is different from false [2024-10-14 01:53:51,820 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse1 (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (or (= (select (select |c_#memory_int#2| .cse0) 0) 1) .cse1) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse0) 1) (= 0 (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse2 (select |c_#valid| .cse2)))))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) .cse1)))) is different from true [2024-10-14 01:53:51,855 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse1 (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (or (= (select (select |c_#memory_int#2| .cse0) 0) 1) .cse1) (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) .cse1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse2 (select |c_#valid| .cse2))))))))) is different from false [2024-10-14 01:53:51,857 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse1 (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (or (= (select (select |c_#memory_int#2| .cse0) 0) 1) .cse1) (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) .cse1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse2 (select |c_#valid| .cse2))))))))) is different from true [2024-10-14 01:53:51,929 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (let ((.cse1 (= .cse2 .cse0))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (or .cse1 (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse1 (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse3 (select |c_#valid| .cse3)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from false [2024-10-14 01:53:51,931 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (let ((.cse1 (= .cse2 .cse0))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (or .cse1 (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse1 (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse3 (select |c_#valid| .cse3)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from true [2024-10-14 01:53:51,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 40 [2024-10-14 01:53:51,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-14 01:53:51,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 01:53:51,986 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-10-14 01:53:51,988 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-10-14 01:53:52,037 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-10-14 01:53:52,040 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-10-14 01:53:52,075 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#memory_int#2)| |c_node_create_#res#1.base| (select |c_#memory_int#2| |c_node_create_#res#1.base|)) |c_#memory_int#2|) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1))))) is different from false [2024-10-14 01:53:52,077 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#memory_int#2)| |c_node_create_#res#1.base| (select |c_#memory_int#2| |c_node_create_#res#1.base|)) |c_#memory_int#2|) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1))))) is different from true [2024-10-14 01:53:52,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:53:52,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 57 [2024-10-14 01:53:52,143 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2024-10-14 01:53:52,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 47 [2024-10-14 01:53:52,169 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-14 01:53:52,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 39 [2024-10-14 01:53:52,226 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (let ((.cse1 (= .cse2 .cse0))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse0) .cse1 (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_#valid_BEFORE_CALL_16| .cse3)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse1 (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from false [2024-10-14 01:53:52,230 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (let ((.cse1 (= .cse2 .cse0))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse0) .cse1 (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_#valid_BEFORE_CALL_16| .cse3)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse1 (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from true [2024-10-14 01:53:52,317 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (let ((.cse0 (= .cse1 .cse2))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse0 (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_#valid_BEFORE_CALL_16| .cse3)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (or .cse0 (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from false [2024-10-14 01:53:52,321 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (let ((.cse0 (= .cse1 .cse2))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse0 (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_#valid_BEFORE_CALL_16| .cse3)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (or .cse0 (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from true [2024-10-14 01:53:52,405 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (let ((.cse0 (= .cse1 .cse2))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse0 (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_#valid_BEFORE_CALL_16| .cse3)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (or .cse0 (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2024-10-14 01:53:52,410 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (let ((.cse0 (= .cse1 .cse2))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse0 (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_#valid_BEFORE_CALL_16| .cse3)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (or .cse0 (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2024-10-14 01:53:52,573 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (let ((.cse0 (= .cse1 .cse2)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse0 (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_#valid_BEFORE_CALL_16| .cse3)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= .cse6 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (or .cse0 (= .cse6 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2024-10-14 01:53:52,577 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (let ((.cse0 (= .cse1 .cse2)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse0 (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_#valid_BEFORE_CALL_16| .cse3)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= .cse6 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (or .cse0 (= .cse6 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2024-10-14 01:53:52,667 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (let ((.cse0 (= .cse1 .cse2)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse0 (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_#valid_BEFORE_CALL_16| .cse3)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= .cse6 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (or .cse0 (= .cse6 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) |c_ULTIMATE.start_dll_append_#t~mem10#1.offset|))))) is different from false [2024-10-14 01:53:52,671 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (let ((.cse0 (= .cse1 .cse2)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse0 (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_#valid_BEFORE_CALL_16| .cse3)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= .cse6 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (or .cse0 (= .cse6 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) |c_ULTIMATE.start_dll_append_#t~mem10#1.offset|))))) is different from true [2024-10-14 01:53:52,766 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (let ((.cse0 (= .cse1 .cse2)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse0 (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_#valid_BEFORE_CALL_16| .cse3)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) 0) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= .cse6 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (or .cse0 (= .cse6 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2024-10-14 01:53:52,782 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (let ((.cse0 (= .cse1 .cse2)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse0 (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_#valid_BEFORE_CALL_16| .cse3)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) 0) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= .cse6 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (or .cse0 (= .cse6 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2024-10-14 01:53:52,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:53:52,833 INFO L349 Elim1Store]: treesize reduction 56, result has 13.8 percent of original size [2024-10-14 01:53:52,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 216 treesize of output 141 [2024-10-14 01:53:52,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:53:52,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 68 [2024-10-14 01:53:52,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:53:52,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:53:52,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 47 [2024-10-14 01:53:52,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2024-10-14 01:53:52,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2024-10-14 01:53:52,898 INFO L349 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2024-10-14 01:53:52,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 93 [2024-10-14 01:53:52,903 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-10-14 01:53:52,924 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (or (= .cse0 .cse1) (= (select (select |c_#memory_int#2| .cse0) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse1) 1) (= 0 (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|)) (= |v_#valid_BEFORE_CALL_16| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse2 (select |v_#valid_BEFORE_CALL_16| .cse2)))))) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse4 (select |v_#valid_BEFORE_CALL_15| .cse4))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2024-10-14 01:53:52,926 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (or (= .cse0 .cse1) (= (select (select |c_#memory_int#2| .cse0) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse1) 1) (= 0 (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|)) (= |v_#valid_BEFORE_CALL_16| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse2 (select |v_#valid_BEFORE_CALL_16| .cse2)))))) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse4 (select |v_#valid_BEFORE_CALL_15| .cse4))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2024-10-14 01:53:52,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:53:52,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 67 [2024-10-14 01:53:52,991 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 01:53:52,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 01:53:53,000 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= 0 (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|)) (= (select |v_#valid_BEFORE_CALL_17| .cse0) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_int#2| .cse0) 0) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0))) is different from false [2024-10-14 01:53:53,002 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= 0 (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|)) (= (select |v_#valid_BEFORE_CALL_17| .cse0) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_int#2| .cse0) 0) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0))) is different from true [2024-10-14 01:53:53,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2024-10-14 01:53:53,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-14 01:53:53,073 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_24| Int)) (and (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 1) (= (select |v_#valid_BEFORE_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 0) (= 0 (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|)) (= |v_#valid_BEFORE_CALL_16| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse0 (select |v_#valid_BEFORE_CALL_16| .cse0)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 1)) is different from false [2024-10-14 01:53:53,075 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_24| Int)) (and (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 1) (= (select |v_#valid_BEFORE_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 0) (= 0 (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|)) (= |v_#valid_BEFORE_CALL_16| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse0 (select |v_#valid_BEFORE_CALL_16| .cse0)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 1)) is different from true [2024-10-14 01:53:53,124 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2024-10-14 01:53:53,124 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:53:57,210 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2183 Int) (v_ArrVal_2191 (Array Int Int)) (v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2189 (Array Int Int)) (v_ArrVal_2186 (Array Int Int)) (v_ArrVal_2185 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4) v_ArrVal_2183)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2186) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_2189) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2191) .cse0) .cse1)) (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_2185) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2190) .cse0) .cse1))))) is different from false [2024-10-14 01:53:57,829 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| Int) (v_ArrVal_2183 Int) (v_ArrVal_2191 (Array Int Int)) (v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2203 (Array Int Int)) (v_ArrVal_2202 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2189 (Array Int Int)) (v_ArrVal_2186 (Array Int Int)) (v_ArrVal_2185 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| v_ArrVal_2201)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse6 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse2 (+ (select (select .cse0 .cse5) .cse6) 4)) (.cse1 (select (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| v_ArrVal_2202) .cse5) .cse6))) (or (not (= (select (select .cse0 .cse1) .cse2) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int#2| .cse1 (store (select (store |c_#memory_int#2| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| v_ArrVal_2203) .cse1) .cse2 v_ArrVal_2183)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| v_ArrVal_2186) (select (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_2189) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| v_ArrVal_2191) .cse3) .cse4)) (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_2185) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| v_ArrVal_2190) .cse3) .cse4)))))))) is different from false [2024-10-14 01:53:57,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433405193] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:53:57,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 01:53:57,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 29] total 52 [2024-10-14 01:53:57,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103566285] [2024-10-14 01:53:57,833 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 01:53:57,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-14 01:53:57,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:53:57,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-14 01:53:57,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1607, Unknown=37, NotChecked=1862, Total=3660 [2024-10-14 01:53:57,835 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 52 states, 45 states have (on average 1.288888888888889) internal successors, (58), 42 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 01:54:02,366 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (let ((.cse1 (= .cse0 1)) (.cse4 (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0))) (and (= .cse0 |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) .cse1 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse2 (select |c_#valid| .cse2)))))) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_create_~data#1| 1) (or .cse1 (exists ((|v_#memory_int#2_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int#2_BEFORE_CALL_6| |c_#memory_int#2|))) (and (= (select (select |v_#memory_int#2_BEFORE_CALL_6| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= (store |v_#memory_int#2_BEFORE_CALL_6| .cse3 (select |c_#memory_int#2| .cse3)) |c_#memory_int#2|) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| .cse3))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse4) (= .cse4 |c_ULTIMATE.start_dll_create_~data#1|)))) is different from false [2024-10-14 01:54:02,369 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (let ((.cse1 (= .cse0 1)) (.cse4 (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0))) (and (= .cse0 |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) .cse1 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse2 (select |c_#valid| .cse2)))))) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_create_~data#1| 1) (or .cse1 (exists ((|v_#memory_int#2_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int#2_BEFORE_CALL_6| |c_#memory_int#2|))) (and (= (select (select |v_#memory_int#2_BEFORE_CALL_6| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= (store |v_#memory_int#2_BEFORE_CALL_6| .cse3 (select |c_#memory_int#2| .cse3)) |c_#memory_int#2|) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| .cse3))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse4) (= .cse4 |c_ULTIMATE.start_dll_create_~data#1|)))) is different from true [2024-10-14 01:54:02,380 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0)) (.cse1 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (.cse2 (select |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= .cse0 |c_ULTIMATE.start_main_~data~0#1|) (or .cse1 (= .cse0 1) (exists ((|v_#memory_int#2_305| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int#2_305| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2) |c_#memory_int#2|) (exists ((|v_#memory_int#2_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int#2_BEFORE_CALL_6| |v_#memory_int#2_305|))) (and (= (select (select |v_#memory_int#2_BEFORE_CALL_6| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= |v_#memory_int#2_305| (store |v_#memory_int#2_BEFORE_CALL_6| .cse3 (select |v_#memory_int#2_305| .cse3))) (= .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not .cse1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) 0)) (= .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |c_#valid| .cse4) 1) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |c_#valid| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |c_#valid| .cse5)))))) (= (select .cse2 0) 1))) is different from false [2024-10-14 01:54:02,384 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0)) (.cse1 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (.cse2 (select |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= .cse0 |c_ULTIMATE.start_main_~data~0#1|) (or .cse1 (= .cse0 1) (exists ((|v_#memory_int#2_305| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int#2_305| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2) |c_#memory_int#2|) (exists ((|v_#memory_int#2_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int#2_BEFORE_CALL_6| |v_#memory_int#2_305|))) (and (= (select (select |v_#memory_int#2_BEFORE_CALL_6| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= |v_#memory_int#2_305| (store |v_#memory_int#2_BEFORE_CALL_6| .cse3 (select |v_#memory_int#2_305| .cse3))) (= .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not .cse1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) 0)) (= .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |c_#valid| .cse4) 1) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |c_#valid| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |c_#valid| .cse5)))))) (= (select .cse2 0) 1))) is different from true [2024-10-14 01:54:02,388 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_int#2| .cse2) 0)) (.cse4 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (.cse1 (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (or (= .cse0 1) .cse1) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1) (= 0 (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse3 (select |c_#valid| .cse3)))))) .cse4 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse4 .cse1) (not .cse1) (= (select |c_#valid| .cse2) 1)))) is different from false [2024-10-14 01:54:02,391 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_int#2| .cse2) 0)) (.cse4 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (.cse1 (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (or (= .cse0 1) .cse1) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1) (= 0 (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse3 (select |c_#valid| .cse3)))))) .cse4 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse4 .cse1) (not .cse1) (= (select |c_#valid| .cse2) 1)))) is different from true [2024-10-14 01:54:02,395 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse2 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0)) (.cse1 (= .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse0 (select (select |c_#memory_int#2| .cse3) 0))) (and (or (= .cse0 1) .cse1) (or .cse2 .cse1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse3) 1) .cse2 (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse3) 1) (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse4 (select |c_#valid| .cse4))))))))) is different from false [2024-10-14 01:54:02,397 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse2 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0)) (.cse1 (= .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse0 (select (select |c_#memory_int#2| .cse3) 0))) (and (or (= .cse0 1) .cse1) (or .cse2 .cse1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse3) 1) .cse2 (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse3) 1) (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse4 (select |c_#valid| .cse4))))))))) is different from true [2024-10-14 01:54:02,403 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse6 0)) (.cse9 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|))) (let ((.cse3 (select .cse9 |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|)) (.cse4 (= .cse5 .cse2)) (.cse7 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse0 .cse1) (= (select |c_#valid| .cse2) 1) (= (select |c_#valid| .cse3) 1) (or .cse4 (= (select (select |c_#memory_int#2| .cse5) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse3) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse7) 1) (not (= .cse3 .cse7)) (or .cse4 (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0)) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse5) 1) (= |c_#valid| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse8 (select |c_#valid| .cse8)))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse7) 0)) (= .cse9 .cse6) (= (select .cse1 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from false [2024-10-14 01:54:02,406 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse6 0)) (.cse9 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|))) (let ((.cse3 (select .cse9 |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|)) (.cse4 (= .cse5 .cse2)) (.cse7 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse0 .cse1) (= (select |c_#valid| .cse2) 1) (= (select |c_#valid| .cse3) 1) (or .cse4 (= (select (select |c_#memory_int#2| .cse5) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse3) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse7) 1) (not (= .cse3 .cse7)) (or .cse4 (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0)) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse5) 1) (= |c_#valid| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse8 (select |c_#valid| .cse8)))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse7) 0)) (= .cse9 .cse6) (= (select .cse1 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from true [2024-10-14 01:54:02,412 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-10-14 01:54:02,414 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-10-14 01:54:02,418 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-10-14 01:54:02,421 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-10-14 01:54:02,434 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_old(#memory_int#2)| |c_#memory_int#2|))) (let ((.cse12 (store |c_old(#memory_int#2)| .cse4 (select |c_#memory_int#2| .cse4)))) (let ((.cse7 (@diff .cse12 |c_#memory_int#2|))) (let ((.cse10 (store .cse12 .cse7 (select |c_#memory_int#2| .cse7)))) (let ((.cse3 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|)) (.cse0 (select |c_#memory_int#2| |c_node_create_#res#1.base|)) (.cse2 (= .cse12 |c_#memory_int#2|)) (.cse11 (@diff .cse10 |c_#memory_int#2|)) (.cse1 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) (.cse5 (= |c_old(#memory_int#2)| |c_#memory_int#2|))) (and (= |c_node_create_#res#1.offset| 0) (= |c_node_create_#in~data#1| (select .cse0 0)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (or (= .cse1 |c_node_create_#res#1.base|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) .cse2 (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#2.offset)| .cse3 (select |c_#memory_$Pointer$#2.offset| .cse3)) |c_#memory_$Pointer$#2.offset|) (or (= .cse4 |c_node_create_#res#1.base|) .cse5) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (or (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= .cse3 |c_node_create_#res#1.base|)) (= (store |c_old(#memory_int#2)| |c_node_create_#res#1.base| .cse0) |c_#memory_int#2|) (= |c_#valid| (let ((.cse6 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse6 (select |c_#valid| .cse6)))) (or .cse2 (= (select |c_old(#valid)| .cse7) 0)) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse8) 1) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse9 (select |v_#valid_BEFORE_CALL_15| .cse9))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (or (= |c_#memory_int#2| .cse10) (= (select |c_old(#valid)| .cse11) 0)) (= (store .cse10 .cse11 (select |c_#memory_int#2| .cse11)) |c_#memory_int#2|) (= (store |c_old(#memory_$Pointer$#2.base)| .cse1 (select |c_#memory_$Pointer$#2.base| .cse1)) |c_#memory_$Pointer$#2.base|) (or (= (select |c_old(#valid)| .cse4) 0) .cse5))))))) is different from false [2024-10-14 01:54:02,442 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_old(#memory_int#2)| |c_#memory_int#2|))) (let ((.cse12 (store |c_old(#memory_int#2)| .cse4 (select |c_#memory_int#2| .cse4)))) (let ((.cse7 (@diff .cse12 |c_#memory_int#2|))) (let ((.cse10 (store .cse12 .cse7 (select |c_#memory_int#2| .cse7)))) (let ((.cse3 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|)) (.cse0 (select |c_#memory_int#2| |c_node_create_#res#1.base|)) (.cse2 (= .cse12 |c_#memory_int#2|)) (.cse11 (@diff .cse10 |c_#memory_int#2|)) (.cse1 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) (.cse5 (= |c_old(#memory_int#2)| |c_#memory_int#2|))) (and (= |c_node_create_#res#1.offset| 0) (= |c_node_create_#in~data#1| (select .cse0 0)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (or (= .cse1 |c_node_create_#res#1.base|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) .cse2 (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#2.offset)| .cse3 (select |c_#memory_$Pointer$#2.offset| .cse3)) |c_#memory_$Pointer$#2.offset|) (or (= .cse4 |c_node_create_#res#1.base|) .cse5) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (or (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= .cse3 |c_node_create_#res#1.base|)) (= (store |c_old(#memory_int#2)| |c_node_create_#res#1.base| .cse0) |c_#memory_int#2|) (= |c_#valid| (let ((.cse6 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse6 (select |c_#valid| .cse6)))) (or .cse2 (= (select |c_old(#valid)| .cse7) 0)) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse8) 1) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse9 (select |v_#valid_BEFORE_CALL_15| .cse9))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (or (= |c_#memory_int#2| .cse10) (= (select |c_old(#valid)| .cse11) 0)) (= (store .cse10 .cse11 (select |c_#memory_int#2| .cse11)) |c_#memory_int#2|) (= (store |c_old(#memory_$Pointer$#2.base)| .cse1 (select |c_#memory_$Pointer$#2.base| .cse1)) |c_#memory_$Pointer$#2.base|) (or (= (select |c_old(#valid)| .cse4) 0) .cse5))))))) is different from true [2024-10-14 01:54:02,452 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse7 0)) (.cse9 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|))) (let ((.cse2 (select .cse9 |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|)) (.cse4 (= .cse5 .cse3)) (.cse8 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse0 .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse3) .cse4 (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse3) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse6 (select |v_#valid_BEFORE_CALL_16| .cse6)))))) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse2) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse8)) (or .cse4 (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse5) (= (select (select |c_#memory_int#2| .cse5) 0) 1)) (not (= .cse2 .cse8)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse8) 0)) (= .cse9 .cse7) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse10) 1) (= (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse11 (select |v_#valid_BEFORE_CALL_15| .cse11))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse10) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= (select .cse1 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2)) (= (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from false [2024-10-14 01:54:02,455 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse7 0)) (.cse9 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|))) (let ((.cse2 (select .cse9 |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|)) (.cse4 (= .cse5 .cse3)) (.cse8 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse0 .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse3) .cse4 (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse3) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse6 (select |v_#valid_BEFORE_CALL_16| .cse6)))))) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse2) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse8)) (or .cse4 (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse5) (= (select (select |c_#memory_int#2| .cse5) 0) 1)) (not (= .cse2 .cse8)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse8) 0)) (= .cse9 .cse7) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse10) 1) (= (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse11 (select |v_#valid_BEFORE_CALL_15| .cse11))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse10) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= (select .cse1 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2)) (= (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from true [2024-10-14 01:54:02,466 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|)) (.cse5 (select .cse7 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse5) 4)) (.cse2 (select .cse9 |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|)) (.cse8 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse3 (= .cse4 .cse5)) (.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse0 .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (or .cse3 (= .cse4 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse4) 0) 1)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse5) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse6 (select |v_#valid_BEFORE_CALL_16| .cse6)))))) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse2) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse2 .cse8)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse8)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse8) 0)) (= .cse9 .cse7) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse10) 1) (= (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse11 (select |v_#valid_BEFORE_CALL_15| .cse11))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse10) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (or .cse3 (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse5)) (= (select .cse1 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from false [2024-10-14 01:54:02,470 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|)) (.cse5 (select .cse7 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse5) 4)) (.cse2 (select .cse9 |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|)) (.cse8 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse3 (= .cse4 .cse5)) (.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse0 .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (or .cse3 (= .cse4 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse4) 0) 1)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse5) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse6 (select |v_#valid_BEFORE_CALL_16| .cse6)))))) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse2) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse2 .cse8)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse8)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse8) 0)) (= .cse9 .cse7) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse10) 1) (= (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse11 (select |v_#valid_BEFORE_CALL_15| .cse11))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse10) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (or .cse3 (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse5)) (= (select .cse1 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from true [2024-10-14 01:54:02,475 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse5 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (let ((.cse1 (= .cse2 .cse3)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse0)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse1 (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse3) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse4 (select |v_#valid_BEFORE_CALL_16| .cse4)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse0) 0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse7 (select |v_#valid_BEFORE_CALL_15| .cse7))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (or .cse1 (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0)) (= (select .cse8 0) 0) (= 0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from false [2024-10-14 01:54:02,478 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse5 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (let ((.cse1 (= .cse2 .cse3)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse0)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse1 (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse3) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse4 (select |v_#valid_BEFORE_CALL_16| .cse4)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse0) 0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse7 (select |v_#valid_BEFORE_CALL_15| .cse7))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (or .cse1 (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0)) (= (select .cse8 0) 0) (= 0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from true [2024-10-14 01:54:02,486 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse5 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (let ((.cse1 (= .cse2 .cse3)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse0)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse1 (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse3) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse4 (select |v_#valid_BEFORE_CALL_16| .cse4)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse0) 0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse7 (select |v_#valid_BEFORE_CALL_15| .cse7))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (or .cse1 (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0)) (= (select .cse8 0) 0) (= |c_ULTIMATE.start_dll_append_#t~mem10#1.offset| 0) (= 0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from false [2024-10-14 01:54:02,489 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse5 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (let ((.cse1 (= .cse2 .cse3)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse0)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse1 (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse3) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse4 (select |v_#valid_BEFORE_CALL_16| .cse4)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse0) 0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse7 (select |v_#valid_BEFORE_CALL_15| .cse7))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (or .cse1 (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0)) (= (select .cse8 0) 0) (= |c_ULTIMATE.start_dll_append_#t~mem10#1.offset| 0) (= 0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from true [2024-10-14 01:54:02,497 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse10 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse5 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4)) (.cse1 (= .cse2 .cse3)) (.cse8 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4)) (.cse9 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0)) (or .cse1 (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse3) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse4 (select |v_#valid_BEFORE_CALL_16| .cse4)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse5)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse5) 4)) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse7 (select |v_#valid_BEFORE_CALL_15| .cse7))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (not (= .cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (= .cse8 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (or .cse1 (= .cse8 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (not (= .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select .cse9 0) 0) (= (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from false [2024-10-14 01:54:02,500 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse10 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse5 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4)) (.cse1 (= .cse2 .cse3)) (.cse8 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4)) (.cse9 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0)) (or .cse1 (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse3) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse4 (select |v_#valid_BEFORE_CALL_16| .cse4)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse5)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse5) 4)) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse7 (select |v_#valid_BEFORE_CALL_15| .cse7))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (not (= .cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (= .cse8 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (or .cse1 (= .cse8 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (not (= .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select .cse9 0) 0) (= (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from true [2024-10-14 01:54:02,510 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse11 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse5 (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4)) (.cse1 (= .cse2 .cse3)) (.cse9 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4)) (.cse8 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) (.cse10 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0)) (or .cse1 (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse3) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse4 (select |v_#valid_BEFORE_CALL_16| .cse4)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse5)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse5) 4)) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse7 (select |v_#valid_BEFORE_CALL_15| .cse7))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (not (= .cse0 .cse8)) (= .cse9 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (or .cse1 (= .cse9 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (not (= .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select .cse10 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse8) |c_ULTIMATE.start_dll_append_#t~mem10#1.offset|) (= (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from false [2024-10-14 01:54:02,513 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse11 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse5 (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4)) (.cse1 (= .cse2 .cse3)) (.cse9 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4)) (.cse8 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) (.cse10 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0)) (or .cse1 (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse3) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse4 (select |v_#valid_BEFORE_CALL_16| .cse4)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse5)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse5) 4)) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse7 (select |v_#valid_BEFORE_CALL_15| .cse7))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (not (= .cse0 .cse8)) (= .cse9 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (or .cse1 (= .cse9 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (not (= .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select .cse10 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse8) |c_ULTIMATE.start_dll_append_#t~mem10#1.offset|) (= (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from true [2024-10-14 01:54:02,522 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse11 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse6 (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| .cse6) 4)) (.cse5 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) (.cse1 (= .cse2 .cse3)) (.cse9 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4)) (.cse10 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0)) (or .cse1 (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse3) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse4 (select |v_#valid_BEFORE_CALL_16| .cse4)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse5) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse6)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse6) 4)) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse7) 1) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse8 (select |v_#valid_BEFORE_CALL_15| .cse8))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (not (= .cse0 .cse5)) (= .cse9 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (or .cse1 (= .cse9 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (not (= .cse6 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select .cse10 0) 0) (= (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from false [2024-10-14 01:54:02,525 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse11 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse6 (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| .cse6) 4)) (.cse5 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) (.cse1 (= .cse2 .cse3)) (.cse9 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4)) (.cse10 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0)) (or .cse1 (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse3) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse4 (select |v_#valid_BEFORE_CALL_16| .cse4)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse5) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse6)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse6) 4)) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse7) 1) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse8 (select |v_#valid_BEFORE_CALL_15| .cse8))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (not (= .cse0 .cse5)) (= .cse9 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (or .cse1 (= .cse9 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (not (= .cse6 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select .cse10 0) 0) (= (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from true [2024-10-14 01:54:02,538 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse1 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select |c_#memory_int#2| (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4)))) (or (= .cse2 .cse3) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse3) 1) (= 0 (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|)) (= |v_#valid_BEFORE_CALL_16| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse4 (select |v_#valid_BEFORE_CALL_16| .cse4)))))) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= (select .cse7 0) 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2024-10-14 01:54:02,542 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse1 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select |c_#memory_int#2| (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4)))) (or (= .cse2 .cse3) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse3) 1) (= 0 (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|)) (= |v_#valid_BEFORE_CALL_16| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse4 (select |v_#valid_BEFORE_CALL_16| .cse4)))))) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= (select .cse7 0) 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2024-10-14 01:54:02,555 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse0 (select |c_#memory_int#2| .cse2)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 .cse1)) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= 0 (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|)) (= (select |v_#valid_BEFORE_CALL_17| .cse2) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_#valid_BEFORE_CALL_16| .cse3)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select .cse0 0) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2)) (= .cse1 0)))) is different from false [2024-10-14 01:54:02,558 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse0 (select |c_#memory_int#2| .cse2)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 .cse1)) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= 0 (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|)) (= (select |v_#valid_BEFORE_CALL_17| .cse2) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_#valid_BEFORE_CALL_16| .cse3)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select .cse0 0) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2)) (= .cse1 0)))) is different from true [2024-10-14 01:54:02,595 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_24| Int)) (and (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 1) (= (select |v_#valid_BEFORE_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 0) (= 0 (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|)) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse0 0) 1))) is different from false [2024-10-14 01:54:02,598 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_24| Int)) (and (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 1) (= (select |v_#valid_BEFORE_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 0) (= 0 (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|)) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse0 0) 1))) is different from true [2024-10-14 01:54:02,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:54:02,685 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2024-10-14 01:54:02,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-14 01:54:02,685 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 45 states have (on average 1.288888888888889) internal successors, (58), 42 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 36 [2024-10-14 01:54:02,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:54:02,686 INFO L225 Difference]: With dead ends: 66 [2024-10-14 01:54:02,686 INFO L226 Difference]: Without dead ends: 64 [2024-10-14 01:54:02,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 37 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=220, Invalid=2017, Unknown=73, NotChecked=4662, Total=6972 [2024-10-14 01:54:02,688 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 1973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1685 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 01:54:02,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 276 Invalid, 1973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 285 Invalid, 0 Unknown, 1685 Unchecked, 0.3s Time] [2024-10-14 01:54:02,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-14 01:54:02,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-14 01:54:02,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 55 states have internal predecessors, (63), 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) [2024-10-14 01:54:02,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2024-10-14 01:54:02,701 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 36 [2024-10-14 01:54:02,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:54:02,701 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2024-10-14 01:54:02,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 45 states have (on average 1.288888888888889) internal successors, (58), 42 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 01:54:02,701 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2024-10-14 01:54:02,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-14 01:54:02,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:54:02,702 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:54:02,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-14 01:54:02,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:54:02,903 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:54:02,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:54:02,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1687594025, now seen corresponding path program 2 times [2024-10-14 01:54:02,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:54:02,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868538081] [2024-10-14 01:54:02,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:54:02,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:54:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat