./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:40:16,797 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:40:16,892 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-14 03:40:16,899 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:40:16,899 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:40:16,928 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:40:16,929 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:40:16,929 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:40:16,929 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:40:16,930 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:40:16,930 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:40:16,930 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:40:16,930 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:40:16,930 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 03:40:16,930 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:40:16,930 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:40:16,930 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 03:40:16,931 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 03:40:16,931 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:40:16,931 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 03:40:16,931 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 03:40:16,931 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 03:40:16,932 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:40:16,932 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 03:40:16,932 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:40:16,932 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:40:16,932 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:40:16,932 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:40:16,932 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 03:40:16,932 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:40:16,932 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 03:40:16,932 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:40:16,932 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:40:16,933 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 03:40:16,933 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:40:16,933 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:40:16,933 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:40:16,934 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:40:16,934 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:40:16,934 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:40:16,934 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:40:16,934 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 03:40:16,935 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 03:40:16,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 03:40:16,935 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:40:16,935 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:40:16,935 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 03:40:16,935 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E 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 -> Taipan 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-11-14 03:40:17,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:40:17,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:40:17,310 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:40:17,312 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:40:17,312 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:40:17,314 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/list-simple/dll2n_append_equal.i Unable to find full path for "g++" [2024-11-14 03:40:19,498 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:40:20,064 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:40:20,067 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/sv-benchmarks/c/list-simple/dll2n_append_equal.i [2024-11-14 03:40:20,091 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/data/be7d437be/f9017146a1bc457894c8287c9f7082e7/FLAG381c0e2dd [2024-11-14 03:40:20,586 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/data/be7d437be/f9017146a1bc457894c8287c9f7082e7 [2024-11-14 03:40:20,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:40:20,591 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:40:20,593 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:40:20,593 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:40:20,598 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:40:20,600 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:40:20" (1/1) ... [2024-11-14 03:40:20,601 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47eedf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:40:20, skipping insertion in model container [2024-11-14 03:40:20,602 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:40:20" (1/1) ... [2024-11-14 03:40:20,655 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:40:20,995 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/sv-benchmarks/c/list-simple/dll2n_append_equal.i[24333,24346] [2024-11-14 03:40:21,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:40:21,016 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:40:21,081 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/sv-benchmarks/c/list-simple/dll2n_append_equal.i[24333,24346] [2024-11-14 03:40:21,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:40:21,113 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:40:21,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:40:21 WrapperNode [2024-11-14 03:40:21,114 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:40:21,115 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:40:21,116 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:40:21,116 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:40:21,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:40:21" (1/1) ... [2024-11-14 03:40:21,140 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:40:21" (1/1) ... [2024-11-14 03:40:21,163 INFO L138 Inliner]: procedures = 127, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 120 [2024-11-14 03:40:21,163 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:40:21,164 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:40:21,164 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:40:21,164 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:40:21,174 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:40:21" (1/1) ... [2024-11-14 03:40:21,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:40:21" (1/1) ... [2024-11-14 03:40:21,180 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:40:21" (1/1) ... [2024-11-14 03:40:21,180 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:40:21" (1/1) ... [2024-11-14 03:40:21,189 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:40:21" (1/1) ... [2024-11-14 03:40:21,193 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:40:21" (1/1) ... [2024-11-14 03:40:21,195 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:40:21" (1/1) ... [2024-11-14 03:40:21,196 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:40:21" (1/1) ... [2024-11-14 03:40:21,199 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:40:21,199 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:40:21,200 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:40:21,200 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:40:21,201 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:40:21" (1/1) ... [2024-11-14 03:40:21,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:40:21,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:40:21,247 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:40:21,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:40:21,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 03:40:21,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 03:40:21,281 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-14 03:40:21,281 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-14 03:40:21,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 03:40:21,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:40:21,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 03:40:21,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 03:40:21,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 03:40:21,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 03:40:21,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-14 03:40:21,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 03:40:21,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:40:21,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:40:21,448 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:40:21,450 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:40:21,814 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-14 03:40:21,816 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:40:21,881 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:40:21,881 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-14 03:40:21,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:40:21 BoogieIcfgContainer [2024-11-14 03:40:21,882 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:40:21,885 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:40:21,885 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:40:21,891 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:40:21,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:40:20" (1/3) ... [2024-11-14 03:40:21,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66cd224 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:40:21, skipping insertion in model container [2024-11-14 03:40:21,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:40:21" (2/3) ... [2024-11-14 03:40:21,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66cd224 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:40:21, skipping insertion in model container [2024-11-14 03:40:21,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:40:21" (3/3) ... [2024-11-14 03:40:21,894 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal.i [2024-11-14 03:40:21,911 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:40:21,913 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2n_append_equal.i that has 2 procedures, 23 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2024-11-14 03:40:21,971 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:40:21,985 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=FINITE_AUTOMATA, 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;@34cd22, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:40:21,985 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 03:40:21,990 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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-11-14 03:40:21,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-14 03:40:21,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:40:21,999 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:40:22,000 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:40:22,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:40:22,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1883827852, now seen corresponding path program 1 times [2024-11-14 03:40:22,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:40:22,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200182581] [2024-11-14 03:40:22,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:40:22,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:40:22,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:40:22,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:40:22,413 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:40:22,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200182581] [2024-11-14 03:40:22,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200182581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:40:22,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:40:22,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:40:22,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555044459] [2024-11-14 03:40:22,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:40:22,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:40:22,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:40:22,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:40:22,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:40:22,453 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:40:22,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:40:22,545 INFO L93 Difference]: Finished difference Result 45 states and 63 transitions. [2024-11-14 03:40:22,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:40:22,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-14 03:40:22,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:40:22,556 INFO L225 Difference]: With dead ends: 45 [2024-11-14 03:40:22,556 INFO L226 Difference]: Without dead ends: 22 [2024-11-14 03:40:22,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:40:22,568 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:40:22,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 44 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:40:22,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-14 03:40:22,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2024-11-14 03:40:22,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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-11-14 03:40:22,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2024-11-14 03:40:22,622 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 12 [2024-11-14 03:40:22,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:40:22,622 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-11-14 03:40:22,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:40:22,623 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2024-11-14 03:40:22,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-14 03:40:22,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:40:22,626 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:40:22,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 03:40:22,627 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:40:22,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:40:22,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1544053001, now seen corresponding path program 1 times [2024-11-14 03:40:22,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:40:22,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914008380] [2024-11-14 03:40:22,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:40:22,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:40:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:40:23,118 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 03:40:23,118 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:40:23,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914008380] [2024-11-14 03:40:23,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914008380] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:40:23,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249893500] [2024-11-14 03:40:23,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:40:23,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:40:23,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:40:23,124 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:40:23,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 03:40:23,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:40:23,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 03:40:23,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:40:23,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:40:23,476 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:40:23,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 03:40:23,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249893500] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:40:23,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1569997294] [2024-11-14 03:40:23,566 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2024-11-14 03:40:23,567 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:40:23,571 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:40:23,575 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:40:23,575 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:40:27,330 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 187 for LOIs [2024-11-14 03:40:27,779 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:40:57,957 WARN L286 SmtUtils]: Spent 7.00s on a formula simplification. DAG size of input: 227 DAG size of output: 226 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:41:14,481 WARN L286 SmtUtils]: Spent 9.71s on a formula simplification. DAG size of input: 235 DAG size of output: 234 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:41:14,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1569997294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:41:14,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:41:14,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [4, 4, 4] total 16 [2024-11-14 03:41:14,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655704339] [2024-11-14 03:41:14,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:41:14,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 03:41:14,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:41:14,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 03:41:14,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=205, Unknown=1, NotChecked=0, Total=240 [2024-11-14 03:41:14,486 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 13 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 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-11-14 03:41:20,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:41:24,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:41:27,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:41:37,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:41:52,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:41:52,559 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2024-11-14 03:41:52,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 03:41:52,560 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 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 18 [2024-11-14 03:41:52,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:41:52,561 INFO L225 Difference]: With dead ends: 26 [2024-11-14 03:41:52,561 INFO L226 Difference]: Without dead ends: 23 [2024-11-14 03:41:52,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 46.7s TimeCoverageRelationStatistics Valid=34, Invalid=205, Unknown=1, NotChecked=0, Total=240 [2024-11-14 03:41:52,563 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:41:52,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 34 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 3 Unknown, 0 Unchecked, 38.0s Time] [2024-11-14 03:41:52,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-14 03:41:52,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2024-11-14 03:41:52,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 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-11-14 03:41:52,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2024-11-14 03:41:52,578 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 18 [2024-11-14 03:41:52,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:41:52,578 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-11-14 03:41:52,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 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-11-14 03:41:52,579 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2024-11-14 03:41:52,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-14 03:41:52,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:41:52,580 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:41:52,602 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 03:41:52,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:41:52,781 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:41:52,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:41:52,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1544108026, now seen corresponding path program 1 times [2024-11-14 03:41:52,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:41:52,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306178219] [2024-11-14 03:41:52,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:41:52,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:41:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:41:53,070 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 03:41:53,071 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:41:53,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306178219] [2024-11-14 03:41:53,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306178219] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:41:53,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143635554] [2024-11-14 03:41:53,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:41:53,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:41:53,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:41:53,075 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:41:53,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 03:41:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:41:53,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 03:41:53,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:41:53,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:41:53,307 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:41:53,392 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 03:41:53,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143635554] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:41:53,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [674325264] [2024-11-14 03:41:53,396 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2024-11-14 03:41:53,396 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:41:53,396 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:41:53,397 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:41:53,397 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:41:56,143 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 187 for LOIs [2024-11-14 03:41:56,438 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:42:04,707 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification. DAG size of input: 242 DAG size of output: 233 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:42:38,080 WARN L286 SmtUtils]: Spent 7.41s on a formula simplification. DAG size of input: 227 DAG size of output: 226 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:42:53,609 WARN L286 SmtUtils]: Spent 9.28s on a formula simplification. DAG size of input: 235 DAG size of output: 234 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:43:25,004 WARN L286 SmtUtils]: Spent 23.90s on a formula simplification. DAG size of input: 244 DAG size of output: 238 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:43:25,007 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '411#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|) 1)) (exists ((|v_#memory_int_109| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_89| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_append_~head#1.base_16| Int) (|v_#memory_$Pointer$.base_89| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_89| |v_ULTIMATE.start_dll_append_~head#1.base_16| (store (select |v_#memory_$Pointer$.offset_89| |v_ULTIMATE.start_dll_append_~head#1.base_16|) 0 0))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_89| |v_ULTIMATE.start_dll_append_~head#1.base_16| (store (select |v_#memory_$Pointer$.base_89| |v_ULTIMATE.start_dll_append_~head#1.base_16|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_16|) 0)))) (= 0 (select (select |v_#memory_$Pointer$.offset_89| |v_ULTIMATE.start_dll_append_~head#1.base_16|) 0)) (= |#memory_int| (store |v_#memory_int_109| |v_ULTIMATE.start_dll_append_~head#1.base_16| (store (select |v_#memory_int_109| |v_ULTIMATE.start_dll_append_~head#1.base_16|) 0 (select (select |#memory_int| |v_ULTIMATE.start_dll_append_~head#1.base_16|) 0)))) (or (and (exists ((|v_#memory_$Pointer$.offset_85| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_85| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_16|) 0) (store (store (store (select |v_#memory_$Pointer$.offset_85| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_16|) 0)) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.offset_89| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_16|) 0)) 0))) |v_#memory_$Pointer$.offset_89|)) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_16|) 0) 1) |#StackHeapBarrier|) (= |v_ULTIMATE.start_dll_append_~head#1.base_16| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_108| (Array Int (Array Int Int))) (|v_#memory_int_53| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_88| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_19| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_88| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_49| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_49| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.base_35| Int) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_19| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_19| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_88| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_88| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 (select (select |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0))) |v_#memory_$Pointer$.offset_49|) (= |v_#memory_$Pointer$.base_49| (store |v_#memory_$Pointer$.base_88| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_88| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 (select (select |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_#memory_int_53| (store |v_#memory_int_108| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (store (select |v_#memory_int_108| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 1) 4 (select (select |v_#memory_int_53| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (or (and (not (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_35|)) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_19| (store (store |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |v_ULTIMATE.start_dll_create_~head~0#1.base_35| (store (select (store |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |v_ULTIMATE.start_dll_create_~head~0#1.base_35|) 8 0))) (= (store (store |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_35|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_35| (store (select (store |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_35|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_35|) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_19|) (= |v_old(#memory_int)_AFTER_CALL_19| (store |v_#memory_int_53| |v_ULTIMATE.start_dll_create_~head~0#1.base_35| (store (select |v_#memory_int_53| |v_ULTIMATE.start_dll_create_~head~0#1.base_35|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_19| |v_ULTIMATE.start_dll_create_~head~0#1.base_35|) 8))))) (and (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_35|) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_19| (store |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| (store |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0))) (= |v_old(#memory_int)_AFTER_CALL_19| |v_#memory_int_53|))))) (exists ((|v_#length_34| (Array Int Int))) (= |#length| (store |v_#length_34| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_16|) 0) 12))) (exists ((|v_#valid_44| (Array Int Int))) (and (= (store |v_#valid_44| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_16|) 0) 1) |#valid|) (= (select |v_#valid_44| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_16|) 0)) 0))) (exists ((|v_#memory_int_40| (Array Int (Array Int Int))) (|v_#memory_int_105| (Array Int (Array Int Int))) (|v_#memory_int_39| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_16|) 0) (store (select |v_#memory_int_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_16|) 0)) 0 1)) |v_#memory_int_109|) (= |v_#memory_int_40| (store |v_#memory_int_39| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_16|) 0) (store (select |v_#memory_int_39| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_16|) 0)) 8 (select (select |v_#memory_int_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_16|) 0)) 8)))) (= |v_#memory_int_39| (store |v_#memory_int_105| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_16|) 0) (store (select |v_#memory_int_105| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_16|) 0)) 4 (select (select |v_#memory_int_39| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_16|) 0)) 4)))))) (exists ((|v_#memory_$Pointer$.base_85| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_85| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_16|) 0) (store (store (store (select |v_#memory_$Pointer$.base_85| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_16|) 0)) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.base_89| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_16|) 0)) 0))) |v_#memory_$Pointer$.base_89|))) (and (exists ((|v_#memory_$Pointer$.offset_85| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_85| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_16|) 0) (store (store (store (select |v_#memory_$Pointer$.offset_85| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_16|) 0)) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.offset_89| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_16|) 0)) 0))) |v_#memory_$Pointer$.offset_89|)) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_16|) 0) 1) |#StackHeapBarrier|) (= |v_ULTIMATE.start_dll_append_~head#1.base_16| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#length_34| (Array Int Int))) (= |#length| (store |v_#length_34| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_16|) 0) 12))) (exists ((|v_#valid_44| (Array Int Int))) (and (= (store |v_#valid_44| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_16|) 0) 1) |#valid|) (= (select |v_#valid_44| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_16|) 0)) 0))) (exists ((|v_#memory_int_40| (Array Int (Array Int Int))) (|v_#memory_int_105| (Array Int (Array Int Int))) (|v_#memory_int_39| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_16|) 0) (store (select |v_#memory_int_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_16|) 0)) 0 1)) |v_#memory_int_109|) (= |v_#memory_int_40| (store |v_#memory_int_39| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_16|) 0) (store (select |v_#memory_int_39| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_16|) 0)) 8 (select (select |v_#memory_int_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_16|) 0)) 8)))) (= |v_#memory_int_39| (store |v_#memory_int_105| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_16|) 0) (store (select |v_#memory_int_105| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_16|) 0)) 4 (select (select |v_#memory_int_39| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_16|) 0)) 4)))))) (exists ((|v_#memory_$Pointer$.base_85| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_85| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_16|) 0) (store (store (store (select |v_#memory_$Pointer$.base_85| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_16|) 0)) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.base_89| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_16|) 0)) 0))) |v_#memory_$Pointer$.base_89|)) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_20| (Array Int (Array Int Int))) (|v_#memory_int_108| (Array Int (Array Int Int))) (|v_#memory_int_53| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_88| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_88| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_20| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_49| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_49| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.base_35| Int) (|v_old(#memory_int)_AFTER_CALL_20| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_88| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_88| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 (select (select |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0))) |v_#memory_$Pointer$.base_49|) (= |v_#memory_int_53| (store |v_#memory_int_108| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (store (select |v_#memory_int_108| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 1) 4 (select (select |v_#memory_int_53| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (and (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_35|) (= |v_old(#memory_int)_AFTER_CALL_20| |v_#memory_int_53|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| (store |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0))) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_20| (store |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| (store (store |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_35|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_35| (store (select (store |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_35|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_35|) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (not (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_35|)) (= |v_old(#memory_int)_AFTER_CALL_20| (store |v_#memory_int_53| |v_ULTIMATE.start_dll_create_~head~0#1.base_35| (store (select |v_#memory_int_53| |v_ULTIMATE.start_dll_create_~head~0#1.base_35|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_20| |v_ULTIMATE.start_dll_create_~head~0#1.base_35|) 8)))) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_20| (store (store |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |v_ULTIMATE.start_dll_create_~head~0#1.base_35| (store (select (store |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |v_ULTIMATE.start_dll_create_~head~0#1.base_35|) 8 0))))) (= (store |v_#memory_$Pointer$.offset_88| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_88| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 (select (select |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0))) |v_#memory_$Pointer$.offset_49|))))) (= (select (select |v_#memory_$Pointer$.base_89| |v_ULTIMATE.start_dll_append_~head#1.base_16|) 0) 0))) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 03:43:25,007 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:43:25,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:43:25,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-14 03:43:25,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868771961] [2024-11-14 03:43:25,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:43:25,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:43:25,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:43:25,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:43:25,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=267, Unknown=1, NotChecked=0, Total=306 [2024-11-14 03:43:25,009 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 03:43:25,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:43:25,116 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2024-11-14 03:43:25,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:43:25,117 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 18 [2024-11-14 03:43:25,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:43:25,117 INFO L225 Difference]: With dead ends: 42 [2024-11-14 03:43:25,118 INFO L226 Difference]: Without dead ends: 25 [2024-11-14 03:43:25,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 88.6s TimeCoverageRelationStatistics Valid=38, Invalid=267, Unknown=1, NotChecked=0, Total=306 [2024-11-14 03:43:25,119 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:43:25,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 52 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:43:25,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-14 03:43:25,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-14 03:43:25,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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-11-14 03:43:25,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2024-11-14 03:43:25,133 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 18 [2024-11-14 03:43:25,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:43:25,133 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2024-11-14 03:43:25,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 03:43:25,134 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2024-11-14 03:43:25,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 03:43:25,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:43:25,135 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:43:25,161 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-14 03:43:25,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:43:25,339 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:43:25,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:43:25,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1109146673, now seen corresponding path program 2 times [2024-11-14 03:43:25,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:43:25,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459419449] [2024-11-14 03:43:25,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:43:25,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:43:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:43:26,329 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 03:43:26,330 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:43:26,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459419449] [2024-11-14 03:43:26,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459419449] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:43:26,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201108731] [2024-11-14 03:43:26,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:43:26,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:43:26,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:43:26,332 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:43:26,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 03:43:26,486 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-14 03:43:26,486 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:43:26,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-14 03:43:26,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:43:26,779 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-11-14 03:43:27,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 03:43:27,099 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-11-14 03:43:27,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:43:27,112 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-11-14 03:43:27,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 28 treesize of output 16 [2024-11-14 03:43:27,229 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-11-14 03:43:27,386 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-14 03:43:27,386 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:43:27,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201108731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:43:27,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 03:43:27,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13] total 22 [2024-11-14 03:43:27,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699263584] [2024-11-14 03:43:27,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:43:27,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 03:43:27,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:43:27,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 03:43:27,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2024-11-14 03:43:27,388 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 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-11-14 03:43:28,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:43:28,128 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2024-11-14 03:43:28,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 03:43:28,129 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 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 24 [2024-11-14 03:43:28,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:43:28,129 INFO L225 Difference]: With dead ends: 35 [2024-11-14 03:43:28,130 INFO L226 Difference]: Without dead ends: 33 [2024-11-14 03:43:28,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2024-11-14 03:43:28,131 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 30 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:43:28,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 76 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 03:43:28,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-14 03:43:28,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2024-11-14 03:43:28,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:43:28,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-11-14 03:43:28,145 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 24 [2024-11-14 03:43:28,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:43:28,146 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-11-14 03:43:28,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 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-11-14 03:43:28,146 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2024-11-14 03:43:28,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-14 03:43:28,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:43:28,147 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:43:28,167 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 03:43:28,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:43:28,347 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:43:28,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:43:28,348 INFO L85 PathProgramCache]: Analyzing trace with hash 738153885, now seen corresponding path program 1 times [2024-11-14 03:43:28,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:43:28,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757116723] [2024-11-14 03:43:28,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:43:28,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:43:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:43:29,120 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 03:43:29,121 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:43:29,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757116723] [2024-11-14 03:43:29,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757116723] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:43:29,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115916293] [2024-11-14 03:43:29,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:43:29,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:43:29,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:43:29,125 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:43:29,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 03:43:29,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:43:29,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-14 03:43:29,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:43:29,458 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 8 treesize of output 4 [2024-11-14 03:43:29,519 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_31| Int)) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_31| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_31|))) (<= (+ |v_node_create_~temp~0#1.base_31| 1) |c_#StackHeapBarrier|))) is different from true [2024-11-14 03:43:29,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:43:29,529 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 17 treesize of output 12 [2024-11-14 03:43:29,540 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-11-14 03:43:29,544 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2024-11-14 03:43:29,544 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:43:29,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115916293] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:43:29,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1885844684] [2024-11-14 03:43:29,695 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2024-11-14 03:43:29,695 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:43:29,696 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:43:29,696 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:43:29,696 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:43:31,198 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 187 for LOIs [2024-11-14 03:43:31,524 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:44:00,695 WARN L286 SmtUtils]: Spent 6.02s on a formula simplification. DAG size of input: 227 DAG size of output: 226 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:44:01,850 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '822#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 03:44:01,850 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:44:01,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:44:01,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2024-11-14 03:44:01,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604777612] [2024-11-14 03:44:01,851 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 03:44:01,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-14 03:44:01,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:44:01,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-14 03:44:01,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=669, Unknown=6, NotChecked=52, Total=812 [2024-11-14 03:44:01,852 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 15 states, 10 states have (on average 2.1) internal successors, (21), 12 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 03:44:02,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:44:02,376 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2024-11-14 03:44:02,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 03:44:02,376 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 10 states have (on average 2.1) internal successors, (21), 12 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2024-11-14 03:44:02,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:44:02,377 INFO L225 Difference]: With dead ends: 31 [2024-11-14 03:44:02,377 INFO L226 Difference]: Without dead ends: 23 [2024-11-14 03:44:02,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 31.0s TimeCoverageRelationStatistics Valid=110, Invalid=880, Unknown=6, NotChecked=60, Total=1056 [2024-11-14 03:44:02,379 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 17 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:44:02,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 104 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 26 Unchecked, 0.3s Time] [2024-11-14 03:44:02,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-14 03:44:02,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-14 03:44:02,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 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-11-14 03:44:02,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2024-11-14 03:44:02,390 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 26 [2024-11-14 03:44:02,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:44:02,390 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-11-14 03:44:02,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 10 states have (on average 2.1) internal successors, (21), 12 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 03:44:02,391 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2024-11-14 03:44:02,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 03:44:02,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:44:02,392 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:44:02,411 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-14 03:44:02,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:44:02,595 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:44:02,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:44:02,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1047830424, now seen corresponding path program 1 times [2024-11-14 03:44:02,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:44:02,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300747920] [2024-11-14 03:44:02,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:44:02,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:44:02,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:44:04,012 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 03:44:04,012 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:44:04,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300747920] [2024-11-14 03:44:04,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300747920] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:44:04,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689044192] [2024-11-14 03:44:04,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:44:04,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:44:04,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:44:04,015 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:44:04,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 03:44:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:44:04,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-14 03:44:04,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:44:04,614 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 8 treesize of output 4 [2024-11-14 03:44:04,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:44:04,843 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 17 treesize of output 12 [2024-11-14 03:44:05,289 INFO L349 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2024-11-14 03:44:05,289 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 2 case distinctions, treesize of input 36 treesize of output 43 [2024-11-14 03:44:05,347 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2024-11-14 03:44:05,347 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 40 treesize of output 48 [2024-11-14 03:44:05,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-14 03:44:05,392 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-11-14 03:44:05,397 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 03:44:05,397 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:44:06,105 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_821 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| Int) (|ULTIMATE.start_dll_append_~last~0#1.offset| Int) (|ULTIMATE.start_dll_append_~last~0#1.base| Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| v_ArrVal_821) |ULTIMATE.start_dll_append_~last~0#1.base|)) (.cse1 (+ |ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (or (not (= (select .cse0 .cse1) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| 1)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~last~0#1.base| (store .cse0 .cse1 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| v_ArrVal_817) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2024-11-14 03:44:06,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689044192] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:44:06,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [392606792] [2024-11-14 03:44:06,114 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-14 03:44:06,116 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:44:06,116 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:44:06,116 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:44:06,116 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:44:07,528 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 187 for LOIs [2024-11-14 03:44:07,721 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:45:31,435 WARN L286 SmtUtils]: Spent 22.64s on a formula simplification. DAG size of input: 249 DAG size of output: 248 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:46:03,391 WARN L286 SmtUtils]: Spent 19.39s on a formula simplification. DAG size of input: 257 DAG size of output: 256 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:46:03,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [392606792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:03,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:46:03,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [16, 17] total 42 [2024-11-14 03:46:03,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956195278] [2024-11-14 03:46:03,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:03,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-14 03:46:03,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:46:03,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-14 03:46:03,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1931, Unknown=8, NotChecked=88, Total=2162 [2024-11-14 03:46:03,396 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 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-11-14 03:46:13,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:46:15,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:46:17,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:46:21,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:46:25,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:46:28,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:46:29,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:46:32,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:46:36,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:46:41,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:46:45,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:46:51,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:46:56,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:46:57,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:46:58,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:46:59,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:47:05,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:47:07,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:47:08,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:47:10,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:47:11,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:47:13,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:47:14,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:47:21,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:47:21,540 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2024-11-14 03:47:21,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-14 03:47:21,540 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 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 27 [2024-11-14 03:47:21,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:47:21,541 INFO L225 Difference]: With dead ends: 32 [2024-11-14 03:47:21,541 INFO L226 Difference]: Without dead ends: 29 [2024-11-14 03:47:21,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 117.6s TimeCoverageRelationStatistics Valid=135, Invalid=1931, Unknown=8, NotChecked=88, Total=2162 [2024-11-14 03:47:21,542 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 1 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 1 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 73.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 78.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:47:21,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 21 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 261 Invalid, 10 Unknown, 0 Unchecked, 78.1s Time] [2024-11-14 03:47:21,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-14 03:47:21,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-11-14 03:47:21,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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-11-14 03:47:21,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-11-14 03:47:21,560 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 27 [2024-11-14 03:47:21,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:47:21,560 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-11-14 03:47:21,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 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-11-14 03:47:21,560 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-11-14 03:47:21,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 03:47:21,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:47:21,561 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:47:21,575 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-14 03:47:21,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:47:21,762 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:47:21,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:47:21,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1047885449, now seen corresponding path program 1 times [2024-11-14 03:47:21,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:47:21,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651738949] [2024-11-14 03:47:21,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:47:21,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:47:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:47:24,930 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:47:24,930 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:47:24,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651738949] [2024-11-14 03:47:24,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651738949] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:47:24,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150242207] [2024-11-14 03:47:24,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:47:24,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:47:24,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:47:24,932 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:47:24,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 03:47:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:47:25,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-11-14 03:47:25,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:47:25,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:47:26,567 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 03:47:26,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-14 03:47:26,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-14 03:47:26,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-14 03:47:26,813 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 31 treesize of output 15 [2024-11-14 03:47:26,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-14 03:47:27,382 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 46 treesize of output 26 [2024-11-14 03:47:27,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 03:47:27,400 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 7 treesize of output 3 [2024-11-14 03:47:27,409 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-11-14 03:47:27,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:47:27,854 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 54 treesize of output 41 [2024-11-14 03:47:27,903 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-14 03:47:27,903 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 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-14 03:47:27,975 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-14 03:47:27,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 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-11-14 03:47:28,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:47:28,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:47:29,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:47:29,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:47:29,399 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 97 [2024-11-14 03:47:29,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:47:29,414 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 115 treesize of output 92 [2024-11-14 03:47:29,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:47:29,451 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2024-11-14 03:47:29,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:47:29,499 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2024-11-14 03:47:29,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:47:29,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:47:29,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2024-11-14 03:47:29,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 03:47:29,912 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 49 treesize of output 29 [2024-11-14 03:47:29,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:47:29,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2024-11-14 03:47:30,266 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:47:30,266 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:47:30,323 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1030 Int) (v_ArrVal_1029 (Array Int Int)) (v_ArrVal_1028 (Array Int Int)) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1031 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1031) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1033) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_1030)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1028) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1029) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (store (select |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 (select v_ArrVal_1031 .cse0)) v_ArrVal_1031))))) is different from false [2024-11-14 03:47:30,876 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1030 Int) (v_ArrVal_1029 (Array Int Int)) (v_ArrVal_1028 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_24| Int) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1031 (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse3)) (.cse0 (select |c_#memory_$Pointer$.offset| .cse3)) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_24| 4))) (or (not (= (select .cse0 .cse1) 0)) (not (= (select .cse2 .cse1) 0)) (not (= (store (select |c_#memory_int| .cse3) .cse1 (select v_ArrVal_1031 .cse1)) v_ArrVal_1031)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse3 v_ArrVal_1031) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1033) (select (select (store (store |c_#memory_$Pointer$.base| .cse3 (store .cse2 .cse1 v_ArrVal_1030)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1028) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 (store .cse0 .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1029) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (< |v_ULTIMATE.start_dll_append_~last~0#1.offset_24| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)))))) is different from false [2024-11-14 03:47:31,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150242207] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:47:31,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [960215247] [2024-11-14 03:47:31,832 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-14 03:47:31,832 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:47:31,832 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:47:31,832 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:47:31,832 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:47:33,524 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 187 for LOIs [2024-11-14 03:47:33,681 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:48:04,047 WARN L286 SmtUtils]: Spent 24.77s on a formula simplification. DAG size of input: 264 DAG size of output: 258 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:49:38,703 WARN L286 SmtUtils]: Spent 13.68s on a formula simplification. DAG size of input: 249 DAG size of output: 248 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:50:11,688 WARN L286 SmtUtils]: Spent 17.11s on a formula simplification. DAG size of input: 257 DAG size of output: 256 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:50:52,040 WARN L286 SmtUtils]: Spent 23.59s on a formula simplification. DAG size of input: 266 DAG size of output: 260 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:50:52,041 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1314#(and (<= 1 |#StackHeapBarrier|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|) 1)) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (exists ((|v_#memory_$Pointer$.base_151| (Array Int (Array Int Int))) (|v_#memory_int_24| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_append_~head#1.base_24| Int) (|v_ULTIMATE.start_dll_append_~new_last~0#1.base_29| Int) (|v_#memory_int_223| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_144| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_144| (select (select |v_#memory_$Pointer$.base_151| |v_ULTIMATE.start_dll_append_~head#1.base_24|) 0) (store (select |v_#memory_$Pointer$.offset_144| (select (select |v_#memory_$Pointer$.base_151| |v_ULTIMATE.start_dll_append_~head#1.base_24|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_144| |v_ULTIMATE.start_dll_append_~head#1.base_24|) 0) 4) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29| (store (select (store |v_#memory_$Pointer$.offset_144| (select (select |v_#memory_$Pointer$.base_151| |v_ULTIMATE.start_dll_append_~head#1.base_24|) 0) (store (select |v_#memory_$Pointer$.offset_144| (select (select |v_#memory_$Pointer$.base_151| |v_ULTIMATE.start_dll_append_~head#1.base_24|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_144| |v_ULTIMATE.start_dll_append_~head#1.base_24|) 0) 4) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 8 (select (select |v_#memory_$Pointer$.offset_144| |v_ULTIMATE.start_dll_append_~head#1.base_24|) 0)))) (= |v_#memory_int_24| (store |v_#memory_int_223| (select (select |v_#memory_$Pointer$.base_151| |v_ULTIMATE.start_dll_append_~head#1.base_24|) 0) (store (select |v_#memory_int_223| (select (select |v_#memory_$Pointer$.base_151| |v_ULTIMATE.start_dll_append_~head#1.base_24|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_144| |v_ULTIMATE.start_dll_append_~head#1.base_24|) 0) 4) (select (select |v_#memory_int_24| (select (select |v_#memory_$Pointer$.base_151| |v_ULTIMATE.start_dll_append_~head#1.base_24|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_144| |v_ULTIMATE.start_dll_append_~head#1.base_24|) 0) 4))))) (= (select (select |v_#memory_$Pointer$.offset_144| (select (select |v_#memory_$Pointer$.base_151| |v_ULTIMATE.start_dll_append_~head#1.base_24|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_144| |v_ULTIMATE.start_dll_append_~head#1.base_24|) 0) 4)) 0) (or (and (<= (+ |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_140| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_140| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29| (store (store (store (select |v_#memory_$Pointer$.offset_140| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.offset_144| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 0))) |v_#memory_$Pointer$.offset_144|)) (exists ((|v_#memory_int_40| (Array Int (Array Int Int))) (|v_#memory_int_219| (Array Int (Array Int Int))) (|v_#memory_int_39| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_40| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29| (store (select |v_#memory_int_40| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 0 1)) |v_#memory_int_223|) (= |v_#memory_int_40| (store |v_#memory_int_39| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29| (store (select |v_#memory_int_39| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 8 (select (select |v_#memory_int_40| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 8)))) (= (store |v_#memory_int_219| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29| (store (select |v_#memory_int_219| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 4 (select (select |v_#memory_int_39| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 4))) |v_#memory_int_39|))) (not (= |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29| 0)) (= |v_ULTIMATE.start_dll_append_~head#1.base_24| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_53| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_150| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_55| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_55| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.base_51| Int) (|v_#memory_$Pointer$.base_49| (Array Int (Array Int Int))) (|v_#memory_int_222| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_49| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_143| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_55| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_143| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_143| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 (select (select |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0))) |v_#memory_$Pointer$.offset_49|) (= |v_#memory_int_53| (store |v_#memory_int_222| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (store (select |v_#memory_int_222| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 1) 4 (select (select |v_#memory_int_53| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (store |v_#memory_$Pointer$.base_150| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_150| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 (select (select |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0))) |v_#memory_$Pointer$.base_49|) (or (and (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_51|) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_55| (store |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| (store |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0))) (= |v_old(#memory_int)_AFTER_CALL_55| |v_#memory_int_53|)) (and (= |v_old(#memory_int)_AFTER_CALL_55| (store |v_#memory_int_53| |v_ULTIMATE.start_dll_create_~head~0#1.base_51| (store (select |v_#memory_int_53| |v_ULTIMATE.start_dll_create_~head~0#1.base_51|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_55| |v_ULTIMATE.start_dll_create_~head~0#1.base_51|) 8)))) (= (store (store |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |v_ULTIMATE.start_dll_create_~head~0#1.base_51| (store (select (store |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |v_ULTIMATE.start_dll_create_~head~0#1.base_51|) 8 0)) |v_old(#memory_$Pointer$.offset)_AFTER_CALL_55|) (= (store (store |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_51|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_51| (store (select (store |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_51|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_51|) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_55|) (not (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_51|)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (exists ((|v_#memory_$Pointer$.base_147| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_147| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29| (store (store (store (select |v_#memory_$Pointer$.base_147| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.base_151| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 0))) |v_#memory_$Pointer$.base_151|)) (exists ((|v_#valid_69| (Array Int Int))) (and (= (store |v_#valid_69| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29| 1) |#valid|) (= (select |v_#valid_69| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 0))) (exists ((|v_#length_55| (Array Int Int))) (= |#length| (store |v_#length_55| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29| 12)))) (and (<= (+ |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_140| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_140| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29| (store (store (store (select |v_#memory_$Pointer$.offset_140| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.offset_144| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 0))) |v_#memory_$Pointer$.offset_144|)) (exists ((|v_#memory_int_40| (Array Int (Array Int Int))) (|v_#memory_int_219| (Array Int (Array Int Int))) (|v_#memory_int_39| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_40| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29| (store (select |v_#memory_int_40| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 0 1)) |v_#memory_int_223|) (= |v_#memory_int_40| (store |v_#memory_int_39| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29| (store (select |v_#memory_int_39| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 8 (select (select |v_#memory_int_40| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 8)))) (= (store |v_#memory_int_219| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29| (store (select |v_#memory_int_219| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 4 (select (select |v_#memory_int_39| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 4))) |v_#memory_int_39|))) (not (= |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29| 0)) (= |v_ULTIMATE.start_dll_append_~head#1.base_24| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_53| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_150| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_56| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.base_51| Int) (|v_#memory_$Pointer$.base_49| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_56| (Array Int (Array Int Int))) (|v_#memory_int_222| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_49| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_143| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_56| (Array Int (Array Int Int)))) (and (or (and (= |v_old(#memory_int)_AFTER_CALL_56| (store |v_#memory_int_53| |v_ULTIMATE.start_dll_create_~head~0#1.base_51| (store (select |v_#memory_int_53| |v_ULTIMATE.start_dll_create_~head~0#1.base_51|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_56| |v_ULTIMATE.start_dll_create_~head~0#1.base_51|) 8)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| (store (store |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_51|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_51| (store (select (store |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_51|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_51|) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (not (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_51|)) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_56| (store (store |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |v_ULTIMATE.start_dll_create_~head~0#1.base_51| (store (select (store |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |v_ULTIMATE.start_dll_create_~head~0#1.base_51|) 8 0)))) (and (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_51|) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_56| (store |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0))) (= |v_old(#memory_int)_AFTER_CALL_56| |v_#memory_int_53|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| (store |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0))))) (= (store |v_#memory_$Pointer$.offset_143| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_143| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 (select (select |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0))) |v_#memory_$Pointer$.offset_49|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (store |v_#memory_$Pointer$.base_150| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_150| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 (select (select |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0))) |v_#memory_$Pointer$.base_49|) (= (store |v_#memory_int_222| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (store (select |v_#memory_int_222| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 1) 4 (select (select |v_#memory_int_53| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_#memory_int_53|))) (exists ((|v_#memory_$Pointer$.base_147| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_147| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29| (store (store (store (select |v_#memory_$Pointer$.base_147| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.base_151| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 0))) |v_#memory_$Pointer$.base_151|)) (exists ((|v_#valid_69| (Array Int Int))) (and (= (store |v_#valid_69| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29| 1) |#valid|) (= (select |v_#valid_69| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 0))) (exists ((|v_#length_55| (Array Int Int))) (= |#length| (store |v_#length_55| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29| 12))))) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_151| (select (select |v_#memory_$Pointer$.base_151| |v_ULTIMATE.start_dll_append_~head#1.base_24|) 0) (store (select |v_#memory_$Pointer$.base_151| (select (select |v_#memory_$Pointer$.base_151| |v_ULTIMATE.start_dll_append_~head#1.base_24|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_144| |v_ULTIMATE.start_dll_append_~head#1.base_24|) 0) 4) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29| (store (select (store |v_#memory_$Pointer$.base_151| (select (select |v_#memory_$Pointer$.base_151| |v_ULTIMATE.start_dll_append_~head#1.base_24|) 0) (store (select |v_#memory_$Pointer$.base_151| (select (select |v_#memory_$Pointer$.base_151| |v_ULTIMATE.start_dll_append_~head#1.base_24|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_144| |v_ULTIMATE.start_dll_append_~head#1.base_24|) 0) 4) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 8 (select (select |v_#memory_$Pointer$.base_151| |v_ULTIMATE.start_dll_append_~head#1.base_24|) 0)))) (= |#memory_int| (store |v_#memory_int_24| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29| (store (select |v_#memory_int_24| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 8 (select (select |#memory_int| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 8)))) (= (select (select |v_#memory_$Pointer$.base_151| (select (select |v_#memory_$Pointer$.base_151| |v_ULTIMATE.start_dll_append_~head#1.base_24|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_144| |v_ULTIMATE.start_dll_append_~head#1.base_24|) 0) 4)) 0))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 03:50:52,041 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:50:52,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:50:52,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 42 [2024-11-14 03:50:52,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226181554] [2024-11-14 03:50:52,041 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 03:50:52,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-14 03:50:52,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:50:52,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-14 03:50:52,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=3570, Unknown=12, NotChecked=242, Total=4032 [2024-11-14 03:50:52,043 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 42 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 33 states have internal predecessors, (41), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 03:50:55,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:50:55,436 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2024-11-14 03:50:55,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 03:50:55,437 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 33 states have internal predecessors, (41), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 27 [2024-11-14 03:50:55,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:50:55,439 INFO L225 Difference]: With dead ends: 38 [2024-11-14 03:50:55,439 INFO L226 Difference]: Without dead ends: 36 [2024-11-14 03:50:55,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1313 ImplicationChecksByTransitivity, 205.3s TimeCoverageRelationStatistics Valid=279, Invalid=4546, Unknown=13, NotChecked=274, Total=5112 [2024-11-14 03:50:55,441 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 25 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:50:55,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 148 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-14 03:50:55,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-14 03:50:55,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2024-11-14 03:50:55,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 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-11-14 03:50:55,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-11-14 03:50:55,457 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 27 [2024-11-14 03:50:55,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:50:55,457 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-14 03:50:55,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 33 states have internal predecessors, (41), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 03:50:55,458 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-11-14 03:50:55,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-14 03:50:55,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:50:55,459 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:50:55,477 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-14 03:50:55,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:50:55,659 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:50:55,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:50:55,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1995478685, now seen corresponding path program 1 times [2024-11-14 03:50:55,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:50:55,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041733508] [2024-11-14 03:50:55,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:50:55,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:50:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:50:57,957 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:50:57,957 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:50:57,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041733508] [2024-11-14 03:50:57,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041733508] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:50:57,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140381633] [2024-11-14 03:50:57,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:50:57,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:50:57,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:50:57,961 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:50:57,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 03:50:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:50:58,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-11-14 03:50:58,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:50:58,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:50:58,577 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 03:50:58,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-14 03:50:58,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 16 treesize of output 16 [2024-11-14 03:50:58,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2024-11-14 03:50:58,798 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 03:50:58,798 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 1 case distinctions, treesize of input 58 treesize of output 51 [2024-11-14 03:50:59,151 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 03:50:59,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 31 [2024-11-14 03:50:59,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 03:50:59,167 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-11-14 03:50:59,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:50:59,386 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-14 03:50:59,387 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 76 treesize of output 57 [2024-11-14 03:50:59,455 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-14 03:50:59,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 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-11-14 03:50:59,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:50:59,482 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 16 treesize of output 11 [2024-11-14 03:51:00,324 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-11-14 03:51:00,325 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 26 treesize of output 28 [2024-11-14 03:51:00,409 INFO L349 Elim1Store]: treesize reduction 90, result has 14.3 percent of original size [2024-11-14 03:51:00,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 93 treesize of output 63 [2024-11-14 03:51:00,499 INFO L349 Elim1Store]: treesize reduction 80, result has 20.0 percent of original size [2024-11-14 03:51:00,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 129 treesize of output 115 [2024-11-14 03:51:00,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:51:00,525 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 24 treesize of output 11 [2024-11-14 03:51:00,539 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 38 treesize of output 26 [2024-11-14 03:51:00,668 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-11-14 03:51:00,904 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 03:51:00,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 24 [2024-11-14 03:51:00,994 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:51:00,994 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:51:02,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140381633] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:51:02,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1382716907] [2024-11-14 03:51:02,274 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-14 03:51:02,274 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:51:02,275 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:51:02,275 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:51:02,275 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:51:04,112 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 187 for LOIs [2024-11-14 03:51:04,353 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:52:40,495 WARN L286 SmtUtils]: Spent 24.43s on a formula simplification. DAG size of input: 249 DAG size of output: 248 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:52:42,488 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1598#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 03:52:42,488 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:52:42,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:52:42,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 32 [2024-11-14 03:52:42,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246203690] [2024-11-14 03:52:42,489 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 03:52:42,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-14 03:52:42,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:52:42,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-14 03:52:42,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2773, Unknown=12, NotChecked=0, Total=2970 [2024-11-14 03:52:42,491 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 32 states, 25 states have (on average 1.48) internal successors, (37), 25 states have internal predecessors, (37), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-14 03:52:45,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:52:45,706 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2024-11-14 03:52:45,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-14 03:52:45,707 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 25 states have (on average 1.48) internal successors, (37), 25 states have internal predecessors, (37), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2024-11-14 03:52:45,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:52:45,708 INFO L225 Difference]: With dead ends: 44 [2024-11-14 03:52:45,708 INFO L226 Difference]: Without dead ends: 35 [2024-11-14 03:52:45,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1167 ImplicationChecksByTransitivity, 103.6s TimeCoverageRelationStatistics Valid=324, Invalid=4220, Unknown=12, NotChecked=0, Total=4556 [2024-11-14 03:52:45,710 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 52 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:52:45,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 140 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-14 03:52:45,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-14 03:52:45,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2024-11-14 03:52:45,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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-11-14 03:52:45,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-11-14 03:52:45,734 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 29 [2024-11-14 03:52:45,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:52:45,735 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-11-14 03:52:45,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 25 states have (on average 1.48) internal successors, (37), 25 states have internal predecessors, (37), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-14 03:52:45,735 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-11-14 03:52:45,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-14 03:52:45,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:52:45,736 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-11-14 03:52:45,756 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-14 03:52:45,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:52:45,937 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:52:45,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:52:45,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1853832722, now seen corresponding path program 1 times [2024-11-14 03:52:45,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:52:45,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109129385] [2024-11-14 03:52:45,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:52:45,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:52:46,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:52:50,543 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:52:50,543 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:52:50,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109129385] [2024-11-14 03:52:50,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109129385] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:52:50,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89633112] [2024-11-14 03:52:50,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:52:50,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:52:50,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:52:50,545 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:52:50,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-14 03:52:51,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:52:51,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-11-14 03:52:51,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:52:51,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:52:51,796 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-11-14 03:52:51,989 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 03:52:51,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-14 03:52:52,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-14 03:52:52,227 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 38 treesize of output 21 [2024-11-14 03:52:52,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2024-11-14 03:52:52,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 16 treesize of output 16 [2024-11-14 03:52:52,280 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 03:52:52,280 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 1 case distinctions, treesize of input 42 treesize of output 39 [2024-11-14 03:52:52,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:52:52,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 33 [2024-11-14 03:52:52,815 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-11-14 03:52:53,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:52:53,051 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-11-14 03:52:53,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:52:53,094 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-14 03:52:53,094 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 78 treesize of output 59 [2024-11-14 03:52:53,148 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-14 03:52:53,149 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 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-14 03:52:53,221 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-14 03:52:53,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 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-11-14 03:52:55,112 INFO L349 Elim1Store]: treesize reduction 67, result has 28.0 percent of original size [2024-11-14 03:52:55,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 187 treesize of output 115 [2024-11-14 03:52:55,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:52:55,152 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-14 03:52:55,153 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 163 treesize of output 114 [2024-11-14 03:52:55,213 INFO L349 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2024-11-14 03:52:55,213 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 36 [2024-11-14 03:52:55,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2024-11-14 03:52:55,239 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 20 treesize of output 15 [2024-11-14 03:52:55,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:52:55,255 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 16 treesize of output 11 [2024-11-14 03:52:55,450 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:52:55,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 26 [2024-11-14 03:52:55,766 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:52:55,766 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:52:57,799 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1473 Int) (v_ArrVal_1474 Int) (v_ArrVal_1477 Int) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1472 (Array Int Int)) (v_ArrVal_1470 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_1474)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1470) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_1473)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1472) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_1477)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1475) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2024-11-14 03:52:59,435 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_44| Int) (v_ArrVal_1473 Int) (v_ArrVal_1489 (Array Int Int)) (v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1474 Int) (v_ArrVal_1477 Int) (v_ArrVal_1475 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_33| Int) (v_ArrVal_1472 (Array Int Int)) (v_ArrVal_1470 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_44| v_ArrVal_1488)) (.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_44| v_ArrVal_1490))) (let ((.cse0 (select (select .cse4 (select (select .cse4 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select .cse3 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (let ((.cse2 (select .cse4 .cse0)) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_33| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse0 (store (select (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_44| v_ArrVal_1489) .cse0) .cse1 v_ArrVal_1474)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_44| v_ArrVal_1470) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse2 .cse1 v_ArrVal_1473)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_44| v_ArrVal_1472) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select .cse3 .cse0) .cse1 v_ArrVal_1477)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_44| v_ArrVal_1475) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_44|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_append_#t~ret7#1.base_44| 1)) (not (= (select .cse2 .cse1) 0))))))) is different from false [2024-11-14 03:52:59,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89633112] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:52:59,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1277436669] [2024-11-14 03:52:59,443 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-14 03:52:59,443 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:52:59,444 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:52:59,444 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:52:59,444 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:53:01,264 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 177 for LOIs [2024-11-14 03:53:01,404 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:53:33,565 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1911#(and (<= 1 |#StackHeapBarrier|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|) 1)) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (= |ULTIMATE.start_main_~count~0#1| 0) (exists ((|v_#memory_$Pointer$.base_191| (Array Int (Array Int Int))) (|v_#memory_int_24| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_append_~new_last~0#1.base_37| Int) (|v_#memory_$Pointer$.offset_184| (Array Int (Array Int Int))) (|v_#memory_int_294| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_191| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8) (store (select |v_#memory_$Pointer$.base_191| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8) 4) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37| (store (select (store |v_#memory_$Pointer$.base_191| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8) (store (select |v_#memory_$Pointer$.base_191| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8) 4) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8)))) (= |v_#memory_int_24| (store |v_#memory_int_294| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8) (store (select |v_#memory_int_294| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8) 4) (select (select |v_#memory_int_24| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8) 4))))) (= |#memory_int| (store |v_#memory_int_24| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37| (store (select |v_#memory_int_24| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8 (select (select |#memory_int| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_184| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8) (store (select |v_#memory_$Pointer$.offset_184| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8) 4) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37| (store (select (store |v_#memory_$Pointer$.offset_184| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8) (store (select |v_#memory_$Pointer$.offset_184| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8) 4) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8)))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 03:53:33,565 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:53:33,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:53:33,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 43 [2024-11-14 03:53:33,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279739553] [2024-11-14 03:53:33,566 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 03:53:33,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-14 03:53:33,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:53:33,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-14 03:53:33,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=3704, Unknown=3, NotChecked=246, Total=4160 [2024-11-14 03:53:33,568 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 43 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 34 states have internal predecessors, (42), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 03:53:37,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:37,733 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2024-11-14 03:53:37,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 03:53:37,734 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 34 states have internal predecessors, (42), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 29 [2024-11-14 03:53:37,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:37,735 INFO L225 Difference]: With dead ends: 44 [2024-11-14 03:53:37,735 INFO L226 Difference]: Without dead ends: 42 [2024-11-14 03:53:37,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 42.8s TimeCoverageRelationStatistics Valid=303, Invalid=5103, Unknown=4, NotChecked=290, Total=5700 [2024-11-14 03:53:37,741 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 29 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:37,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 170 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-14 03:53:37,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-14 03:53:37,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2024-11-14 03:53:37,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 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-11-14 03:53:37,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2024-11-14 03:53:37,759 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 29 [2024-11-14 03:53:37,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:37,759 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2024-11-14 03:53:37,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 34 states have internal predecessors, (42), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 03:53:37,760 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2024-11-14 03:53:37,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-14 03:53:37,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:37,761 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] [2024-11-14 03:53:37,776 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-14 03:53:37,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:53:37,961 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:53:37,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:37,962 INFO L85 PathProgramCache]: Analyzing trace with hash -878146483, now seen corresponding path program 1 times [2024-11-14 03:53:37,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:37,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816524292] [2024-11-14 03:53:37,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:37,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:43,215 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:53:43,215 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:43,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816524292] [2024-11-14 03:53:43,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816524292] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:53:43,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920713618] [2024-11-14 03:53:43,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:43,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:53:43,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:53:43,217 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:53:43,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-14 03:53:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:43,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 139 conjuncts are in the unsatisfiable core [2024-11-14 03:53:43,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:53:43,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:53:44,378 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-11-14 03:53:44,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-14 03:53:44,601 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 7 treesize of output 3 [2024-11-14 03:53:46,762 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_80| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_80| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_80| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_80| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_80| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) (= |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) (or (= (select (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (exists ((|v_#memory_int_BEFORE_CALL_132| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int_BEFORE_CALL_132| |c_#memory_int|))) (and (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| .cse1) (= (select (select |v_#memory_int_BEFORE_CALL_132| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= (store |v_#memory_int_BEFORE_CALL_132| .cse1 (select |c_#memory_int| .cse1)) |c_#memory_int|))))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (<= (+ 1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) |c_#StackHeapBarrier|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2024-11-14 03:53:46,767 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_80| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_80| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_80| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_80| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_80| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) (= |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) (or (= (select (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (exists ((|v_#memory_int_BEFORE_CALL_132| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int_BEFORE_CALL_132| |c_#memory_int|))) (and (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| .cse1) (= (select (select |v_#memory_int_BEFORE_CALL_132| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= (store |v_#memory_int_BEFORE_CALL_132| .cse1 (select |c_#memory_int| .cse1)) |c_#memory_int|))))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (<= (+ 1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) |c_#StackHeapBarrier|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from true [2024-11-14 03:53:46,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-11-14 03:53:46,870 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 03:53:46,871 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 141 treesize of output 124 [2024-11-14 03:53:47,059 INFO L349 Elim1Store]: treesize reduction 50, result has 35.1 percent of original size [2024-11-14 03:53:47,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 117 [2024-11-14 03:53:47,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2024-11-14 03:53:47,177 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 52 treesize of output 19 [2024-11-14 03:53:47,184 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 19 treesize of output 15 [2024-11-14 03:53:47,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2024-11-14 03:53:47,260 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-14 03:53:47,260 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 1 case distinctions, treesize of input 24 treesize of output 19 [2024-11-14 03:53:47,329 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse0 (= .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) .cse0) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (let ((.cse6 (select |c_#memory_int| .cse2))) (let ((.cse3 (select .cse6 8))) (or (exists ((|v_#memory_int_323| (Array Int (Array Int Int))) (v_ArrVal_1698 (Array Int Int))) (and (= |c_#memory_int| (let ((.cse1 (store |v_#memory_int_323| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1698))) (store .cse1 .cse2 (store (select .cse1 .cse2) 8 .cse3)))) (exists ((|v_#memory_int_BEFORE_CALL_132| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int_BEFORE_CALL_132| |v_#memory_int_323|))) (and (= (store |v_#memory_int_BEFORE_CALL_132| .cse4 (select |v_#memory_int_323| .cse4)) |v_#memory_int_323|) (= .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |v_#memory_int_BEFORE_CALL_132| .cse2) 0) 1)))))) (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_DerPreprocessor_5) .cse2 v_DerPreprocessor_6) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (= (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse5) (= (store .cse5 8 .cse3) v_DerPreprocessor_6)))) (= (select .cse6 0) 1)) .cse0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= (+ .cse2 1) |c_#StackHeapBarrier|) (not (= .cse2 0)) (exists ((|v_old(#valid)_AFTER_CALL_80| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_80| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_80| .cse2) 1) (= |c_#valid| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_80| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_80| .cse7 (select |c_#valid| .cse7)))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2024-11-14 03:53:47,336 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse0 (= .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) .cse0) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (let ((.cse6 (select |c_#memory_int| .cse2))) (let ((.cse3 (select .cse6 8))) (or (exists ((|v_#memory_int_323| (Array Int (Array Int Int))) (v_ArrVal_1698 (Array Int Int))) (and (= |c_#memory_int| (let ((.cse1 (store |v_#memory_int_323| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1698))) (store .cse1 .cse2 (store (select .cse1 .cse2) 8 .cse3)))) (exists ((|v_#memory_int_BEFORE_CALL_132| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int_BEFORE_CALL_132| |v_#memory_int_323|))) (and (= (store |v_#memory_int_BEFORE_CALL_132| .cse4 (select |v_#memory_int_323| .cse4)) |v_#memory_int_323|) (= .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |v_#memory_int_BEFORE_CALL_132| .cse2) 0) 1)))))) (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_DerPreprocessor_5) .cse2 v_DerPreprocessor_6) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (= (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse5) (= (store .cse5 8 .cse3) v_DerPreprocessor_6)))) (= (select .cse6 0) 1)) .cse0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= (+ .cse2 1) |c_#StackHeapBarrier|) (not (= .cse2 0)) (exists ((|v_old(#valid)_AFTER_CALL_80| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_80| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_80| .cse2) 1) (= |c_#valid| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_80| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_80| .cse7 (select |c_#valid| .cse7)))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from true [2024-11-14 03:53:49,548 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (let ((.cse3 (= .cse0 .cse1))) (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) (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse1) 1) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (exists ((|v_old(#valid)_AFTER_CALL_80| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_80| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_80| .cse1) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_80| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_80| .cse2 (select |c_#valid| .cse2)))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (let ((.cse6 (select |c_#memory_int| .cse0))) (let ((.cse4 (select .cse6 8))) (or .cse3 (exists ((|v_#memory_int_323| (Array Int (Array Int Int))) (v_ArrVal_1698 (Array Int Int))) (and (= (store (store |v_#memory_int_323| .cse1 v_ArrVal_1698) .cse0 (store (select |v_#memory_int_323| .cse0) 8 .cse4)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_132| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_#memory_int_BEFORE_CALL_132| |v_#memory_int_323|))) (and (= (store |v_#memory_int_BEFORE_CALL_132| .cse5 (select |v_#memory_int_323| .cse5)) |v_#memory_int_323|) (= .cse5 .cse1) (= (select (select |v_#memory_int_BEFORE_CALL_132| .cse0) 0) 1)))))) (and (= (select .cse6 0) 1) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| .cse1 v_DerPreprocessor_5) .cse0 v_DerPreprocessor_6) .cse1))) (and (= (select |c_#memory_int| .cse1) .cse7) (= (store .cse7 8 .cse4) v_DerPreprocessor_6)))))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (or .cse3 (= (select (select |c_#memory_$Pointer$.offset| .cse1) 4) 0)))))) is different from false [2024-11-14 03:53:49,557 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (let ((.cse3 (= .cse0 .cse1))) (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) (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse1) 1) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (exists ((|v_old(#valid)_AFTER_CALL_80| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_80| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_80| .cse1) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_80| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_80| .cse2 (select |c_#valid| .cse2)))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (let ((.cse6 (select |c_#memory_int| .cse0))) (let ((.cse4 (select .cse6 8))) (or .cse3 (exists ((|v_#memory_int_323| (Array Int (Array Int Int))) (v_ArrVal_1698 (Array Int Int))) (and (= (store (store |v_#memory_int_323| .cse1 v_ArrVal_1698) .cse0 (store (select |v_#memory_int_323| .cse0) 8 .cse4)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_132| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_#memory_int_BEFORE_CALL_132| |v_#memory_int_323|))) (and (= (store |v_#memory_int_BEFORE_CALL_132| .cse5 (select |v_#memory_int_323| .cse5)) |v_#memory_int_323|) (= .cse5 .cse1) (= (select (select |v_#memory_int_BEFORE_CALL_132| .cse0) 0) 1)))))) (and (= (select .cse6 0) 1) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| .cse1 v_DerPreprocessor_5) .cse0 v_DerPreprocessor_6) .cse1))) (and (= (select |c_#memory_int| .cse1) .cse7) (= (store .cse7 8 .cse4) v_DerPreprocessor_6)))))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (or .cse3 (= (select (select |c_#memory_$Pointer$.offset| .cse1) 4) 0)))))) is different from true [2024-11-14 03:53:49,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:53:49,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 274 treesize of output 125 [2024-11-14 03:53:49,692 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:53:49,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2024-11-14 03:53:49,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:53:49,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2024-11-14 03:53:49,829 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((v_arrayElimIndex_18 Int) (v_arrayElimCell_103 Int) (|v_old(#valid)_AFTER_CALL_80| (Array Int Int)) (|v_#valid_BEFORE_CALL_141| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_80| v_arrayElimCell_103)) (= |v_#valid_BEFORE_CALL_141| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_80| |v_#valid_BEFORE_CALL_141|))) (store |v_old(#valid)_AFTER_CALL_80| .cse0 (select |v_#valid_BEFORE_CALL_141| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_80| v_arrayElimIndex_18) 0) (not (= v_arrayElimCell_103 0)) (<= (+ v_arrayElimCell_103 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_141| v_arrayElimIndex_18) 1)))) is different from false [2024-11-14 03:53:49,836 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((v_arrayElimIndex_18 Int) (v_arrayElimCell_103 Int) (|v_old(#valid)_AFTER_CALL_80| (Array Int Int)) (|v_#valid_BEFORE_CALL_141| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_80| v_arrayElimCell_103)) (= |v_#valid_BEFORE_CALL_141| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_80| |v_#valid_BEFORE_CALL_141|))) (store |v_old(#valid)_AFTER_CALL_80| .cse0 (select |v_#valid_BEFORE_CALL_141| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_80| v_arrayElimIndex_18) 0) (not (= v_arrayElimCell_103 0)) (<= (+ v_arrayElimCell_103 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_141| v_arrayElimIndex_18) 1)))) is different from true [2024-11-14 03:53:49,945 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((v_arrayElimIndex_18 Int) (v_arrayElimCell_103 Int) (|v_old(#valid)_AFTER_CALL_80| (Array Int Int)) (|v_#valid_BEFORE_CALL_141| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_80| v_arrayElimCell_103)) (= |v_#valid_BEFORE_CALL_141| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_80| |v_#valid_BEFORE_CALL_141|))) (store |v_old(#valid)_AFTER_CALL_80| .cse0 (select |v_#valid_BEFORE_CALL_141| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_80| v_arrayElimIndex_18) 0) (not (= v_arrayElimCell_103 0)) (<= (+ v_arrayElimCell_103 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_141| v_arrayElimIndex_18) 1)))) is different from false [2024-11-14 03:53:49,950 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((v_arrayElimIndex_18 Int) (v_arrayElimCell_103 Int) (|v_old(#valid)_AFTER_CALL_80| (Array Int Int)) (|v_#valid_BEFORE_CALL_141| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_80| v_arrayElimCell_103)) (= |v_#valid_BEFORE_CALL_141| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_80| |v_#valid_BEFORE_CALL_141|))) (store |v_old(#valid)_AFTER_CALL_80| .cse0 (select |v_#valid_BEFORE_CALL_141| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_80| v_arrayElimIndex_18) 0) (not (= v_arrayElimCell_103 0)) (<= (+ v_arrayElimCell_103 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_141| v_arrayElimIndex_18) 1)))) is different from true [2024-11-14 03:53:50,043 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) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_#res#1.base| (select |c_#memory_int| |c_node_create_#res#1.base|)) |c_#memory_int|) (exists ((v_arrayElimIndex_18 Int) (v_arrayElimCell_103 Int) (|v_old(#valid)_AFTER_CALL_80| (Array Int Int)) (|v_#valid_BEFORE_CALL_141| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_80| v_arrayElimCell_103)) (= |v_#valid_BEFORE_CALL_141| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_80| |v_#valid_BEFORE_CALL_141|))) (store |v_old(#valid)_AFTER_CALL_80| .cse0 (select |v_#valid_BEFORE_CALL_141| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_80| v_arrayElimIndex_18) 0) (not (= v_arrayElimCell_103 0)) (<= (+ v_arrayElimCell_103 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_141| v_arrayElimIndex_18) 1)))) is different from false [2024-11-14 03:53:50,048 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) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_#res#1.base| (select |c_#memory_int| |c_node_create_#res#1.base|)) |c_#memory_int|) (exists ((v_arrayElimIndex_18 Int) (v_arrayElimCell_103 Int) (|v_old(#valid)_AFTER_CALL_80| (Array Int Int)) (|v_#valid_BEFORE_CALL_141| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_80| v_arrayElimCell_103)) (= |v_#valid_BEFORE_CALL_141| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_80| |v_#valid_BEFORE_CALL_141|))) (store |v_old(#valid)_AFTER_CALL_80| .cse0 (select |v_#valid_BEFORE_CALL_141| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_80| v_arrayElimIndex_18) 0) (not (= v_arrayElimCell_103 0)) (<= (+ v_arrayElimCell_103 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_141| v_arrayElimIndex_18) 1)))) is different from true [2024-11-14 03:53:50,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:53:50,249 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-14 03:53:50,249 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 282 treesize of output 187 [2024-11-14 03:53:50,369 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 8 treesize of output 1 [2024-11-14 03:53:50,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:53:50,512 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-11-14 03:53:50,512 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 51 treesize of output 59 [2024-11-14 03:53:50,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:53:50,661 INFO L349 Elim1Store]: treesize reduction 33, result has 34.0 percent of original size [2024-11-14 03:53:50,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 49 [2024-11-14 03:53:50,859 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (let ((.cse1 (= .cse0 .cse2))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 0)) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (<= (+ |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse1 (= (select (select |c_#memory_int| .cse0) 0) 1) (= .cse0 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2) .cse1 (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0)) (exists ((v_arrayElimIndex_18 Int) (v_arrayElimCell_103 Int) (|v_#valid_BEFORE_CALL_141| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_141| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_82| |v_#valid_BEFORE_CALL_141|))) (store |v_old(#valid)_AFTER_CALL_82| .cse3 (select |v_#valid_BEFORE_CALL_141| .cse3)))) (not (= v_arrayElimCell_103 0)) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimCell_103) 1) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimIndex_18) 0) (= (select |v_#valid_BEFORE_CALL_141| v_arrayElimIndex_18) 1) (<= (+ 2 v_arrayElimCell_103) |c_ULTIMATE.start_main_~#s~0#1.base|))) (exists ((|v_old(#valid)_AFTER_CALL_80| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (and (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_80| |v_old(#valid)_AFTER_CALL_81|))) (store |v_old(#valid)_AFTER_CALL_80| .cse4 (select |v_old(#valid)_AFTER_CALL_81| .cse4))) |v_old(#valid)_AFTER_CALL_81|) (= (select |v_old(#valid)_AFTER_CALL_80| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_81| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_80| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0))) (= (select (select |c_#memory_$Pointer$.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-11-14 03:53:50,865 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (let ((.cse1 (= .cse0 .cse2))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 0)) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (<= (+ |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse1 (= (select (select |c_#memory_int| .cse0) 0) 1) (= .cse0 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2) .cse1 (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0)) (exists ((v_arrayElimIndex_18 Int) (v_arrayElimCell_103 Int) (|v_#valid_BEFORE_CALL_141| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_141| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_82| |v_#valid_BEFORE_CALL_141|))) (store |v_old(#valid)_AFTER_CALL_82| .cse3 (select |v_#valid_BEFORE_CALL_141| .cse3)))) (not (= v_arrayElimCell_103 0)) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimCell_103) 1) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimIndex_18) 0) (= (select |v_#valid_BEFORE_CALL_141| v_arrayElimIndex_18) 1) (<= (+ 2 v_arrayElimCell_103) |c_ULTIMATE.start_main_~#s~0#1.base|))) (exists ((|v_old(#valid)_AFTER_CALL_80| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (and (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_80| |v_old(#valid)_AFTER_CALL_81|))) (store |v_old(#valid)_AFTER_CALL_80| .cse4 (select |v_old(#valid)_AFTER_CALL_81| .cse4))) |v_old(#valid)_AFTER_CALL_81|) (= (select |v_old(#valid)_AFTER_CALL_80| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_81| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_80| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0))) (= (select (select |c_#memory_$Pointer$.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-11-14 03:53:51,141 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (let ((.cse1 (= .cse0 .cse2))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (or .cse1 (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0)) (<= (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse1 (= (select (select |c_#memory_int| .cse0) 0) 1) (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (exists ((v_arrayElimIndex_18 Int) (v_arrayElimCell_103 Int) (|v_#valid_BEFORE_CALL_141| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_141| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_82| |v_#valid_BEFORE_CALL_141|))) (store |v_old(#valid)_AFTER_CALL_82| .cse3 (select |v_#valid_BEFORE_CALL_141| .cse3)))) (not (= v_arrayElimCell_103 0)) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimCell_103) 1) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimIndex_18) 0) (= (select |v_#valid_BEFORE_CALL_141| v_arrayElimIndex_18) 1) (<= (+ 2 v_arrayElimCell_103) |c_ULTIMATE.start_main_~#s~0#1.base|))) (exists ((|v_old(#valid)_AFTER_CALL_80| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (and (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_80| |v_old(#valid)_AFTER_CALL_81|))) (store |v_old(#valid)_AFTER_CALL_80| .cse4 (select |v_old(#valid)_AFTER_CALL_81| .cse4))) |v_old(#valid)_AFTER_CALL_81|) (= (select |v_old(#valid)_AFTER_CALL_80| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_81| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_80| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$.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-11-14 03:53:51,150 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (let ((.cse1 (= .cse0 .cse2))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (or .cse1 (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0)) (<= (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse1 (= (select (select |c_#memory_int| .cse0) 0) 1) (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (exists ((v_arrayElimIndex_18 Int) (v_arrayElimCell_103 Int) (|v_#valid_BEFORE_CALL_141| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_141| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_82| |v_#valid_BEFORE_CALL_141|))) (store |v_old(#valid)_AFTER_CALL_82| .cse3 (select |v_#valid_BEFORE_CALL_141| .cse3)))) (not (= v_arrayElimCell_103 0)) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimCell_103) 1) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimIndex_18) 0) (= (select |v_#valid_BEFORE_CALL_141| v_arrayElimIndex_18) 1) (<= (+ 2 v_arrayElimCell_103) |c_ULTIMATE.start_main_~#s~0#1.base|))) (exists ((|v_old(#valid)_AFTER_CALL_80| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (and (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_80| |v_old(#valid)_AFTER_CALL_81|))) (store |v_old(#valid)_AFTER_CALL_80| .cse4 (select |v_old(#valid)_AFTER_CALL_81| .cse4))) |v_old(#valid)_AFTER_CALL_81|) (= (select |v_old(#valid)_AFTER_CALL_80| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_81| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_80| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$.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-11-14 03:53:51,422 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (let ((.cse1 (= .cse0 .cse2))) (and (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (or .cse1 (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0)) (<= (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse1 (= (select (select |c_#memory_int| .cse0) 0) 1) (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (exists ((v_arrayElimIndex_18 Int) (v_arrayElimCell_103 Int) (|v_#valid_BEFORE_CALL_141| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_141| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_82| |v_#valid_BEFORE_CALL_141|))) (store |v_old(#valid)_AFTER_CALL_82| .cse3 (select |v_#valid_BEFORE_CALL_141| .cse3)))) (not (= v_arrayElimCell_103 0)) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimCell_103) 1) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimIndex_18) 0) (= (select |v_#valid_BEFORE_CALL_141| v_arrayElimIndex_18) 1) (<= (+ 2 v_arrayElimCell_103) |c_ULTIMATE.start_main_~#s~0#1.base|))) (exists ((|v_old(#valid)_AFTER_CALL_80| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (and (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_80| |v_old(#valid)_AFTER_CALL_81|))) (store |v_old(#valid)_AFTER_CALL_80| .cse4 (select |v_old(#valid)_AFTER_CALL_81| .cse4))) |v_old(#valid)_AFTER_CALL_81|) (= (select |v_old(#valid)_AFTER_CALL_80| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_81| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_80| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2))))) is different from false [2024-11-14 03:53:51,430 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (let ((.cse1 (= .cse0 .cse2))) (and (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (or .cse1 (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0)) (<= (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse1 (= (select (select |c_#memory_int| .cse0) 0) 1) (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (exists ((v_arrayElimIndex_18 Int) (v_arrayElimCell_103 Int) (|v_#valid_BEFORE_CALL_141| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_141| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_82| |v_#valid_BEFORE_CALL_141|))) (store |v_old(#valid)_AFTER_CALL_82| .cse3 (select |v_#valid_BEFORE_CALL_141| .cse3)))) (not (= v_arrayElimCell_103 0)) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimCell_103) 1) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimIndex_18) 0) (= (select |v_#valid_BEFORE_CALL_141| v_arrayElimIndex_18) 1) (<= (+ 2 v_arrayElimCell_103) |c_ULTIMATE.start_main_~#s~0#1.base|))) (exists ((|v_old(#valid)_AFTER_CALL_80| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (and (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_80| |v_old(#valid)_AFTER_CALL_81|))) (store |v_old(#valid)_AFTER_CALL_80| .cse4 (select |v_old(#valid)_AFTER_CALL_81| .cse4))) |v_old(#valid)_AFTER_CALL_81|) (= (select |v_old(#valid)_AFTER_CALL_80| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_81| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_80| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2))))) is different from true [2024-11-14 03:53:51,913 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (let ((.cse1 (= .cse0 .cse2)) (.cse3 (select (select |c_#memory_$Pointer$.offset| .cse2) 4))) (and (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (or .cse1 (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= .cse3 0)) (<= (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse0 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (or .cse1 (= (select (select |c_#memory_int| .cse0) 0) 1) (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (exists ((v_arrayElimIndex_18 Int) (v_arrayElimCell_103 Int) (|v_#valid_BEFORE_CALL_141| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_141| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_82| |v_#valid_BEFORE_CALL_141|))) (store |v_old(#valid)_AFTER_CALL_82| .cse4 (select |v_#valid_BEFORE_CALL_141| .cse4)))) (not (= v_arrayElimCell_103 0)) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimCell_103) 1) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimIndex_18) 0) (= (select |v_#valid_BEFORE_CALL_141| v_arrayElimIndex_18) 1) (<= (+ 2 v_arrayElimCell_103) |c_ULTIMATE.start_main_~#s~0#1.base|))) (exists ((|v_old(#valid)_AFTER_CALL_80| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (and (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_80| |v_old(#valid)_AFTER_CALL_81|))) (store |v_old(#valid)_AFTER_CALL_80| .cse5 (select |v_old(#valid)_AFTER_CALL_81| .cse5))) |v_old(#valid)_AFTER_CALL_81|) (= (select |v_old(#valid)_AFTER_CALL_80| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_81| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_80| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= .cse3 |c_ULTIMATE.start_dll_append_~last~0#1.offset|))))) is different from false [2024-11-14 03:53:51,919 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (let ((.cse1 (= .cse0 .cse2)) (.cse3 (select (select |c_#memory_$Pointer$.offset| .cse2) 4))) (and (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (or .cse1 (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= .cse3 0)) (<= (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse0 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (or .cse1 (= (select (select |c_#memory_int| .cse0) 0) 1) (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (exists ((v_arrayElimIndex_18 Int) (v_arrayElimCell_103 Int) (|v_#valid_BEFORE_CALL_141| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_141| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_82| |v_#valid_BEFORE_CALL_141|))) (store |v_old(#valid)_AFTER_CALL_82| .cse4 (select |v_#valid_BEFORE_CALL_141| .cse4)))) (not (= v_arrayElimCell_103 0)) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimCell_103) 1) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimIndex_18) 0) (= (select |v_#valid_BEFORE_CALL_141| v_arrayElimIndex_18) 1) (<= (+ 2 v_arrayElimCell_103) |c_ULTIMATE.start_main_~#s~0#1.base|))) (exists ((|v_old(#valid)_AFTER_CALL_80| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (and (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_80| |v_old(#valid)_AFTER_CALL_81|))) (store |v_old(#valid)_AFTER_CALL_80| .cse5 (select |v_old(#valid)_AFTER_CALL_81| .cse5))) |v_old(#valid)_AFTER_CALL_81|) (= (select |v_old(#valid)_AFTER_CALL_80| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_81| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_80| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= .cse3 |c_ULTIMATE.start_dll_append_~last~0#1.offset|))))) is different from true [2024-11-14 03:53:52,515 INFO L349 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2024-11-14 03:53:52,516 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 284 treesize of output 147 [2024-11-14 03:53:52,643 INFO L349 Elim1Store]: treesize reduction 84, result has 16.0 percent of original size [2024-11-14 03:53:52,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 408 treesize of output 237 [2024-11-14 03:53:52,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 54 [2024-11-14 03:53:52,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:53:52,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 35 [2024-11-14 03:53:52,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:53:52,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:53:52,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:53:52,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 118 [2024-11-14 03:53:52,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:53:52,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:53:52,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:53:52,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:53:52,800 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 03:53:52,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 87 [2024-11-14 03:53:52,990 INFO L349 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2024-11-14 03:53:52,990 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 202 treesize of output 127 [2024-11-14 03:53:53,004 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 03:53:53,029 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 0)) (or (= .cse0 .cse1) (= (select (select |c_#memory_int| .cse0) 0) 1)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 4) 0) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.offset_41| Int) (|v_old(#valid)_AFTER_CALL_80| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse3 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_41| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) .cse3))) (and (= (select |v_old(#valid)_AFTER_CALL_81| .cse2) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse3) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_80| |v_old(#valid)_AFTER_CALL_81|))) (store |v_old(#valid)_AFTER_CALL_80| .cse4 (select |v_old(#valid)_AFTER_CALL_81| .cse4))) |v_old(#valid)_AFTER_CALL_81|) (= (select |v_old(#valid)_AFTER_CALL_80| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_81| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_80| .cse1) 0) (<= (+ 2 .cse2) |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |v_ULTIMATE.start_dll_append_~last~0#1.offset_41|))))) (exists ((v_arrayElimIndex_18 Int) (v_arrayElimCell_103 Int) (|v_#valid_BEFORE_CALL_141| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_141| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_82| |v_#valid_BEFORE_CALL_141|))) (store |v_old(#valid)_AFTER_CALL_82| .cse5 (select |v_#valid_BEFORE_CALL_141| .cse5)))) (not (= v_arrayElimCell_103 0)) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimCell_103) 1) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimIndex_18) 0) (= (select |v_#valid_BEFORE_CALL_141| v_arrayElimIndex_18) 1) (<= (+ 2 v_arrayElimCell_103) |c_ULTIMATE.start_main_~#s~0#1.base|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2024-11-14 03:53:53,038 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 0)) (or (= .cse0 .cse1) (= (select (select |c_#memory_int| .cse0) 0) 1)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 4) 0) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.offset_41| Int) (|v_old(#valid)_AFTER_CALL_80| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse3 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_41| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) .cse3))) (and (= (select |v_old(#valid)_AFTER_CALL_81| .cse2) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse3) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_80| |v_old(#valid)_AFTER_CALL_81|))) (store |v_old(#valid)_AFTER_CALL_80| .cse4 (select |v_old(#valid)_AFTER_CALL_81| .cse4))) |v_old(#valid)_AFTER_CALL_81|) (= (select |v_old(#valid)_AFTER_CALL_80| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_81| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_80| .cse1) 0) (<= (+ 2 .cse2) |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |v_ULTIMATE.start_dll_append_~last~0#1.offset_41|))))) (exists ((v_arrayElimIndex_18 Int) (v_arrayElimCell_103 Int) (|v_#valid_BEFORE_CALL_141| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_141| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_82| |v_#valid_BEFORE_CALL_141|))) (store |v_old(#valid)_AFTER_CALL_82| .cse5 (select |v_#valid_BEFORE_CALL_141| .cse5)))) (not (= v_arrayElimCell_103 0)) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimCell_103) 1) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimIndex_18) 0) (= (select |v_#valid_BEFORE_CALL_141| v_arrayElimIndex_18) 1) (<= (+ 2 v_arrayElimCell_103) |c_ULTIMATE.start_main_~#s~0#1.base|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2024-11-14 03:53:53,451 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.offset_41| Int) (v_arrayElimIndex_18 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimCell_103 Int) (|v_old(#valid)_AFTER_CALL_80| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int)) (|v_#valid_BEFORE_CALL_141| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4)) (.cse5 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_41| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) .cse5))) (and (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_80| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_80| |v_old(#valid)_AFTER_CALL_81|))) (store |v_old(#valid)_AFTER_CALL_80| .cse1 (select |v_old(#valid)_AFTER_CALL_81| .cse1))) |v_old(#valid)_AFTER_CALL_81|) (not (= .cse2 0)) (<= (+ 2 .cse2) |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ .cse3 2) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int| .cse2) 0) 1) (= |v_#valid_BEFORE_CALL_141| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_82| |v_#valid_BEFORE_CALL_141|))) (store |v_old(#valid)_AFTER_CALL_82| .cse4 (select |v_#valid_BEFORE_CALL_141| .cse4)))) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_81| .cse0) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_81| .cse3) 0) (<= 0 |v_ULTIMATE.start_dll_append_~last~0#1.offset_41|) (not (= v_arrayElimCell_103 0)) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimCell_103) 1) (= (select |v_old(#valid)_AFTER_CALL_80| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimIndex_18) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse5) 0) (= (select |v_#valid_BEFORE_CALL_141| v_arrayElimIndex_18) 1) (<= (+ 2 v_arrayElimCell_103) |ULTIMATE.start_main_~#s~0#1.base|)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2024-11-14 03:53:53,458 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.offset_41| Int) (v_arrayElimIndex_18 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimCell_103 Int) (|v_old(#valid)_AFTER_CALL_80| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int)) (|v_#valid_BEFORE_CALL_141| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4)) (.cse5 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_41| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) .cse5))) (and (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_80| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_80| |v_old(#valid)_AFTER_CALL_81|))) (store |v_old(#valid)_AFTER_CALL_80| .cse1 (select |v_old(#valid)_AFTER_CALL_81| .cse1))) |v_old(#valid)_AFTER_CALL_81|) (not (= .cse2 0)) (<= (+ 2 .cse2) |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ .cse3 2) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int| .cse2) 0) 1) (= |v_#valid_BEFORE_CALL_141| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_82| |v_#valid_BEFORE_CALL_141|))) (store |v_old(#valid)_AFTER_CALL_82| .cse4 (select |v_#valid_BEFORE_CALL_141| .cse4)))) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_81| .cse0) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_81| .cse3) 0) (<= 0 |v_ULTIMATE.start_dll_append_~last~0#1.offset_41|) (not (= v_arrayElimCell_103 0)) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimCell_103) 1) (= (select |v_old(#valid)_AFTER_CALL_80| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimIndex_18) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse5) 0) (= (select |v_#valid_BEFORE_CALL_141| v_arrayElimIndex_18) 1) (<= (+ 2 v_arrayElimCell_103) |ULTIMATE.start_main_~#s~0#1.base|)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2024-11-14 03:53:53,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:53:53,759 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 03:53:53,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 149 treesize of output 67 [2024-11-14 03:53:53,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:53:53,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:53:53,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:53:53,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2024-11-14 03:53:53,856 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)) (exists ((v_arrayElimCell_130 Int) (v_arrayElimIndex_27 Int) (|v_old(#valid)_AFTER_CALL_80| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_81| v_arrayElimIndex_27) 1) (= (select |v_old(#valid)_AFTER_CALL_81| v_arrayElimCell_130) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_80| |v_old(#valid)_AFTER_CALL_81|))) (store |v_old(#valid)_AFTER_CALL_80| .cse0 (select |v_old(#valid)_AFTER_CALL_81| .cse0))) |v_old(#valid)_AFTER_CALL_81|) (= (select |v_old(#valid)_AFTER_CALL_80| v_arrayElimIndex_27) 0) (= (select |v_old(#valid)_AFTER_CALL_80| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 1)) is different from false [2024-11-14 03:53:53,863 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)) (exists ((v_arrayElimCell_130 Int) (v_arrayElimIndex_27 Int) (|v_old(#valid)_AFTER_CALL_80| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_81| v_arrayElimIndex_27) 1) (= (select |v_old(#valid)_AFTER_CALL_81| v_arrayElimCell_130) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_80| |v_old(#valid)_AFTER_CALL_81|))) (store |v_old(#valid)_AFTER_CALL_80| .cse0 (select |v_old(#valid)_AFTER_CALL_81| .cse0))) |v_old(#valid)_AFTER_CALL_81|) (= (select |v_old(#valid)_AFTER_CALL_80| v_arrayElimIndex_27) 0) (= (select |v_old(#valid)_AFTER_CALL_80| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 1)) is different from true [2024-11-14 03:53:54,021 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2024-11-14 03:53:54,021 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:53:54,324 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1712 (Array Int Int)) (v_ArrVal_1711 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (v_ArrVal_1709 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (or (not (= (store (select |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 (select v_ArrVal_1709 .cse0)) v_ArrVal_1709)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1712)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1710))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1709) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1711) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3)))))))) is different from false [2024-11-14 03:53:54,409 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1712 (Array Int Int)) (v_ArrVal_1711 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_43| Int) (v_ArrVal_1709 (Array Int Int))) (let ((.cse6 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse6)) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_43| 4))) (or (not (= (store (select |c_#memory_int| .cse0) .cse1 (select v_ArrVal_1709 .cse1)) v_ArrVal_1709)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1712)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1710))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1709) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1711) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4))))) (< |v_ULTIMATE.start_dll_append_~last~0#1.offset_43| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse6)))))) is different from false [2024-11-14 03:53:54,500 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1712 (Array Int Int)) (v_ArrVal_1711 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_43| Int) (v_ArrVal_1709 (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse7 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse6) .cse7)) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_43| 4))) (or (not (= v_ArrVal_1709 (store (select |c_#memory_int| .cse0) .cse1 (select v_ArrVal_1709 .cse1)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1712)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1710))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1709) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1711) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4))))) (< |v_ULTIMATE.start_dll_append_~last~0#1.offset_43| (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7)))))) is different from false [2024-11-14 03:53:54,551 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1712 (Array Int Int)) (v_ArrVal_1711 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_43| Int) (v_ArrVal_1709 (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse7 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse6) .cse7)) (.cse5 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_43| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse5 |c_ULTIMATE.start_dll_append_#t~ret7#1.offset|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1712)) (.cse1 (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse5 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1710))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1709) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1711) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))) (not (= v_ArrVal_1709 (store (select |c_#memory_int| .cse0) .cse5 (select v_ArrVal_1709 .cse5)))) (< |v_ULTIMATE.start_dll_append_~last~0#1.offset_43| (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7)))))) is different from false [2024-11-14 03:53:54,905 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1725 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_49| Int) (v_ArrVal_1712 (Array Int Int)) (v_ArrVal_1711 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_43| Int) (v_ArrVal_1709 (Array Int Int)) (v_ArrVal_1727 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_49| v_ArrVal_1725)) (.cse9 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_49| v_ArrVal_1727))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse2 (+ (select (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse3 (select (select .cse9 .cse1) .cse2)) (.cse4 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_43| 4))) (or (< |v_ULTIMATE.start_dll_append_~last~0#1.offset_43| (select (select .cse0 .cse1) .cse2)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_append_#t~ret7#1.base_49| 1)) (not (= (store (select (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_49| v_ArrVal_1726) .cse3) .cse4 (select v_ArrVal_1709 .cse4)) v_ArrVal_1709)) (= (let ((.cse8 (store (store |c_#memory_$Pointer$.offset| .cse3 (store (select .cse0 .cse3) .cse4 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_49| v_ArrVal_1712)) (.cse5 (store (store |c_#memory_$Pointer$.base| .cse3 (store (select .cse9 .cse3) .cse4 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_49|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_49| v_ArrVal_1710))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int| .cse3 v_ArrVal_1709) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_49| v_ArrVal_1711) (select (select .cse5 .cse6) .cse7)) (select (select .cse8 .cse6) .cse7)))) |c_ULTIMATE.start_main_~data~0#1|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_49|) 0))))))) is different from false [2024-11-14 03:53:54,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920713618] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:53:54,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2107362694] [2024-11-14 03:53:54,913 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-14 03:53:54,913 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:53:54,914 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:53:54,914 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:53:54,914 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:53:56,483 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 177 for LOIs [2024-11-14 03:53:56,639 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:54:23,363 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2243#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= 1 |#StackHeapBarrier|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|) 1)) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 03:54:23,363 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:54:23,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:54:23,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 45 [2024-11-14 03:54:23,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030630857] [2024-11-14 03:54:23,364 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 03:54:23,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-14 03:54:23,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:54:23,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-14 03:54:23,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=2224, Unknown=31, NotChecked=1998, Total=4422 [2024-11-14 03:54:23,366 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 45 states, 38 states have (on average 1.236842105263158) internal successors, (47), 35 states have internal predecessors, (47), 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-11-14 03:54:25,109 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (let ((.cse1 (= .cse3 1))) (and (exists ((|v_old(#valid)_AFTER_CALL_80| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_80| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_80| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_80| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_80| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) (= |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) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (or .cse1 (exists ((|v_#memory_int_BEFORE_CALL_132| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int_BEFORE_CALL_132| |c_#memory_int|))) (and (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| .cse2) (= (select (select |v_#memory_int_BEFORE_CALL_132| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= (store |v_#memory_int_BEFORE_CALL_132| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|))))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| .cse3) .cse1 (<= (+ 1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2024-11-14 03:54:25,114 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (let ((.cse1 (= .cse3 1))) (and (exists ((|v_old(#valid)_AFTER_CALL_80| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_80| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_80| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_80| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_80| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) (= |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) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (or .cse1 (exists ((|v_#memory_int_BEFORE_CALL_132| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int_BEFORE_CALL_132| |c_#memory_int|))) (and (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| .cse2) (= (select (select |v_#memory_int_BEFORE_CALL_132| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= (store |v_#memory_int_BEFORE_CALL_132| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|))))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| .cse3) .cse1 (<= (+ 1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from true [2024-11-14 03:54:25,125 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse8 (select |c_#memory_int| .cse3))) (let ((.cse1 (= .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse7 (select .cse8 0)) (.cse0 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))) (and (or .cse0 .cse1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (let ((.cse4 (select .cse8 8))) (or (exists ((|v_#memory_int_323| (Array Int (Array Int Int))) (v_ArrVal_1698 (Array Int Int))) (and (= |c_#memory_int| (let ((.cse2 (store |v_#memory_int_323| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1698))) (store .cse2 .cse3 (store (select .cse2 .cse3) 8 .cse4)))) (exists ((|v_#memory_int_BEFORE_CALL_132| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_#memory_int_BEFORE_CALL_132| |v_#memory_int_323|))) (and (= (store |v_#memory_int_BEFORE_CALL_132| .cse5 (select |v_#memory_int_323| .cse5)) |v_#memory_int_323|) (= .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |v_#memory_int_BEFORE_CALL_132| .cse3) 0) 1)))))) (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_DerPreprocessor_5) .cse3 v_DerPreprocessor_6) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (= (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6) (= (store .cse6 8 .cse4) v_DerPreprocessor_6)))) (= .cse7 1)) .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| .cse7) .cse0 (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= (+ .cse3 1) |c_#StackHeapBarrier|) (not (= .cse3 0)) (= (select |c_#valid| .cse3) 1) (exists ((|v_old(#valid)_AFTER_CALL_80| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_80| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_80| .cse3) 1) (= |c_#valid| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_80| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_80| .cse9 (select |c_#valid| .cse9)))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))))) is different from false [2024-11-14 03:54:25,131 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse8 (select |c_#memory_int| .cse3))) (let ((.cse1 (= .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse7 (select .cse8 0)) (.cse0 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))) (and (or .cse0 .cse1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (let ((.cse4 (select .cse8 8))) (or (exists ((|v_#memory_int_323| (Array Int (Array Int Int))) (v_ArrVal_1698 (Array Int Int))) (and (= |c_#memory_int| (let ((.cse2 (store |v_#memory_int_323| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1698))) (store .cse2 .cse3 (store (select .cse2 .cse3) 8 .cse4)))) (exists ((|v_#memory_int_BEFORE_CALL_132| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_#memory_int_BEFORE_CALL_132| |v_#memory_int_323|))) (and (= (store |v_#memory_int_BEFORE_CALL_132| .cse5 (select |v_#memory_int_323| .cse5)) |v_#memory_int_323|) (= .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |v_#memory_int_BEFORE_CALL_132| .cse3) 0) 1)))))) (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_DerPreprocessor_5) .cse3 v_DerPreprocessor_6) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (= (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6) (= (store .cse6 8 .cse4) v_DerPreprocessor_6)))) (= .cse7 1)) .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| .cse7) .cse0 (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= (+ .cse3 1) |c_#StackHeapBarrier|) (not (= .cse3 0)) (= (select |c_#valid| .cse3) 1) (exists ((|v_old(#valid)_AFTER_CALL_80| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_80| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_80| .cse3) 1) (= |c_#valid| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_80| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_80| .cse9 (select |c_#valid| .cse9)))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))))) is different from true [2024-11-14 03:54:27,141 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse11 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse4) 4)) (.cse2 (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) 4)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (= .cse3 .cse4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse1) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse3 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse4) 1) (<= (+ .cse3 1) |c_#StackHeapBarrier|) (exists ((|v_old(#valid)_AFTER_CALL_80| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_80| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_80| .cse4) 0) (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_80| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_80| .cse5 (select |c_#valid| .cse5)))))) (= (select |c_#valid| .cse2) 1) (not (= .cse1 |c_ULTIMATE.start_dll_append_~head#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 0)) (= (select .cse0 0) 0) (let ((.cse9 (select |c_#memory_int| .cse3))) (let ((.cse7 (select .cse9 8))) (or .cse6 (exists ((|v_#memory_int_323| (Array Int (Array Int Int))) (v_ArrVal_1698 (Array Int Int))) (and (= (store (store |v_#memory_int_323| .cse4 v_ArrVal_1698) .cse3 (store (select |v_#memory_int_323| .cse3) 8 .cse7)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_132| (Array Int (Array Int Int)))) (let ((.cse8 (@diff |v_#memory_int_BEFORE_CALL_132| |v_#memory_int_323|))) (and (= (store |v_#memory_int_BEFORE_CALL_132| .cse8 (select |v_#memory_int_323| .cse8)) |v_#memory_int_323|) (= .cse8 .cse4) (= (select (select |v_#memory_int_BEFORE_CALL_132| .cse3) 0) 1)))))) (and (= (select .cse9 0) 1) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_int| .cse4 v_DerPreprocessor_5) .cse3 v_DerPreprocessor_6) .cse4))) (and (= (select |c_#memory_int| .cse4) .cse10) (= (store .cse10 8 .cse7) v_DerPreprocessor_6)))))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (or .cse6 (= (select (select |c_#memory_$Pointer$.offset| .cse4) 4) 0))))))) is different from false [2024-11-14 03:54:27,148 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse11 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse4) 4)) (.cse2 (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) 4)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (= .cse3 .cse4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse1) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse3 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse4) 1) (<= (+ .cse3 1) |c_#StackHeapBarrier|) (exists ((|v_old(#valid)_AFTER_CALL_80| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_80| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_80| .cse4) 0) (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_80| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_80| .cse5 (select |c_#valid| .cse5)))))) (= (select |c_#valid| .cse2) 1) (not (= .cse1 |c_ULTIMATE.start_dll_append_~head#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 0)) (= (select .cse0 0) 0) (let ((.cse9 (select |c_#memory_int| .cse3))) (let ((.cse7 (select .cse9 8))) (or .cse6 (exists ((|v_#memory_int_323| (Array Int (Array Int Int))) (v_ArrVal_1698 (Array Int Int))) (and (= (store (store |v_#memory_int_323| .cse4 v_ArrVal_1698) .cse3 (store (select |v_#memory_int_323| .cse3) 8 .cse7)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_132| (Array Int (Array Int Int)))) (let ((.cse8 (@diff |v_#memory_int_BEFORE_CALL_132| |v_#memory_int_323|))) (and (= (store |v_#memory_int_BEFORE_CALL_132| .cse8 (select |v_#memory_int_323| .cse8)) |v_#memory_int_323|) (= .cse8 .cse4) (= (select (select |v_#memory_int_BEFORE_CALL_132| .cse3) 0) 1)))))) (and (= (select .cse9 0) 1) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_int| .cse4 v_DerPreprocessor_5) .cse3 v_DerPreprocessor_6) .cse4))) (and (= (select |c_#memory_int| .cse4) .cse10) (= (store .cse10 8 .cse7) v_DerPreprocessor_6)))))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (or .cse6 (= (select (select |c_#memory_$Pointer$.offset| .cse4) 4) 0))))))) is different from true [2024-11-14 03:54:27,156 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (not (= |c_node_create_~temp~0#1.base| 0)) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((v_arrayElimIndex_18 Int) (v_arrayElimCell_103 Int) (|v_old(#valid)_AFTER_CALL_80| (Array Int Int)) (|v_#valid_BEFORE_CALL_141| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_80| v_arrayElimCell_103)) (= |v_#valid_BEFORE_CALL_141| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_80| |v_#valid_BEFORE_CALL_141|))) (store |v_old(#valid)_AFTER_CALL_80| .cse0 (select |v_#valid_BEFORE_CALL_141| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_80| v_arrayElimIndex_18) 0) (not (= v_arrayElimCell_103 0)) (<= (+ v_arrayElimCell_103 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_141| v_arrayElimIndex_18) 1)))) is different from false [2024-11-14 03:54:27,161 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (not (= |c_node_create_~temp~0#1.base| 0)) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((v_arrayElimIndex_18 Int) (v_arrayElimCell_103 Int) (|v_old(#valid)_AFTER_CALL_80| (Array Int Int)) (|v_#valid_BEFORE_CALL_141| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_80| v_arrayElimCell_103)) (= |v_#valid_BEFORE_CALL_141| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_80| |v_#valid_BEFORE_CALL_141|))) (store |v_old(#valid)_AFTER_CALL_80| .cse0 (select |v_#valid_BEFORE_CALL_141| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_80| v_arrayElimIndex_18) 0) (not (= v_arrayElimCell_103 0)) (<= (+ v_arrayElimCell_103 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_141| v_arrayElimIndex_18) 1)))) is different from true [2024-11-14 03:54:27,174 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_int)| |c_#memory_int|))) (let ((.cse4 (store |c_old(#memory_int)| .cse0 (select |c_#memory_int| .cse0)))) (let ((.cse3 (@diff .cse4 |c_#memory_int|))) (let ((.cse5 (store .cse4 .cse3 (select |c_#memory_int| .cse3)))) (let ((.cse6 (@diff .cse5 |c_#memory_int|)) (.cse1 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse2 (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) (.cse9 (select |c_#memory_int| |c_node_create_#res#1.base|)) (.cse7 (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|)) (.cse8 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|))) (and (= |c_node_create_#res#1.offset| 0) (or (= |c_old(#memory_int)| |c_#memory_int|) (= (select |c_old(#valid)| .cse0) 0)) (or (= (select |c_old(#valid)| .cse1) 0) .cse2) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (or (= (select |c_old(#valid)| .cse3) 0) (= .cse4 |c_#memory_int|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_int| (store .cse5 .cse6 (select |c_#memory_int| .cse6))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse1 (select |c_#memory_$Pointer$.offset| .cse1))) (or .cse7 (= (select |c_old(#valid)| .cse8) 0)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse8 (select |c_#memory_$Pointer$.base| .cse8))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|))) (not (= |c_node_create_#res#1.base| 0)) (or (= .cse5 |c_#memory_int|) (= (select |c_old(#valid)| .cse6) 0)) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_#res#1.base| .cse9) |c_#memory_int|) (or (< .cse1 |c_#StackHeapBarrier|) .cse2) (= (select .cse9 0) |c_node_create_#in~data#1|) (or .cse7 (< .cse8 |c_#StackHeapBarrier|)) (exists ((v_arrayElimIndex_18 Int) (v_arrayElimCell_103 Int) (|v_old(#valid)_AFTER_CALL_80| (Array Int Int)) (|v_#valid_BEFORE_CALL_141| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_80| v_arrayElimCell_103)) (= |v_#valid_BEFORE_CALL_141| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_80| |v_#valid_BEFORE_CALL_141|))) (store |v_old(#valid)_AFTER_CALL_80| .cse10 (select |v_#valid_BEFORE_CALL_141| .cse10)))) (= (select |v_old(#valid)_AFTER_CALL_80| v_arrayElimIndex_18) 0) (not (= v_arrayElimCell_103 0)) (<= (+ v_arrayElimCell_103 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_141| v_arrayElimIndex_18) 1))))))))) is different from false [2024-11-14 03:54:27,185 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_int)| |c_#memory_int|))) (let ((.cse4 (store |c_old(#memory_int)| .cse0 (select |c_#memory_int| .cse0)))) (let ((.cse3 (@diff .cse4 |c_#memory_int|))) (let ((.cse5 (store .cse4 .cse3 (select |c_#memory_int| .cse3)))) (let ((.cse6 (@diff .cse5 |c_#memory_int|)) (.cse1 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse2 (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) (.cse9 (select |c_#memory_int| |c_node_create_#res#1.base|)) (.cse7 (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|)) (.cse8 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|))) (and (= |c_node_create_#res#1.offset| 0) (or (= |c_old(#memory_int)| |c_#memory_int|) (= (select |c_old(#valid)| .cse0) 0)) (or (= (select |c_old(#valid)| .cse1) 0) .cse2) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (or (= (select |c_old(#valid)| .cse3) 0) (= .cse4 |c_#memory_int|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_int| (store .cse5 .cse6 (select |c_#memory_int| .cse6))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse1 (select |c_#memory_$Pointer$.offset| .cse1))) (or .cse7 (= (select |c_old(#valid)| .cse8) 0)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse8 (select |c_#memory_$Pointer$.base| .cse8))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|))) (not (= |c_node_create_#res#1.base| 0)) (or (= .cse5 |c_#memory_int|) (= (select |c_old(#valid)| .cse6) 0)) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_#res#1.base| .cse9) |c_#memory_int|) (or (< .cse1 |c_#StackHeapBarrier|) .cse2) (= (select .cse9 0) |c_node_create_#in~data#1|) (or .cse7 (< .cse8 |c_#StackHeapBarrier|)) (exists ((v_arrayElimIndex_18 Int) (v_arrayElimCell_103 Int) (|v_old(#valid)_AFTER_CALL_80| (Array Int Int)) (|v_#valid_BEFORE_CALL_141| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_80| v_arrayElimCell_103)) (= |v_#valid_BEFORE_CALL_141| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_80| |v_#valid_BEFORE_CALL_141|))) (store |v_old(#valid)_AFTER_CALL_80| .cse10 (select |v_#valid_BEFORE_CALL_141| .cse10)))) (= (select |v_old(#valid)_AFTER_CALL_80| v_arrayElimIndex_18) 0) (not (= v_arrayElimCell_103 0)) (<= (+ v_arrayElimCell_103 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_141| v_arrayElimIndex_18) 1))))))))) is different from true [2024-11-14 03:54:27,207 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$.base| .cse4) 4))) (let ((.cse3 (= .cse0 .cse4)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse0 0)) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (<= (+ |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse3 (= (select (select |c_#memory_int| .cse0) 0) 1) (= .cse0 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2)) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse4) .cse3 (= (select (select |c_#memory_$Pointer$.offset| .cse4) 4) 0)) (exists ((v_arrayElimIndex_18 Int) (v_arrayElimCell_103 Int) (|v_#valid_BEFORE_CALL_141| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_141| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_82| |v_#valid_BEFORE_CALL_141|))) (store |v_old(#valid)_AFTER_CALL_82| .cse5 (select |v_#valid_BEFORE_CALL_141| .cse5)))) (not (= v_arrayElimCell_103 0)) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimCell_103) 1) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimIndex_18) 0) (= (select |v_#valid_BEFORE_CALL_141| v_arrayElimIndex_18) 1) (<= (+ 2 v_arrayElimCell_103) |c_ULTIMATE.start_main_~#s~0#1.base|))) (exists ((|v_old(#valid)_AFTER_CALL_80| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (and (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_80| |v_old(#valid)_AFTER_CALL_81|))) (store |v_old(#valid)_AFTER_CALL_80| .cse6 (select |v_old(#valid)_AFTER_CALL_81| .cse6))) |v_old(#valid)_AFTER_CALL_81|) (= (select |v_old(#valid)_AFTER_CALL_80| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_81| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_80| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= .cse1 |c_ULTIMATE.start_dll_append_~head#1.base|)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse1)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from false [2024-11-14 03:54:27,215 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$.base| .cse4) 4))) (let ((.cse3 (= .cse0 .cse4)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse0 0)) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (<= (+ |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse3 (= (select (select |c_#memory_int| .cse0) 0) 1) (= .cse0 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2)) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse4) .cse3 (= (select (select |c_#memory_$Pointer$.offset| .cse4) 4) 0)) (exists ((v_arrayElimIndex_18 Int) (v_arrayElimCell_103 Int) (|v_#valid_BEFORE_CALL_141| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_141| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_82| |v_#valid_BEFORE_CALL_141|))) (store |v_old(#valid)_AFTER_CALL_82| .cse5 (select |v_#valid_BEFORE_CALL_141| .cse5)))) (not (= v_arrayElimCell_103 0)) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimCell_103) 1) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimIndex_18) 0) (= (select |v_#valid_BEFORE_CALL_141| v_arrayElimIndex_18) 1) (<= (+ 2 v_arrayElimCell_103) |c_ULTIMATE.start_main_~#s~0#1.base|))) (exists ((|v_old(#valid)_AFTER_CALL_80| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (and (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_80| |v_old(#valid)_AFTER_CALL_81|))) (store |v_old(#valid)_AFTER_CALL_80| .cse6 (select |v_old(#valid)_AFTER_CALL_81| .cse6))) |v_old(#valid)_AFTER_CALL_81|) (= (select |v_old(#valid)_AFTER_CALL_80| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_81| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_80| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= .cse1 |c_ULTIMATE.start_dll_append_~head#1.base|)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse1)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from true [2024-11-14 03:54:27,232 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse3) 4))) (let ((.cse2 (= .cse1 .cse3)) (.cse4 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (not (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ .cse1 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (or .cse2 (= .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse3) 4) 0)) (= |c_ULTIMATE.start_dll_append_#t~mem8#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse4) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|)) (<= (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse4 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse1 0)) (= |c_ULTIMATE.start_dll_append_#t~mem8#1.base| .cse0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse2 (= (select (select |c_#memory_int| .cse1) 0) 1) (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (exists ((v_arrayElimIndex_18 Int) (v_arrayElimCell_103 Int) (|v_#valid_BEFORE_CALL_141| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_141| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_82| |v_#valid_BEFORE_CALL_141|))) (store |v_old(#valid)_AFTER_CALL_82| .cse5 (select |v_#valid_BEFORE_CALL_141| .cse5)))) (not (= v_arrayElimCell_103 0)) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimCell_103) 1) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimIndex_18) 0) (= (select |v_#valid_BEFORE_CALL_141| v_arrayElimIndex_18) 1) (<= (+ 2 v_arrayElimCell_103) |c_ULTIMATE.start_main_~#s~0#1.base|))) (exists ((|v_old(#valid)_AFTER_CALL_80| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (and (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_80| |v_old(#valid)_AFTER_CALL_81|))) (store |v_old(#valid)_AFTER_CALL_80| .cse6 (select |v_old(#valid)_AFTER_CALL_81| .cse6))) |v_old(#valid)_AFTER_CALL_81|) (= (select |v_old(#valid)_AFTER_CALL_80| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_81| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_80| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= .cse4 |c_ULTIMATE.start_dll_append_~head#1.base|)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from false [2024-11-14 03:54:27,240 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse3) 4))) (let ((.cse2 (= .cse1 .cse3)) (.cse4 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (not (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ .cse1 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (or .cse2 (= .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse3) 4) 0)) (= |c_ULTIMATE.start_dll_append_#t~mem8#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse4) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|)) (<= (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse4 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse1 0)) (= |c_ULTIMATE.start_dll_append_#t~mem8#1.base| .cse0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse2 (= (select (select |c_#memory_int| .cse1) 0) 1) (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (exists ((v_arrayElimIndex_18 Int) (v_arrayElimCell_103 Int) (|v_#valid_BEFORE_CALL_141| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_141| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_82| |v_#valid_BEFORE_CALL_141|))) (store |v_old(#valid)_AFTER_CALL_82| .cse5 (select |v_#valid_BEFORE_CALL_141| .cse5)))) (not (= v_arrayElimCell_103 0)) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimCell_103) 1) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimIndex_18) 0) (= (select |v_#valid_BEFORE_CALL_141| v_arrayElimIndex_18) 1) (<= (+ 2 v_arrayElimCell_103) |c_ULTIMATE.start_main_~#s~0#1.base|))) (exists ((|v_old(#valid)_AFTER_CALL_80| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (and (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_80| |v_old(#valid)_AFTER_CALL_81|))) (store |v_old(#valid)_AFTER_CALL_80| .cse6 (select |v_old(#valid)_AFTER_CALL_81| .cse6))) |v_old(#valid)_AFTER_CALL_81|) (= (select |v_old(#valid)_AFTER_CALL_80| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_81| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_80| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= .cse4 |c_ULTIMATE.start_dll_append_~head#1.base|)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from true [2024-11-14 03:54:27,258 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse7 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse3) 4))) (let ((.cse2 (= .cse1 .cse3)) (.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (and (not (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (<= (+ .cse1 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (or .cse2 (= .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse3) 4) 0)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (not (= .cse1 0)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| 0)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse2 (= (select (select |c_#memory_int| .cse1) 0) 1) (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (exists ((v_arrayElimIndex_18 Int) (v_arrayElimCell_103 Int) (|v_#valid_BEFORE_CALL_141| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_141| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_82| |v_#valid_BEFORE_CALL_141|))) (store |v_old(#valid)_AFTER_CALL_82| .cse5 (select |v_#valid_BEFORE_CALL_141| .cse5)))) (not (= v_arrayElimCell_103 0)) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimCell_103) 1) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimIndex_18) 0) (= (select |v_#valid_BEFORE_CALL_141| v_arrayElimIndex_18) 1) (<= (+ 2 v_arrayElimCell_103) |c_ULTIMATE.start_main_~#s~0#1.base|))) (exists ((|v_old(#valid)_AFTER_CALL_80| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (and (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_80| |v_old(#valid)_AFTER_CALL_81|))) (store |v_old(#valid)_AFTER_CALL_80| .cse6 (select |v_old(#valid)_AFTER_CALL_81| .cse6))) |v_old(#valid)_AFTER_CALL_81|) (= (select |v_old(#valid)_AFTER_CALL_80| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_81| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_80| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select .cse4 0) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse0) 0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3)))))) is different from false [2024-11-14 03:54:27,264 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse7 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse3) 4))) (let ((.cse2 (= .cse1 .cse3)) (.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (and (not (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (<= (+ .cse1 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (or .cse2 (= .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse3) 4) 0)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (not (= .cse1 0)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| 0)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse2 (= (select (select |c_#memory_int| .cse1) 0) 1) (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (exists ((v_arrayElimIndex_18 Int) (v_arrayElimCell_103 Int) (|v_#valid_BEFORE_CALL_141| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_141| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_82| |v_#valid_BEFORE_CALL_141|))) (store |v_old(#valid)_AFTER_CALL_82| .cse5 (select |v_#valid_BEFORE_CALL_141| .cse5)))) (not (= v_arrayElimCell_103 0)) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimCell_103) 1) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimIndex_18) 0) (= (select |v_#valid_BEFORE_CALL_141| v_arrayElimIndex_18) 1) (<= (+ 2 v_arrayElimCell_103) |c_ULTIMATE.start_main_~#s~0#1.base|))) (exists ((|v_old(#valid)_AFTER_CALL_80| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (and (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_80| |v_old(#valid)_AFTER_CALL_81|))) (store |v_old(#valid)_AFTER_CALL_80| .cse6 (select |v_old(#valid)_AFTER_CALL_81| .cse6))) |v_old(#valid)_AFTER_CALL_81|) (= (select |v_old(#valid)_AFTER_CALL_80| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_81| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_80| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select .cse4 0) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse0) 0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3)))))) is different from true [2024-11-14 03:54:27,289 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse6 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (let ((.cse1 (= .cse0 .cse2)) (.cse3 (select (select |c_#memory_$Pointer$.offset| .cse2) 4))) (and (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (or .cse1 (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= .cse3 0)) (<= (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.base|) (or (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| .cse4) 4))) (and (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4)) (not (= .cse5 4)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse5)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse4) 4))))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 0)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse0 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (or .cse1 (= (select (select |c_#memory_int| .cse0) 0) 1) (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (exists ((v_arrayElimIndex_18 Int) (v_arrayElimCell_103 Int) (|v_#valid_BEFORE_CALL_141| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_141| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_82| |v_#valid_BEFORE_CALL_141|))) (store |v_old(#valid)_AFTER_CALL_82| .cse7 (select |v_#valid_BEFORE_CALL_141| .cse7)))) (not (= v_arrayElimCell_103 0)) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimCell_103) 1) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimIndex_18) 0) (= (select |v_#valid_BEFORE_CALL_141| v_arrayElimIndex_18) 1) (<= (+ 2 v_arrayElimCell_103) |c_ULTIMATE.start_main_~#s~0#1.base|))) (exists ((|v_old(#valid)_AFTER_CALL_80| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (and (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_80| |v_old(#valid)_AFTER_CALL_81|))) (store |v_old(#valid)_AFTER_CALL_80| .cse8 (select |v_old(#valid)_AFTER_CALL_81| .cse8))) |v_old(#valid)_AFTER_CALL_81|) (= (select |v_old(#valid)_AFTER_CALL_80| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_81| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_80| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= .cse3 |c_ULTIMATE.start_dll_append_~last~0#1.offset|)))))) is different from false [2024-11-14 03:54:27,295 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse6 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (let ((.cse1 (= .cse0 .cse2)) (.cse3 (select (select |c_#memory_$Pointer$.offset| .cse2) 4))) (and (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (or .cse1 (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= .cse3 0)) (<= (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.base|) (or (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| .cse4) 4))) (and (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4)) (not (= .cse5 4)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse5)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse4) 4))))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 0)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse0 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (or .cse1 (= (select (select |c_#memory_int| .cse0) 0) 1) (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (exists ((v_arrayElimIndex_18 Int) (v_arrayElimCell_103 Int) (|v_#valid_BEFORE_CALL_141| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_141| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_82| |v_#valid_BEFORE_CALL_141|))) (store |v_old(#valid)_AFTER_CALL_82| .cse7 (select |v_#valid_BEFORE_CALL_141| .cse7)))) (not (= v_arrayElimCell_103 0)) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimCell_103) 1) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimIndex_18) 0) (= (select |v_#valid_BEFORE_CALL_141| v_arrayElimIndex_18) 1) (<= (+ 2 v_arrayElimCell_103) |c_ULTIMATE.start_main_~#s~0#1.base|))) (exists ((|v_old(#valid)_AFTER_CALL_80| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (and (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_80| |v_old(#valid)_AFTER_CALL_81|))) (store |v_old(#valid)_AFTER_CALL_80| .cse8 (select |v_old(#valid)_AFTER_CALL_81| .cse8))) |v_old(#valid)_AFTER_CALL_81|) (= (select |v_old(#valid)_AFTER_CALL_80| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_81| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_80| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= .cse3 |c_ULTIMATE.start_dll_append_~last~0#1.offset|)))))) is different from true [2024-11-14 03:54:27,315 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse6 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (let ((.cse1 (= .cse0 .cse2)) (.cse3 (select (select |c_#memory_$Pointer$.offset| .cse2) 4))) (and (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (or .cse1 (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= .cse3 0)) (<= (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 0)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse0 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (or .cse1 (= (select (select |c_#memory_int| .cse0) 0) 1) (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| .cse4) 4))) (and (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4)) (not (= .cse5 4)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse5)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse4) 4))))) (not (= |c_ULTIMATE.start_dll_append_#t~mem10#1.base| 0))) (exists ((v_arrayElimIndex_18 Int) (v_arrayElimCell_103 Int) (|v_#valid_BEFORE_CALL_141| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_141| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_82| |v_#valid_BEFORE_CALL_141|))) (store |v_old(#valid)_AFTER_CALL_82| .cse7 (select |v_#valid_BEFORE_CALL_141| .cse7)))) (not (= v_arrayElimCell_103 0)) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimCell_103) 1) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimIndex_18) 0) (= (select |v_#valid_BEFORE_CALL_141| v_arrayElimIndex_18) 1) (<= (+ 2 v_arrayElimCell_103) |c_ULTIMATE.start_main_~#s~0#1.base|))) (exists ((|v_old(#valid)_AFTER_CALL_80| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (and (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_80| |v_old(#valid)_AFTER_CALL_81|))) (store |v_old(#valid)_AFTER_CALL_80| .cse8 (select |v_old(#valid)_AFTER_CALL_81| .cse8))) |v_old(#valid)_AFTER_CALL_81|) (= (select |v_old(#valid)_AFTER_CALL_80| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_81| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_80| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= .cse3 |c_ULTIMATE.start_dll_append_~last~0#1.offset|)))))) is different from false [2024-11-14 03:54:27,322 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse6 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (let ((.cse1 (= .cse0 .cse2)) (.cse3 (select (select |c_#memory_$Pointer$.offset| .cse2) 4))) (and (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (or .cse1 (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= .cse3 0)) (<= (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 0)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse0 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (or .cse1 (= (select (select |c_#memory_int| .cse0) 0) 1) (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| .cse4) 4))) (and (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4)) (not (= .cse5 4)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse5)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse4) 4))))) (not (= |c_ULTIMATE.start_dll_append_#t~mem10#1.base| 0))) (exists ((v_arrayElimIndex_18 Int) (v_arrayElimCell_103 Int) (|v_#valid_BEFORE_CALL_141| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_141| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_82| |v_#valid_BEFORE_CALL_141|))) (store |v_old(#valid)_AFTER_CALL_82| .cse7 (select |v_#valid_BEFORE_CALL_141| .cse7)))) (not (= v_arrayElimCell_103 0)) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimCell_103) 1) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimIndex_18) 0) (= (select |v_#valid_BEFORE_CALL_141| v_arrayElimIndex_18) 1) (<= (+ 2 v_arrayElimCell_103) |c_ULTIMATE.start_main_~#s~0#1.base|))) (exists ((|v_old(#valid)_AFTER_CALL_80| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (and (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_80| |v_old(#valid)_AFTER_CALL_81|))) (store |v_old(#valid)_AFTER_CALL_80| .cse8 (select |v_old(#valid)_AFTER_CALL_81| .cse8))) |v_old(#valid)_AFTER_CALL_81|) (= (select |v_old(#valid)_AFTER_CALL_80| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_81| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_80| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= .cse3 |c_ULTIMATE.start_dll_append_~last~0#1.offset|)))))) is different from true [2024-11-14 03:54:27,332 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse9 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) 4)) (.cse4 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| .cse4) 4)) (.cse1 (= .cse0 .cse2)) (.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| .cse2) 4))) (and (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (or .cse1 (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= .cse3 0)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4)) (= (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4)) (<= (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse6 4)) (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse6)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse0 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (or .cse1 (= (select (select |c_#memory_int| .cse0) 0) 1) (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (exists ((v_arrayElimIndex_18 Int) (v_arrayElimCell_103 Int) (|v_#valid_BEFORE_CALL_141| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_141| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_82| |v_#valid_BEFORE_CALL_141|))) (store |v_old(#valid)_AFTER_CALL_82| .cse7 (select |v_#valid_BEFORE_CALL_141| .cse7)))) (not (= v_arrayElimCell_103 0)) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimCell_103) 1) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimIndex_18) 0) (= (select |v_#valid_BEFORE_CALL_141| v_arrayElimIndex_18) 1) (<= (+ 2 v_arrayElimCell_103) |c_ULTIMATE.start_main_~#s~0#1.base|))) (exists ((|v_old(#valid)_AFTER_CALL_80| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (and (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_80| |v_old(#valid)_AFTER_CALL_81|))) (store |v_old(#valid)_AFTER_CALL_80| .cse8 (select |v_old(#valid)_AFTER_CALL_81| .cse8))) |v_old(#valid)_AFTER_CALL_81|) (= (select |v_old(#valid)_AFTER_CALL_80| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_81| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_80| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select .cse5 0) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse4) 4)) (<= .cse3 |c_ULTIMATE.start_dll_append_~last~0#1.offset|)))))) is different from false [2024-11-14 03:54:27,338 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse9 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) 4)) (.cse4 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| .cse4) 4)) (.cse1 (= .cse0 .cse2)) (.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| .cse2) 4))) (and (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (or .cse1 (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= .cse3 0)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4)) (= (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4)) (<= (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse6 4)) (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse6)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse0 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (or .cse1 (= (select (select |c_#memory_int| .cse0) 0) 1) (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (exists ((v_arrayElimIndex_18 Int) (v_arrayElimCell_103 Int) (|v_#valid_BEFORE_CALL_141| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_141| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_82| |v_#valid_BEFORE_CALL_141|))) (store |v_old(#valid)_AFTER_CALL_82| .cse7 (select |v_#valid_BEFORE_CALL_141| .cse7)))) (not (= v_arrayElimCell_103 0)) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimCell_103) 1) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimIndex_18) 0) (= (select |v_#valid_BEFORE_CALL_141| v_arrayElimIndex_18) 1) (<= (+ 2 v_arrayElimCell_103) |c_ULTIMATE.start_main_~#s~0#1.base|))) (exists ((|v_old(#valid)_AFTER_CALL_80| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (and (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_80| |v_old(#valid)_AFTER_CALL_81|))) (store |v_old(#valid)_AFTER_CALL_80| .cse8 (select |v_old(#valid)_AFTER_CALL_81| .cse8))) |v_old(#valid)_AFTER_CALL_81|) (= (select |v_old(#valid)_AFTER_CALL_80| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_81| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_80| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select .cse5 0) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse4) 4)) (<= .cse3 |c_ULTIMATE.start_dll_append_~last~0#1.offset|)))))) is different from true [2024-11-14 03:54:27,354 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse2 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse4) 4)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| .cse1) 4)) (select (select |c_#memory_$Pointer$.offset| .cse1) 4)))) (= (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 0)) (or (= .cse0 .cse4) (= (select (select |c_#memory_int| .cse0) 0) 1)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$.offset| .cse4) 4) 0) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.offset_41| Int) (|v_old(#valid)_AFTER_CALL_80| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse6 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_41| 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse0) .cse6))) (and (= (select |v_old(#valid)_AFTER_CALL_81| .cse5) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse6) 0) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_80| |v_old(#valid)_AFTER_CALL_81|))) (store |v_old(#valid)_AFTER_CALL_80| .cse7 (select |v_old(#valid)_AFTER_CALL_81| .cse7))) |v_old(#valid)_AFTER_CALL_81|) (= (select |v_old(#valid)_AFTER_CALL_80| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_81| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_80| .cse4) 0) (<= (+ 2 .cse5) |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |v_ULTIMATE.start_dll_append_~last~0#1.offset_41|))))) (exists ((v_arrayElimIndex_18 Int) (v_arrayElimCell_103 Int) (|v_#valid_BEFORE_CALL_141| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_141| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_82| |v_#valid_BEFORE_CALL_141|))) (store |v_old(#valid)_AFTER_CALL_82| .cse8 (select |v_#valid_BEFORE_CALL_141| .cse8)))) (not (= v_arrayElimCell_103 0)) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimCell_103) 1) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimIndex_18) 0) (= (select |v_#valid_BEFORE_CALL_141| v_arrayElimIndex_18) 1) (<= (+ 2 v_arrayElimCell_103) |c_ULTIMATE.start_main_~#s~0#1.base|))) (= (select .cse3 0) 0))))) is different from false [2024-11-14 03:54:27,360 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse2 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse4) 4)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| .cse1) 4)) (select (select |c_#memory_$Pointer$.offset| .cse1) 4)))) (= (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 0)) (or (= .cse0 .cse4) (= (select (select |c_#memory_int| .cse0) 0) 1)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$.offset| .cse4) 4) 0) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.offset_41| Int) (|v_old(#valid)_AFTER_CALL_80| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse6 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_41| 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse0) .cse6))) (and (= (select |v_old(#valid)_AFTER_CALL_81| .cse5) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse6) 0) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_80| |v_old(#valid)_AFTER_CALL_81|))) (store |v_old(#valid)_AFTER_CALL_80| .cse7 (select |v_old(#valid)_AFTER_CALL_81| .cse7))) |v_old(#valid)_AFTER_CALL_81|) (= (select |v_old(#valid)_AFTER_CALL_80| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_81| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_80| .cse4) 0) (<= (+ 2 .cse5) |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |v_ULTIMATE.start_dll_append_~last~0#1.offset_41|))))) (exists ((v_arrayElimIndex_18 Int) (v_arrayElimCell_103 Int) (|v_#valid_BEFORE_CALL_141| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_141| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_82| |v_#valid_BEFORE_CALL_141|))) (store |v_old(#valid)_AFTER_CALL_82| .cse8 (select |v_#valid_BEFORE_CALL_141| .cse8)))) (not (= v_arrayElimCell_103 0)) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimCell_103) 1) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimIndex_18) 0) (= (select |v_#valid_BEFORE_CALL_141| v_arrayElimIndex_18) 1) (<= (+ 2 v_arrayElimCell_103) |c_ULTIMATE.start_main_~#s~0#1.base|))) (= (select .cse3 0) 0))))) is different from true [2024-11-14 03:54:27,406 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.offset_41| Int) (v_arrayElimIndex_18 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimCell_103 Int) (|v_old(#valid)_AFTER_CALL_80| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int)) (|v_#valid_BEFORE_CALL_141| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4)) (.cse5 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_41| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) .cse5))) (and (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_80| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_80| |v_old(#valid)_AFTER_CALL_81|))) (store |v_old(#valid)_AFTER_CALL_80| .cse1 (select |v_old(#valid)_AFTER_CALL_81| .cse1))) |v_old(#valid)_AFTER_CALL_81|) (not (= .cse2 0)) (<= (+ 2 .cse2) |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ .cse3 2) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int| .cse2) 0) 1) (= |v_#valid_BEFORE_CALL_141| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_82| |v_#valid_BEFORE_CALL_141|))) (store |v_old(#valid)_AFTER_CALL_82| .cse4 (select |v_#valid_BEFORE_CALL_141| .cse4)))) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_81| .cse0) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_81| .cse3) 0) (<= 0 |v_ULTIMATE.start_dll_append_~last~0#1.offset_41|) (not (= v_arrayElimCell_103 0)) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimCell_103) 1) (= (select |v_old(#valid)_AFTER_CALL_80| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimIndex_18) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse5) 0) (= (select |v_#valid_BEFORE_CALL_141| v_arrayElimIndex_18) 1) (<= (+ 2 v_arrayElimCell_103) |ULTIMATE.start_main_~#s~0#1.base|)))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2024-11-14 03:54:27,412 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.offset_41| Int) (v_arrayElimIndex_18 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimCell_103 Int) (|v_old(#valid)_AFTER_CALL_80| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int)) (|v_#valid_BEFORE_CALL_141| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4)) (.cse5 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_41| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) .cse5))) (and (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_80| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_80| |v_old(#valid)_AFTER_CALL_81|))) (store |v_old(#valid)_AFTER_CALL_80| .cse1 (select |v_old(#valid)_AFTER_CALL_81| .cse1))) |v_old(#valid)_AFTER_CALL_81|) (not (= .cse2 0)) (<= (+ 2 .cse2) |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ .cse3 2) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int| .cse2) 0) 1) (= |v_#valid_BEFORE_CALL_141| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_82| |v_#valid_BEFORE_CALL_141|))) (store |v_old(#valid)_AFTER_CALL_82| .cse4 (select |v_#valid_BEFORE_CALL_141| .cse4)))) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_81| .cse0) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_81| .cse3) 0) (<= 0 |v_ULTIMATE.start_dll_append_~last~0#1.offset_41|) (not (= v_arrayElimCell_103 0)) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimCell_103) 1) (= (select |v_old(#valid)_AFTER_CALL_80| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_82| v_arrayElimIndex_18) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse5) 0) (= (select |v_#valid_BEFORE_CALL_141| v_arrayElimIndex_18) 1) (<= (+ 2 v_arrayElimCell_103) |ULTIMATE.start_main_~#s~0#1.base|)))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2024-11-14 03:54:27,512 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |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|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)) (exists ((v_arrayElimCell_130 Int) (v_arrayElimIndex_27 Int) (|v_old(#valid)_AFTER_CALL_80| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_81| v_arrayElimIndex_27) 1) (= (select |v_old(#valid)_AFTER_CALL_81| v_arrayElimCell_130) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_80| |v_old(#valid)_AFTER_CALL_81|))) (store |v_old(#valid)_AFTER_CALL_80| .cse1 (select |v_old(#valid)_AFTER_CALL_81| .cse1))) |v_old(#valid)_AFTER_CALL_81|) (= (select |v_old(#valid)_AFTER_CALL_80| v_arrayElimIndex_27) 0) (= (select |v_old(#valid)_AFTER_CALL_80| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1))) (= (select .cse0 0) 1))) is different from false [2024-11-14 03:54:27,516 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |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|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)) (exists ((v_arrayElimCell_130 Int) (v_arrayElimIndex_27 Int) (|v_old(#valid)_AFTER_CALL_80| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_81| v_arrayElimIndex_27) 1) (= (select |v_old(#valid)_AFTER_CALL_81| v_arrayElimCell_130) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_80| |v_old(#valid)_AFTER_CALL_81|))) (store |v_old(#valid)_AFTER_CALL_80| .cse1 (select |v_old(#valid)_AFTER_CALL_81| .cse1))) |v_old(#valid)_AFTER_CALL_81|) (= (select |v_old(#valid)_AFTER_CALL_80| v_arrayElimIndex_27) 0) (= (select |v_old(#valid)_AFTER_CALL_80| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1))) (= (select .cse0 0) 1))) is different from true [2024-11-14 03:54:28,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:54:28,024 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2024-11-14 03:54:28,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-14 03:54:28,025 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 38 states have (on average 1.236842105263158) internal successors, (47), 35 states have internal predecessors, (47), 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 31 [2024-11-14 03:54:28,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:54:28,026 INFO L225 Difference]: With dead ends: 55 [2024-11-14 03:54:28,026 INFO L226 Difference]: Without dead ends: 53 [2024-11-14 03:54:28,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 32 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 37.6s TimeCoverageRelationStatistics Valid=217, Invalid=2504, Unknown=59, NotChecked=4192, Total=6972 [2024-11-14 03:54:28,028 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 1628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1200 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:54:28,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 259 Invalid, 1628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 423 Invalid, 0 Unknown, 1200 Unchecked, 1.5s Time] [2024-11-14 03:54:28,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-14 03:54:28,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-14 03:54:28,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-14 03:54:28,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2024-11-14 03:54:28,060 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 31 [2024-11-14 03:54:28,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:54:28,060 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2024-11-14 03:54:28,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 38 states have (on average 1.236842105263158) internal successors, (47), 35 states have internal predecessors, (47), 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-11-14 03:54:28,060 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2024-11-14 03:54:28,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-14 03:54:28,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:54:28,061 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:54:28,076 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-14 03:54:28,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:54:28,262 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:54:28,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:54:28,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1323747347, now seen corresponding path program 2 times [2024-11-14 03:54:28,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:54:28,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087219631] [2024-11-14 03:54:28,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:54:28,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:54:28,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:54:30,980 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:54:30,981 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:54:30,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087219631] [2024-11-14 03:54:30,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087219631] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:54:30,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558700776] [2024-11-14 03:54:30,981 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:54:30,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:54:30,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:54:30,985 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:54:30,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e78c93a-7459-459d-95a1-902a7e44ab32/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-14 03:54:31,481 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 03:54:31,481 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:54:31,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 129 conjuncts are in the unsatisfiable core [2024-11-14 03:54:31,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:54:31,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:54:31,946 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-11-14 03:54:31,967 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-11-14 03:54:32,440 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 03:54:32,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-14 03:54:32,467 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 18 treesize of output 13 [2024-11-14 03:54:32,499 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 18 treesize of output 13 [2024-11-14 03:54:32,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2024-11-14 03:54:32,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2024-11-14 03:54:32,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:54:32,703 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 46 treesize of output 39 [2024-11-14 03:54:32,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:54:32,714 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 40 treesize of output 33 [2024-11-14 03:54:32,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 21 [2024-11-14 03:54:32,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 38 [2024-11-14 03:54:33,277 INFO L349 Elim1Store]: treesize reduction 48, result has 15.8 percent of original size [2024-11-14 03:54:33,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 75 [2024-11-14 03:54:33,305 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 03:54:33,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 23 [2024-11-14 03:54:33,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 03:54:33,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:54:33,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:54:33,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:54:33,522 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-14 03:54:33,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 84 [2024-11-14 03:54:33,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:54:33,588 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2024-11-14 03:54:33,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 146 treesize of output 105 [2024-11-14 03:54:33,665 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-14 03:54:33,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 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-11-14 03:54:35,164 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:54:35,164 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:54:36,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558700776] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:54:36,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [569444937] [2024-11-14 03:54:36,976 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-14 03:54:36,976 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:54:36,976 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:54:36,976 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:54:36,976 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:54:41,142 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 187 for LOIs [2024-11-14 03:54:41,337 INFO L180 IcfgInterpreter]: Interpretation finished