./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh --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 277634da297b7f9e262585608ed7ad62cca7d59b0122d4e61ee1b4b78256acae --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 19:58:18,954 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 19:58:19,031 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 19:58:19,036 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 19:58:19,037 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 19:58:19,062 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 19:58:19,063 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 19:58:19,064 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 19:58:19,064 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 19:58:19,065 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 19:58:19,065 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 19:58:19,066 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 19:58:19,067 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 19:58:19,067 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 19:58:19,068 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 19:58:19,068 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 19:58:19,069 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 19:58:19,070 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 19:58:19,070 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 19:58:19,071 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 19:58:19,071 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 19:58:19,076 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 19:58:19,077 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 19:58:19,077 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 19:58:19,078 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 19:58:19,078 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 19:58:19,078 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 19:58:19,079 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 19:58:19,079 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 19:58:19,079 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 19:58:19,080 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 19:58:19,080 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 19:58:19,080 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 19:58:19,081 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 19:58:19,081 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 19:58:19,081 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 19:58:19,081 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 19:58:19,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 19:58:19,082 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 19:58:19,082 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 19:58:19,082 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 19:58:19,082 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 19:58:19,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 19:58:19,083 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 19:58:19,083 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 19:58:19,083 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 19:58:19,083 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 19:58:19,084 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh 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 -> 277634da297b7f9e262585608ed7ad62cca7d59b0122d4e61ee1b4b78256acae [2023-12-02 19:58:19,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 19:58:19,305 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 19:58:19,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 19:58:19,309 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 19:58:19,310 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 19:58:19,311 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i [2023-12-02 19:58:22,209 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 19:58:22,465 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 19:58:22,465 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i [2023-12-02 19:58:22,478 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/data/63ce5c836/db488f04ba82471c9f3a5eb5afe462e6/FLAG99f8d3f83 [2023-12-02 19:58:22,492 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/data/63ce5c836/db488f04ba82471c9f3a5eb5afe462e6 [2023-12-02 19:58:22,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 19:58:22,496 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 19:58:22,497 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 19:58:22,497 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 19:58:22,503 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 19:58:22,504 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:58:22" (1/1) ... [2023-12-02 19:58:22,506 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b40fc15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:58:22, skipping insertion in model container [2023-12-02 19:58:22,506 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:58:22" (1/1) ... [2023-12-02 19:58:22,552 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 19:58:22,834 WARN L240 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_7e47d11d-9d90-426e-af61-873788e4298e/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i[24165,24178] [2023-12-02 19:58:22,838 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 19:58:22,846 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 19:58:22,890 WARN L240 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_7e47d11d-9d90-426e-af61-873788e4298e/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i[24165,24178] [2023-12-02 19:58:22,891 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 19:58:22,920 INFO L206 MainTranslator]: Completed translation [2023-12-02 19:58:22,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:58:22 WrapperNode [2023-12-02 19:58:22,921 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 19:58:22,922 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 19:58:22,922 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 19:58:22,922 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 19:58:22,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:58:22" (1/1) ... [2023-12-02 19:58:22,945 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:58:22" (1/1) ... [2023-12-02 19:58:22,970 INFO L138 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 114 [2023-12-02 19:58:22,970 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 19:58:22,971 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 19:58:22,971 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 19:58:22,972 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 19:58:22,979 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:58:22" (1/1) ... [2023-12-02 19:58:22,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:58:22" (1/1) ... [2023-12-02 19:58:22,983 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:58:22" (1/1) ... [2023-12-02 19:58:22,983 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:58:22" (1/1) ... [2023-12-02 19:58:22,991 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:58:22" (1/1) ... [2023-12-02 19:58:22,994 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:58:22" (1/1) ... [2023-12-02 19:58:22,996 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:58:22" (1/1) ... [2023-12-02 19:58:22,998 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:58:22" (1/1) ... [2023-12-02 19:58:23,000 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 19:58:23,001 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 19:58:23,001 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 19:58:23,002 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 19:58:23,002 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:58:22" (1/1) ... [2023-12-02 19:58:23,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 19:58:23,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:58:23,035 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 19:58:23,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 19:58:23,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 19:58:23,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 19:58:23,083 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-02 19:58:23,083 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-02 19:58:23,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 19:58:23,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 19:58:23,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 19:58:23,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 19:58:23,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 19:58:23,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 19:58:23,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-12-02 19:58:23,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 19:58:23,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 19:58:23,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 19:58:23,238 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 19:58:23,241 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 19:58:23,439 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 19:58:23,494 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 19:58:23,495 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-02 19:58:23,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:58:23 BoogieIcfgContainer [2023-12-02 19:58:23,497 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 19:58:23,501 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 19:58:23,501 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 19:58:23,506 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 19:58:23,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 07:58:22" (1/3) ... [2023-12-02 19:58:23,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@451886a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:58:23, skipping insertion in model container [2023-12-02 19:58:23,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:58:22" (2/3) ... [2023-12-02 19:58:23,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@451886a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:58:23, skipping insertion in model container [2023-12-02 19:58:23,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:58:23" (3/3) ... [2023-12-02 19:58:23,510 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_unequal.i [2023-12-02 19:58:23,535 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 19:58:23,536 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 19:58:23,596 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 19:58:23,605 INFO L357 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, mHoare=true, 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;@5e9bdcba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 19:58:23,605 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 19:58:23,610 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 19:58:23,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 19:58:23,621 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:58:23,621 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:58:23,622 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:58:23,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:58:23,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1916200983, now seen corresponding path program 1 times [2023-12-02 19:58:23,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:58:23,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110038369] [2023-12-02 19:58:23,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:58:23,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:58:23,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:58:23,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:58:23,989 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:58:23,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110038369] [2023-12-02 19:58:23,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110038369] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:58:23,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:58:23,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 19:58:23,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348997929] [2023-12-02 19:58:23,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:58:23,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:58:23,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:58:24,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:58:24,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:58:24,035 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2023-12-02 19:58:24,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:58:24,095 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2023-12-02 19:58:24,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:58:24,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 9 [2023-12-02 19:58:24,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:58:24,106 INFO L225 Difference]: With dead ends: 37 [2023-12-02 19:58:24,106 INFO L226 Difference]: Without dead ends: 18 [2023-12-02 19:58:24,110 INFO L412 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 [2023-12-02 19:58:24,115 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:58:24,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 32 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 19:58:24,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-12-02 19:58:24,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2023-12-02 19:58:24,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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) [2023-12-02 19:58:24,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2023-12-02 19:58:24,157 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 9 [2023-12-02 19:58:24,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:58:24,158 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2023-12-02 19:58:24,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2023-12-02 19:58:24,158 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2023-12-02 19:58:24,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 19:58:24,160 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:58:24,160 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:58:24,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 19:58:24,161 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:58:24,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:58:24,162 INFO L85 PathProgramCache]: Analyzing trace with hash -2126188791, now seen corresponding path program 1 times [2023-12-02 19:58:24,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:58:24,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501441256] [2023-12-02 19:58:24,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:58:24,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:58:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:58:24,318 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 19:58:24,318 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:58:24,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501441256] [2023-12-02 19:58:24,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501441256] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:58:24,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444385986] [2023-12-02 19:58:24,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:58:24,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:58:24,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:58:24,327 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:58:24,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 19:58:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:58:24,531 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 19:58:24,536 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:58:24,588 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:58:24,588 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:58:24,617 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 19:58:24,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444385986] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:58:24,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1169892456] [2023-12-02 19:58:24,637 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2023-12-02 19:58:24,637 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:58:24,640 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:58:24,646 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:58:24,646 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:58:26,674 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 139 for LOIs [2023-12-02 19:58:26,961 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:58:32,474 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '185#(and (= |ULTIMATE.start_main_~uneq~0#1| 5) (exists ((|v_#memory_$Pointer$.base_53| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_53| (Array Int (Array Int Int))) (|v_#memory_int_64| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_prepend_~head#1.base_14| Int) (|v_ULTIMATE.start_sll_prepend_#in~head#1.base_11| Int) (|v_#memory_int_26| (Array Int (Array Int Int)))) (and (= |v_#memory_int_26| (store |v_#memory_int_64| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (select |v_#memory_int_64| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 (select (select |v_#memory_int_26| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_53| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (select |v_#memory_$Pointer$.offset_53| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 (select (select |v_#memory_$Pointer$.offset_53| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_14| (store (select (store |v_#memory_$Pointer$.offset_53| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (select |v_#memory_$Pointer$.offset_53| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 (select (select |v_#memory_$Pointer$.offset_53| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0 0))) (= |#memory_int| (store |v_#memory_int_26| |v_ULTIMATE.start_sll_prepend_~head#1.base_14| (store (select |v_#memory_int_26| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)))) (or (and (exists ((|v_#memory_$Pointer$.offset_49| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_49| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (store (select |v_#memory_$Pointer$.offset_49| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_53| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 0))) |v_#memory_$Pointer$.offset_53|)) (exists ((|v_#memory_$Pointer$.base_52| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (store |v_#memory_$Pointer$.base_52| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_52| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_sll_create_#res#1.base|) 4)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|))) (exists ((|v_#length_23| (Array Int Int))) (= |#length| (store |v_#length_23| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) 8))) (= |v_ULTIMATE.start_sll_prepend_~head#1.base_14| |v_ULTIMATE.start_sll_prepend_#in~head#1.base_11|) (exists ((|v_#memory_$Pointer$.base_49| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_49| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (store (select |v_#memory_$Pointer$.base_49| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.base_53| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 0))) |v_#memory_$Pointer$.base_53|)) (exists ((|v_#memory_int_63| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_10| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_10| (store |v_#memory_int_63| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_63| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_10| |ULTIMATE.start_sll_create_#res#1.base|) 4))))) (exists ((|v_#memory_int_38| (Array Int (Array Int Int))) (|v_#memory_int_60| (Array Int (Array Int Int)))) (and (= |v_#memory_int_64| (store |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (select |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 0 5))) (= |v_#memory_int_38| (store |v_#memory_int_60| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (select |v_#memory_int_60| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 (select (select |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4)))))) (exists ((|v_#valid_33| (Array Int Int))) (and (= (store |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) 1) |#valid|) (= (select |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 0))) (exists ((|v_#memory_$Pointer$.offset_52| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_52| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_52| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (= |v_ULTIMATE.start_sll_prepend_#in~head#1.base_11| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ 1 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) |#StackHeapBarrier|)) (and (exists ((|v_#memory_$Pointer$.offset_49| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_49| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (store (select |v_#memory_$Pointer$.offset_49| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_53| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 0))) |v_#memory_$Pointer$.offset_53|)) (exists ((|v_#length_23| (Array Int Int))) (= |#length| (store |v_#length_23| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) 8))) (= |v_ULTIMATE.start_sll_prepend_~head#1.base_14| |v_ULTIMATE.start_sll_prepend_#in~head#1.base_11|) (exists ((|v_#memory_$Pointer$.base_49| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_49| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (store (select |v_#memory_$Pointer$.base_49| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.base_53| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 0))) |v_#memory_$Pointer$.base_53|)) (exists ((|v_#memory_int_38| (Array Int (Array Int Int))) (|v_#memory_int_60| (Array Int (Array Int Int)))) (and (= |v_#memory_int_64| (store |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (select |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 0 5))) (= |v_#memory_int_38| (store |v_#memory_int_60| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (select |v_#memory_int_60| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 (select (select |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4)))))) (exists ((|v_#memory_$Pointer$.base_52| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (store |v_#memory_$Pointer$.base_52| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_52| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_sll_create_#res#1.base|) 4)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|))) (exists ((|v_#memory_int_63| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_9| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_9| (store |v_#memory_int_63| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_63| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_9| |ULTIMATE.start_sll_create_#res#1.base|) 4))))) (exists ((|v_#valid_33| (Array Int Int))) (and (= (store |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) 1) |#valid|) (= (select |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 0))) (exists ((|v_#memory_$Pointer$.offset_52| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_52| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_52| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (= |v_ULTIMATE.start_sll_prepend_#in~head#1.base_11| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ 1 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) |#StackHeapBarrier|))) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_53| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (select |v_#memory_$Pointer$.base_53| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 (select (select |v_#memory_$Pointer$.base_53| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_14| (store (select (store |v_#memory_$Pointer$.base_53| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (select |v_#memory_$Pointer$.base_53| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 (select (select |v_#memory_$Pointer$.base_53| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (not (= 5 (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|))) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |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 [2023-12-02 19:58:32,474 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 19:58:32,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:58:32,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-12-02 19:58:32,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96296993] [2023-12-02 19:58:32,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:58:32,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 19:58:32,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:58:32,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 19:58:32,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2023-12-02 19:58:32,479 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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) [2023-12-02 19:58:32,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:58:32,516 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2023-12-02 19:58:32,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 19:58:32,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 15 [2023-12-02 19:58:32,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:58:32,518 INFO L225 Difference]: With dead ends: 30 [2023-12-02 19:58:32,518 INFO L226 Difference]: Without dead ends: 19 [2023-12-02 19:58:32,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2023-12-02 19:58:32,520 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:58:32,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 23 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 19:58:32,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-02 19:58:32,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-12-02 19:58:32,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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) [2023-12-02 19:58:32,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2023-12-02 19:58:32,527 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 15 [2023-12-02 19:58:32,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:58:32,528 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2023-12-02 19:58:32,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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) [2023-12-02 19:58:32,528 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2023-12-02 19:58:32,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 19:58:32,529 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:58:32,529 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:58:32,537 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 19:58:32,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:58:32,731 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:58:32,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:58:32,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1526010327, now seen corresponding path program 2 times [2023-12-02 19:58:32,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:58:32,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881412535] [2023-12-02 19:58:32,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:58:32,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:58:32,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:58:33,625 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 19:58:33,625 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:58:33,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881412535] [2023-12-02 19:58:33,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881412535] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:58:33,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:58:33,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 19:58:33,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959255562] [2023-12-02 19:58:33,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:58:33,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 19:58:33,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:58:33,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 19:58:33,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-02 19:58:33,629 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 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) [2023-12-02 19:58:33,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:58:33,753 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2023-12-02 19:58:33,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 19:58:33,754 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 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 21 [2023-12-02 19:58:33,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:58:33,755 INFO L225 Difference]: With dead ends: 21 [2023-12-02 19:58:33,755 INFO L226 Difference]: Without dead ends: 19 [2023-12-02 19:58:33,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-02 19:58:33,757 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 9 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:58:33,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 43 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:58:33,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-02 19:58:33,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-12-02 19:58:33,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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) [2023-12-02 19:58:33,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2023-12-02 19:58:33,763 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 21 [2023-12-02 19:58:33,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:58:33,764 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2023-12-02 19:58:33,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 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) [2023-12-02 19:58:33,764 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2023-12-02 19:58:33,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 19:58:33,765 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:58:33,765 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:58:33,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 19:58:33,766 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:58:33,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:58:33,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1912042300, now seen corresponding path program 1 times [2023-12-02 19:58:33,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:58:33,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768932304] [2023-12-02 19:58:33,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:58:33,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:58:33,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:58:35,672 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 19:58:35,672 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:58:35,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768932304] [2023-12-02 19:58:35,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768932304] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:58:35,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825201921] [2023-12-02 19:58:35,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:58:35,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:58:35,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:58:35,677 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:58:35,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 19:58:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:58:35,815 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 101 conjunts are in the unsatisfiable core [2023-12-02 19:58:35,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:58:35,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 19:58:35,946 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 [2023-12-02 19:58:36,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 19:58:36,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2023-12-02 19:58:36,202 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 [2023-12-02 19:58:36,207 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 [2023-12-02 19:58:36,211 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 5 treesize of output 3 [2023-12-02 19:58:36,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:58:36,336 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 [2023-12-02 19:58:36,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:58:36,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2023-12-02 19:58:36,365 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-02 19:58:36,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-12-02 19:58:36,377 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 [2023-12-02 19:58:36,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:58:36,490 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 67 treesize of output 21 [2023-12-02 19:58:36,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:58:36,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:58:36,500 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 33 treesize of output 15 [2023-12-02 19:58:36,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:58:36,510 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 100 treesize of output 38 [2023-12-02 19:58:36,626 INFO L349 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-12-02 19:58:36,626 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 106 treesize of output 41 [2023-12-02 19:58:36,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:58:36,636 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 19:58:36,736 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 19:58:36,737 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:58:43,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825201921] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:58:43,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [969557654] [2023-12-02 19:58:43,547 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-12-02 19:58:43,547 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:58:43,548 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:58:43,548 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:58:43,548 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:58:44,641 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 139 for LOIs [2023-12-02 19:58:44,813 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:58:57,072 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '445#(and (<= 1 |#StackHeapBarrier|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|) 1)) (= |ULTIMATE.start_main_~count~0#1| 1) (= |ULTIMATE.start_main_~uneq~0#1| 5) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (= |ULTIMATE.start_main_~temp~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4))) (exists ((|v_#memory_int_96| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_prepend_#in~head#1.base_13| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_16| Int) (|v_#memory_$Pointer$.offset_68| (Array Int (Array Int Int))) (|v_#memory_int_26| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_68| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_26| |v_ULTIMATE.start_sll_prepend_~head#1.base_16| (store (select |v_#memory_int_26| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_68| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0) (store (select |v_#memory_$Pointer$.offset_68| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0)) 4 (select (select |v_#memory_$Pointer$.offset_68| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_16| (store (select (store |v_#memory_$Pointer$.offset_68| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0) (store (select |v_#memory_$Pointer$.offset_68| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0)) 4 (select (select |v_#memory_$Pointer$.offset_68| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0 0))) (= (store |v_#memory_int_96| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0) (store (select |v_#memory_int_96| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0)) 4 (select (select |v_#memory_int_26| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0)) 4))) |v_#memory_int_26|) (or (and (= |v_ULTIMATE.start_sll_prepend_~head#1.base_16| |v_ULTIMATE.start_sll_prepend_#in~head#1.base_13|) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_21| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_67| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_67| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_67| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_sll_create_#res#1.base|) 4))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_21|) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|))) (exists ((|v_#memory_int_95| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_21| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_21| (store |v_#memory_int_95| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_95| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_21| |ULTIMATE.start_sll_create_#res#1.base|) 4))))) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0) 1) |#StackHeapBarrier|) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0) 0)) (exists ((|v_#length_30| (Array Int Int))) (= (store |v_#length_30| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0) 8) |#length|)) (exists ((|v_#memory_$Pointer$.base_64| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_64| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0) (store (store (select |v_#memory_$Pointer$.base_64| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.base_68| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0)) 0))) |v_#memory_$Pointer$.base_68|)) (exists ((|v_#memory_int_38| (Array Int (Array Int Int))) (|v_#memory_int_92| (Array Int (Array Int Int)))) (and (= |v_#memory_int_38| (store |v_#memory_int_92| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0) (store (select |v_#memory_int_92| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0)) 4 (select (select |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0)) 4)))) (= |v_#memory_int_96| (store |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0) (store (select |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0)) 0 5))))) (exists ((|v_#memory_$Pointer$.offset_67| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_67| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_67| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#valid_43| (Array Int Int))) (and (= (select |v_#valid_43| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0)) 0) (= (store |v_#valid_43| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0) 1) |#valid|))) (exists ((|v_#memory_$Pointer$.offset_64| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_64| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0) (store (store (select |v_#memory_$Pointer$.offset_64| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_68| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0)) 0))) |v_#memory_$Pointer$.offset_68|)) (= |v_ULTIMATE.start_sll_prepend_#in~head#1.base_13| |ULTIMATE.start_main_~#s~0#1.base|)) (and (exists ((|v_#memory_int_95| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_20| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_20| (store |v_#memory_int_95| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_95| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_20| |ULTIMATE.start_sll_create_#res#1.base|) 4))))) (= |v_ULTIMATE.start_sll_prepend_~head#1.base_16| |v_ULTIMATE.start_sll_prepend_#in~head#1.base_13|) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0) 1) |#StackHeapBarrier|) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0) 0)) (exists ((|v_#length_30| (Array Int Int))) (= (store |v_#length_30| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0) 8) |#length|)) (exists ((|v_#memory_$Pointer$.base_64| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_64| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0) (store (store (select |v_#memory_$Pointer$.base_64| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.base_68| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0)) 0))) |v_#memory_$Pointer$.base_68|)) (exists ((|v_#memory_int_38| (Array Int (Array Int Int))) (|v_#memory_int_92| (Array Int (Array Int Int)))) (and (= |v_#memory_int_38| (store |v_#memory_int_92| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0) (store (select |v_#memory_int_92| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0)) 4 (select (select |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0)) 4)))) (= |v_#memory_int_96| (store |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0) (store (select |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0)) 0 5))))) (exists ((|v_#memory_$Pointer$.offset_67| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_67| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_67| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#valid_43| (Array Int Int))) (and (= (select |v_#valid_43| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0)) 0) (= (store |v_#valid_43| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0) 1) |#valid|))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_20| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_67| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| (store |v_#memory_$Pointer$.base_67| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_67| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_sll_create_#res#1.base|) 4)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|))) (exists ((|v_#memory_$Pointer$.offset_64| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_64| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0) (store (store (select |v_#memory_$Pointer$.offset_64| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_68| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0)) 0))) |v_#memory_$Pointer$.offset_68|)) (= |v_ULTIMATE.start_sll_prepend_#in~head#1.base_13| |ULTIMATE.start_main_~#s~0#1.base|))) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_68| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0) (store (select |v_#memory_$Pointer$.base_68| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0)) 4 (select (select |v_#memory_$Pointer$.base_68| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_16| (store (select (store |v_#memory_$Pointer$.base_68| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0) (store (select |v_#memory_$Pointer$.base_68| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0)) 4 (select (select |v_#memory_$Pointer$.base_68| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0)))))) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~ptr~0#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4)) |ULTIMATE.start_main_~ptr~0#1.base|) (= |ULTIMATE.start_main_~data~0#1| 1) (= 5 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~temp~2#1.offset|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 19:58:57,073 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 19:58:57,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 19:58:57,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2023-12-02 19:58:57,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125167317] [2023-12-02 19:58:57,073 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 19:58:57,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-02 19:58:57,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:58:57,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-02 19:58:57,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1445, Unknown=16, NotChecked=0, Total=1560 [2023-12-02 19:58:57,076 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 19:58:58,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:58:58,127 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2023-12-02 19:58:58,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 19:58:58,128 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 23 [2023-12-02 19:58:58,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:58:58,129 INFO L225 Difference]: With dead ends: 26 [2023-12-02 19:58:58,129 INFO L226 Difference]: Without dead ends: 24 [2023-12-02 19:58:58,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=140, Invalid=2006, Unknown=16, NotChecked=0, Total=2162 [2023-12-02 19:58:58,130 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 11 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 19:58:58,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 85 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 19:58:58,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-02 19:58:58,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2023-12-02 19:58:58,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 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) [2023-12-02 19:58:58,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2023-12-02 19:58:58,135 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 23 [2023-12-02 19:58:58,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:58:58,135 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2023-12-02 19:58:58,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 19:58:58,135 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2023-12-02 19:58:58,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 19:58:58,136 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:58:58,136 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:58:58,141 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 19:58:58,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:58:58,337 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:58:58,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:58:58,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1911987275, now seen corresponding path program 1 times [2023-12-02 19:58:58,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:58:58,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052789952] [2023-12-02 19:58:58,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:58:58,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:58:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:58:59,040 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 19:58:59,040 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:58:59,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052789952] [2023-12-02 19:58:59,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052789952] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:58:59,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322118835] [2023-12-02 19:58:59,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:58:59,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:58:59,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:58:59,042 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:58:59,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 19:58:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:58:59,196 INFO L262 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 51 conjunts are in the unsatisfiable core [2023-12-02 19:58:59,200 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:58:59,367 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 [2023-12-02 19:58:59,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:58:59,439 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 [2023-12-02 19:58:59,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:58:59,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:58:59,509 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 22 treesize of output 22 [2023-12-02 19:58:59,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:58:59,518 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 76 treesize of output 22 [2023-12-02 19:58:59,522 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 38 treesize of output 30 [2023-12-02 19:58:59,594 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-12-02 19:58:59,594 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 37 treesize of output 16 [2023-12-02 19:58:59,597 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 19:58:59,597 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:58:59,635 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:58:59,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1194 treesize of output 1193 [2023-12-02 19:58:59,647 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 972 treesize of output 964 [2023-12-02 19:58:59,756 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 184 treesize of output 182 [2023-12-02 19:58:59,776 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 88 treesize of output 86 [2023-12-02 19:58:59,792 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 88 treesize of output 86 [2023-12-02 19:58:59,822 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 88 treesize of output 86 [2023-12-02 19:58:59,837 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 88 treesize of output 86 [2023-12-02 19:59:00,628 INFO L349 Elim1Store]: treesize reduction 14, result has 61.1 percent of original size [2023-12-02 19:59:00,629 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 42 [2023-12-02 19:59:00,665 INFO L349 Elim1Store]: treesize reduction 14, result has 61.1 percent of original size [2023-12-02 19:59:00,666 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 42 [2023-12-02 19:59:00,710 INFO L349 Elim1Store]: treesize reduction 14, result has 61.1 percent of original size [2023-12-02 19:59:00,710 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 42 [2023-12-02 19:59:00,750 INFO L349 Elim1Store]: treesize reduction 14, result has 61.1 percent of original size [2023-12-02 19:59:00,751 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 42 [2023-12-02 19:59:00,807 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (forall ((|ULTIMATE.start_sll_prepend_#t~ret7#1.offset| Int) (v_ArrVal_463 (Array Int Int)) (v_arrayElimCell_27 Int)) (not (= (select (let ((.cse20 (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| (store v_ArrVal_463 (+ |ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 4) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_463) |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse21 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse21 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))))) (select .cse20 (select (select .cse20 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_27)) 0)))) (.cse9 (< |c_#StackHeapBarrier| (+ 1 |c_ULTIMATE.start_main_~#s~0#1.base|))) (.cse0 (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_sll_prepend_~head#1.base| 1))) (.cse7 (not .cse5)) (.cse3 (not .cse1))) (and (or .cse0 (and (or .cse1 (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_3 (Array Int Int))) (or (not (= (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_arrayElimArr_3))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_30)) 0)) (not (= (select v_arrayElimArr_3 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) |c_ULTIMATE.start_sll_prepend_~head#1.base|))))) (or .cse3 (and (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_27 Int)) (or (not (= (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_arrayElimArr_2))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_27)) 0)) (not (= |c_ULTIMATE.start_sll_prepend_~head#1.base| (select v_arrayElimArr_2 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) .cse5) (or (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_sll_prepend_#t~ret7#1.offset| Int)) (or (not (= (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_arrayElimArr_1))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ |ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 4)) 0)) (not (= |c_ULTIMATE.start_sll_prepend_~head#1.base| (select v_arrayElimArr_1 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) .cse7))))) (or .cse1 .cse8 .cse9) (or .cse1 (and (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| 1)) (forall ((|ULTIMATE.start_sll_prepend_#t~ret7#1.offset| Int) (v_ArrVal_463 (Array Int Int)) (v_arrayElimCell_32 Int)) (not (= (select (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| (store v_ArrVal_463 (+ |ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 4) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| v_ArrVal_463) |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse11 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse11 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25|))))) (select .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_32)) 0))) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25|) (= |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| |c_ULTIMATE.start_main_~#s~0#1.base|))) (or .cse8 .cse9) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_arrayElimCell_31 Int)) (or (not (= (select (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_arrayElimArr_4))) (select .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_31)) 0)) (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) |c_ULTIMATE.start_sll_prepend_~head#1.base|)))) .cse0))) (or .cse1 (forall ((v_arrayElimCell_29 Int) (|ULTIMATE.start_sll_prepend_#t~ret7#1.offset| Int) (v_ArrVal_463 (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| 1)) (not (= (select (let ((.cse13 (let ((.cse14 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| (store v_ArrVal_463 (+ |ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 4) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| v_ArrVal_463) |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse14 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse14 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25|))))) (select .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_29)) 0)) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25|) (= |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| |c_ULTIMATE.start_main_~#s~0#1.base|)))) (or (and (or (forall ((|ULTIMATE.start_sll_prepend_#t~ret7#1.offset| Int) (v_ArrVal_463 (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| 1)) (not (= (let ((.cse17 (+ |ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 4))) (select (let ((.cse15 (let ((.cse16 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| (store v_ArrVal_463 .cse17 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| v_ArrVal_463) |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse16 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse16 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25|))))) (select .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse17)) 0)) (= |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| |c_ULTIMATE.start_main_~#s~0#1.base|))) .cse7) (or .cse5 (forall ((v_arrayElimCell_28 Int) (|ULTIMATE.start_sll_prepend_#t~ret7#1.offset| Int) (v_ArrVal_463 (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| 1)) (= |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (let ((.cse18 (let ((.cse19 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| (store v_ArrVal_463 (+ |ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 4) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| v_ArrVal_463) |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse19 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse19 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25|))))) (select .cse18 (select (select .cse18 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_28)) 0)))))) .cse3)))) is different from false [2023-12-02 19:59:00,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322118835] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:59:00,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1688701627] [2023-12-02 19:59:00,828 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-12-02 19:59:00,828 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:59:00,829 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:59:00,829 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:59:00,829 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:59:01,941 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 122 for LOIs [2023-12-02 19:59:02,123 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:59:08,289 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '645#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~count~0#1| 1) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4)) 0) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |ULTIMATE.start_main_~ptr~0#1.base| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4)) 0) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.base_18| Int) (|v_ULTIMATE.start_sll_prepend_#in~head#1.base_15| Int) (|v_#memory_int_115| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_83| (Array Int (Array Int Int))) (|v_#memory_int_26| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_80| (Array Int (Array Int Int)))) (and (or (and (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_32| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|)) (exists ((|v_#memory_int_111| (Array Int (Array Int Int))) (|v_#memory_int_38| (Array Int (Array Int Int)))) (and (= |v_#memory_int_115| (store |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0) (store (select |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0)) 0 5))) (= |v_#memory_int_38| (store |v_#memory_int_111| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0) (store (select |v_#memory_int_111| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0)) 4 (select (select |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0)) 4)))))) (exists ((|v_#memory_$Pointer$.base_79| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_79| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0) (store (store (select |v_#memory_$Pointer$.base_79| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.base_83| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0)) 0))) |v_#memory_$Pointer$.base_83|)) (= |v_ULTIMATE.start_sll_prepend_~head#1.base_18| |v_ULTIMATE.start_sll_prepend_#in~head#1.base_15|) (exists ((|v_#length_37| (Array Int Int))) (= (store |v_#length_37| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0) 8) |#length|)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0) 0)) (exists ((|v_#valid_50| (Array Int Int))) (and (= (select |v_#valid_50| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0)) 0) (= |#valid| (store |v_#valid_50| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0) 1)))) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (= |v_ULTIMATE.start_sll_prepend_#in~head#1.base_15| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_76| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_76| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0) (store (store (select |v_#memory_$Pointer$.offset_76| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_80| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0)) 0))) |v_#memory_$Pointer$.offset_80|))) (and (exists ((|v_#memory_int_111| (Array Int (Array Int Int))) (|v_#memory_int_38| (Array Int (Array Int Int)))) (and (= |v_#memory_int_115| (store |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0) (store (select |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0)) 0 5))) (= |v_#memory_int_38| (store |v_#memory_int_111| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0) (store (select |v_#memory_int_111| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0)) 4 (select (select |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0)) 4)))))) (exists ((|v_#memory_$Pointer$.base_79| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_79| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0) (store (store (select |v_#memory_$Pointer$.base_79| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.base_83| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0)) 0))) |v_#memory_$Pointer$.base_83|)) (= |v_ULTIMATE.start_sll_prepend_~head#1.base_18| |v_ULTIMATE.start_sll_prepend_#in~head#1.base_15|) (exists ((|v_#length_37| (Array Int Int))) (= (store |v_#length_37| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0) 8) |#length|)) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_31| (Array Int (Array Int Int)))) (= 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_31| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0) 0)) (exists ((|v_#valid_50| (Array Int Int))) (and (= (select |v_#valid_50| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0)) 0) (= |#valid| (store |v_#valid_50| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0) 1)))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_31| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_31| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|)) (= |v_ULTIMATE.start_sll_prepend_#in~head#1.base_15| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_76| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_76| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0) (store (store (select |v_#memory_$Pointer$.offset_76| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_80| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0)) 0))) |v_#memory_$Pointer$.offset_80|)))) (= |v_#memory_int_26| (store |v_#memory_int_115| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0) (store (select |v_#memory_int_115| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0)) 4 (select (select |v_#memory_int_26| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0)) 4)))) (= |#memory_int| (store |v_#memory_int_26| |v_ULTIMATE.start_sll_prepend_~head#1.base_18| (store (select |v_#memory_int_26| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_80| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0) (store (select |v_#memory_$Pointer$.offset_80| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0)) 4 (select (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_18| (store (select (store |v_#memory_$Pointer$.offset_80| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0) (store (select |v_#memory_$Pointer$.offset_80| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0)) 4 (select (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0 0))) (= (store (store |v_#memory_$Pointer$.base_83| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0) (store (select |v_#memory_$Pointer$.base_83| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0)) 4 (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_18| (store (select (store |v_#memory_$Pointer$.base_83| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0) (store (select |v_#memory_$Pointer$.base_83| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0)) 4 (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_18|) 0))) |#memory_$Pointer$.base|))) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= 5 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 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 [2023-12-02 19:59:08,289 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 19:59:08,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 19:59:08,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 22 [2023-12-02 19:59:08,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939210483] [2023-12-02 19:59:08,290 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 19:59:08,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-02 19:59:08,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:59:08,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-02 19:59:08,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1091, Unknown=2, NotChecked=66, Total=1260 [2023-12-02 19:59:08,292 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 22 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 19:59:08,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:59:08,740 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2023-12-02 19:59:08,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 19:59:08,740 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 23 [2023-12-02 19:59:08,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:59:08,741 INFO L225 Difference]: With dead ends: 24 [2023-12-02 19:59:08,741 INFO L226 Difference]: Without dead ends: 21 [2023-12-02 19:59:08,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=144, Invalid=1498, Unknown=2, NotChecked=78, Total=1722 [2023-12-02 19:59:08,742 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 14 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:59:08,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 119 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 19:59:08,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-02 19:59:08,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-12-02 19:59:08,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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) [2023-12-02 19:59:08,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-12-02 19:59:08,746 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 23 [2023-12-02 19:59:08,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:59:08,747 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-12-02 19:59:08,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 19:59:08,747 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-12-02 19:59:08,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 19:59:08,747 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:59:08,747 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:59:08,752 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 19:59:08,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:59:08,948 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:59:08,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:59:08,949 INFO L85 PathProgramCache]: Analyzing trace with hash 773386399, now seen corresponding path program 1 times [2023-12-02 19:59:08,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:59:08,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794433895] [2023-12-02 19:59:08,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:59:08,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:59:08,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:59:11,347 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:59:11,347 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:59:11,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794433895] [2023-12-02 19:59:11,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794433895] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:59:11,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854231749] [2023-12-02 19:59:11,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:59:11,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:59:11,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:59:11,349 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:59:11,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 19:59:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:59:11,495 INFO L262 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 148 conjunts are in the unsatisfiable core [2023-12-02 19:59:11,502 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:59:11,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 19:59:11,589 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 5 treesize of output 3 [2023-12-02 19:59:11,695 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 [2023-12-02 19:59:11,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:59:11,775 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 12 treesize of output 14 [2023-12-02 19:59:11,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 19:59:11,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:59:11,971 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 11 treesize of output 7 [2023-12-02 19:59:11,975 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 [2023-12-02 19:59:12,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:59:12,169 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-12-02 19:59:12,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-12-02 19:59:12,191 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 [2023-12-02 19:59:12,319 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 [2023-12-02 19:59:12,335 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 15 treesize of output 1 [2023-12-02 19:59:12,341 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 [2023-12-02 19:59:12,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:59:12,626 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 86 treesize of output 41 [2023-12-02 19:59:12,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:59:12,637 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 0 case distinctions, treesize of input 16 treesize of output 10 [2023-12-02 19:59:12,643 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 15 treesize of output 7 [2023-12-02 19:59:12,648 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 [2023-12-02 19:59:12,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:59:12,870 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-02 19:59:12,870 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 94 treesize of output 69 [2023-12-02 19:59:12,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:59:12,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:59:12,903 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-02 19:59:12,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-12-02 19:59:12,916 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 19 [2023-12-02 19:59:12,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:59:12,930 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 27 treesize of output 25 [2023-12-02 19:59:13,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:59:13,107 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 78 treesize of output 35 [2023-12-02 19:59:13,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:59:13,131 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2023-12-02 19:59:13,131 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 159 treesize of output 71 [2023-12-02 19:59:13,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:59:13,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:59:13,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 29 [2023-12-02 19:59:13,559 INFO L349 Elim1Store]: treesize reduction 34, result has 2.9 percent of original size [2023-12-02 19:59:13,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 219 treesize of output 63 [2023-12-02 19:59:13,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:59:13,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2023-12-02 19:59:13,723 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:59:13,723 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:59:15,962 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (|ULTIMATE.start_sll_prepend_#t~ret7#1.offset| Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse7 (+ |ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 4))) (let ((.cse3 (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse7 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse8 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse8 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |ULTIMATE.start_sll_prepend_#t~ret7#1.offset|)))) (.cse0 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|))))) (let ((.cse4 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse1 (select (select .cse0 .cse4) .cse5)) (.cse2 (+ (select (select .cse3 .cse4) .cse5) 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_607) |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_606) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))))))) is different from false [2023-12-02 19:59:25,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854231749] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:59:25,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [333546472] [2023-12-02 19:59:25,012 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-12-02 19:59:25,013 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:59:25,013 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:59:25,013 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:59:25,013 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:59:25,992 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 139 for LOIs [2023-12-02 19:59:26,195 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:59:35,118 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '874#(and (<= 1 |#StackHeapBarrier|) (<= 1 |ULTIMATE.start_main_~count~0#1|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |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 [2023-12-02 19:59:35,119 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 19:59:35,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 19:59:35,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 41 [2023-12-02 19:59:35,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717835217] [2023-12-02 19:59:35,119 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 19:59:35,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-02 19:59:35,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:59:35,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-02 19:59:35,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=3032, Unknown=2, NotChecked=110, Total=3306 [2023-12-02 19:59:35,122 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 41 states, 33 states have (on average 1.121212121212121) internal successors, (37), 31 states have internal predecessors, (37), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 19:59:37,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:59:37,009 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2023-12-02 19:59:37,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-02 19:59:37,010 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 33 states have (on average 1.121212121212121) internal successors, (37), 31 states have internal predecessors, (37), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 25 [2023-12-02 19:59:37,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:59:37,010 INFO L225 Difference]: With dead ends: 30 [2023-12-02 19:59:37,010 INFO L226 Difference]: Without dead ends: 28 [2023-12-02 19:59:37,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 795 ImplicationChecksByTransitivity, 23.3s TimeCoverageRelationStatistics Valid=258, Invalid=4299, Unknown=3, NotChecked=132, Total=4692 [2023-12-02 19:59:37,013 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 12 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 19:59:37,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 185 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-02 19:59:37,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-02 19:59:37,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2023-12-02 19:59:37,019 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) [2023-12-02 19:59:37,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2023-12-02 19:59:37,020 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 25 [2023-12-02 19:59:37,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:59:37,020 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2023-12-02 19:59:37,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 33 states have (on average 1.121212121212121) internal successors, (37), 31 states have internal predecessors, (37), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 19:59:37,020 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2023-12-02 19:59:37,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 19:59:37,021 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:59:37,021 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:59:37,027 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 19:59:37,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:59:37,222 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:59:37,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:59:37,222 INFO L85 PathProgramCache]: Analyzing trace with hash 773441424, now seen corresponding path program 1 times [2023-12-02 19:59:37,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:59:37,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631615782] [2023-12-02 19:59:37,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:59:37,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:59:37,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:59:38,362 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 19:59:38,362 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:59:38,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631615782] [2023-12-02 19:59:38,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631615782] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:59:38,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711558599] [2023-12-02 19:59:38,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:59:38,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:59:38,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:59:38,364 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:59:38,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 19:59:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:59:38,492 INFO L262 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 104 conjunts are in the unsatisfiable core [2023-12-02 19:59:38,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:59:38,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 19:59:38,545 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 5 treesize of output 3 [2023-12-02 19:59:38,643 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-12-02 19:59:38,644 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 1 case distinctions, treesize of input 12 treesize of output 14 [2023-12-02 19:59:38,758 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 19:59:38,758 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 1 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 19:59:38,877 INFO L349 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-12-02 19:59:38,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2023-12-02 19:59:38,995 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 15 treesize of output 1 [2023-12-02 19:59:39,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:59:39,190 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 59 treesize of output 26 [2023-12-02 19:59:39,201 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 19:59:39,201 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 1 case distinctions, treesize of input 16 treesize of output 10 [2023-12-02 19:59:39,206 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 [2023-12-02 19:59:39,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:59:39,367 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-02 19:59:39,368 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 67 treesize of output 50 [2023-12-02 19:59:39,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:59:39,395 INFO L349 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2023-12-02 19:59:39,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 33 [2023-12-02 19:59:39,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:59:39,418 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 [2023-12-02 19:59:39,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:59:39,537 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 67 treesize of output 21 [2023-12-02 19:59:39,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:59:39,557 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2023-12-02 19:59:39,557 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 132 treesize of output 56 [2023-12-02 19:59:39,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:59:39,720 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 0 case distinctions, treesize of input 159 treesize of output 122 [2023-12-02 19:59:39,827 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-12-02 19:59:39,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 35 [2023-12-02 19:59:39,833 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 19:59:39,833 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:59:40,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711558599] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:59:40,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1629213142] [2023-12-02 19:59:40,358 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2023-12-02 19:59:40,358 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:59:40,358 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:59:40,358 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:59:40,358 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:59:41,391 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 122 for LOIs [2023-12-02 19:59:41,601 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:59:51,066 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1117#(and (not (= |ULTIMATE.start_main_~count~0#1| (+ |ULTIMATE.start_main_~len~0#1| 1))) (or (and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~count~0#1| 1) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|)) (and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= 2 |ULTIMATE.start_main_~count~0#1|) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))) (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |ULTIMATE.start_main_~ptr~0#1.base| 0) (or (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4)) 0) (= 5 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (exists ((|v_#memory_int_26| (Array Int (Array Int Int))) (|v_#memory_int_165| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_prepend_~head#1.base_22| Int) (|v_#memory_$Pointer$.base_115| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_111| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_prepend_#in~head#1.base_19| Int)) (and (= |v_#memory_int_26| (store |v_#memory_int_165| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0) (store (select |v_#memory_int_165| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0)) 4 (select (select |v_#memory_int_26| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0)) 4)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_111| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0) (store (select |v_#memory_$Pointer$.offset_111| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0)) 4 (select (select |v_#memory_$Pointer$.offset_111| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_22| (store (select (store |v_#memory_$Pointer$.offset_111| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0) (store (select |v_#memory_$Pointer$.offset_111| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0)) 4 (select (select |v_#memory_$Pointer$.offset_111| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0 0))) (= |#memory_int| (store |v_#memory_int_26| |v_ULTIMATE.start_sll_prepend_~head#1.base_22| (store (select |v_#memory_int_26| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0)))) (or (and (= |v_ULTIMATE.start_sll_prepend_~head#1.base_22| |v_ULTIMATE.start_sll_prepend_#in~head#1.base_19|) (exists ((|v_#memory_$Pointer$.base_111| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_111| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.base_111| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.base_115| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0)) 0))) |v_#memory_$Pointer$.base_115|)) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_54| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_54| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0) 0)) (= |v_ULTIMATE.start_sll_prepend_#in~head#1.base_19| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_38| (Array Int (Array Int Int))) (|v_#memory_int_161| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_161| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0) (store (select |v_#memory_int_161| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0)) 4 (select (select |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0)) 4))) |v_#memory_int_38|) (= |v_#memory_int_165| (store |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0) (store (select |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0)) 0 5))))) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_107| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_111| (store |v_#memory_$Pointer$.offset_107| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.offset_107| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_111| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0)) 0))))) (exists ((|v_#valid_74| (Array Int Int))) (and (= |#valid| (store |v_#valid_74| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0) 1)) (= (select |v_#valid_74| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0)) 0))) (exists ((|v_#length_51| (Array Int Int))) (= |#length| (store |v_#length_51| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0) 8))) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_54| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_54| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (and (= |v_ULTIMATE.start_sll_prepend_~head#1.base_22| |v_ULTIMATE.start_sll_prepend_#in~head#1.base_19|) (exists ((|v_#memory_$Pointer$.base_111| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_111| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.base_111| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.base_115| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0)) 0))) |v_#memory_$Pointer$.base_115|)) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_53| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_53| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0) 0)) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_93| (Array Int (Array Int Int)))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_93| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (= |v_ULTIMATE.start_sll_prepend_#in~head#1.base_19| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_38| (Array Int (Array Int Int))) (|v_#memory_int_161| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_161| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0) (store (select |v_#memory_int_161| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0)) 4 (select (select |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0)) 4))) |v_#memory_int_38|) (= |v_#memory_int_165| (store |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0) (store (select |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0)) 0 5))))) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_107| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_111| (store |v_#memory_$Pointer$.offset_107| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.offset_107| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_111| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0)) 0))))) (exists ((|v_#valid_74| (Array Int Int))) (and (= |#valid| (store |v_#valid_74| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0) 1)) (= (select |v_#valid_74| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0)) 0))) (exists ((|v_#length_51| (Array Int Int))) (= |#length| (store |v_#length_51| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0) 8))))) (= (store (store |v_#memory_$Pointer$.base_115| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0) (store (select |v_#memory_$Pointer$.base_115| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0)) 4 (select (select |v_#memory_$Pointer$.base_115| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_22| (store (select (store |v_#memory_$Pointer$.base_115| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0) (store (select |v_#memory_$Pointer$.base_115| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0)) 4 (select (select |v_#memory_$Pointer$.base_115| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_22|) 0))) |#memory_$Pointer$.base|)))) (< 1 |ULTIMATE.start_main_~count~0#1|)))' at error location [2023-12-02 19:59:51,066 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 19:59:51,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 19:59:51,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 36 [2023-12-02 19:59:51,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267219991] [2023-12-02 19:59:51,066 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 19:59:51,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-02 19:59:51,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:59:51,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-02 19:59:51,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2588, Unknown=4, NotChecked=0, Total=2756 [2023-12-02 19:59:51,068 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 36 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 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) [2023-12-02 19:59:52,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:59:52,299 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2023-12-02 19:59:52,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-02 19:59:52,300 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 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 25 [2023-12-02 19:59:52,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:59:52,300 INFO L225 Difference]: With dead ends: 28 [2023-12-02 19:59:52,301 INFO L226 Difference]: Without dead ends: 25 [2023-12-02 19:59:52,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=258, Invalid=3643, Unknown=5, NotChecked=0, Total=3906 [2023-12-02 19:59:52,304 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 31 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 19:59:52,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 184 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 19:59:52,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-02 19:59:52,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2023-12-02 19:59:52,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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) [2023-12-02 19:59:52,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2023-12-02 19:59:52,312 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 25 [2023-12-02 19:59:52,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:59:52,312 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-12-02 19:59:52,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 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) [2023-12-02 19:59:52,313 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2023-12-02 19:59:52,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 19:59:52,314 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:59:52,314 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:59:52,319 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 19:59:52,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:59:52,515 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:59:52,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:59:52,515 INFO L85 PathProgramCache]: Analyzing trace with hash 195021242, now seen corresponding path program 2 times [2023-12-02 19:59:52,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:59:52,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447841335] [2023-12-02 19:59:52,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:59:52,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:59:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:59:54,779 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 19:59:54,779 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:59:54,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447841335] [2023-12-02 19:59:54,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447841335] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:59:54,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890624297] [2023-12-02 19:59:54,780 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 19:59:54,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:59:54,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:59:54,781 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:59:54,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 19:59:55,074 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 19:59:55,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:59:55,079 INFO L262 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 147 conjunts are in the unsatisfiable core [2023-12-02 19:59:55,085 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:59:55,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 19:59:55,149 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 5 treesize of output 3 [2023-12-02 19:59:55,262 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 19:59:55,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-02 19:59:55,352 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 [2023-12-02 19:59:55,358 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 [2023-12-02 19:59:55,456 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 11 treesize of output 7 [2023-12-02 19:59:55,624 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 19:59:55,625 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 16 treesize of output 15 [2023-12-02 19:59:55,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:59:55,657 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 19:59:55,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2023-12-02 19:59:55,676 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 [2023-12-02 19:59:55,808 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 27 treesize of output 15 [2023-12-02 19:59:55,823 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 23 treesize of output 22 [2023-12-02 19:59:56,081 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 19:59:56,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 47 [2023-12-02 19:59:56,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:59:56,089 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 0 case distinctions, treesize of input 16 treesize of output 10 [2023-12-02 19:59:56,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:59:56,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-12-02 19:59:56,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:59:56,260 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2023-12-02 19:59:56,260 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 109 treesize of output 84 [2023-12-02 19:59:56,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:59:56,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:59:56,287 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-02 19:59:56,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-12-02 19:59:56,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:59:56,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:59:56,301 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 0 case distinctions, treesize of input 42 treesize of output 43 [2023-12-02 19:59:56,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:59:56,457 INFO L349 Elim1Store]: treesize reduction 88, result has 14.6 percent of original size [2023-12-02 19:59:56,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 174 treesize of output 84 [2023-12-02 19:59:56,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:59:56,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:59:56,477 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 0 case distinctions, treesize of input 113 treesize of output 73 [2023-12-02 19:59:57,140 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 19:59:57,140 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:00:17,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890624297] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:00:17,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1491733447] [2023-12-02 20:00:17,782 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-12-02 20:00:17,782 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 20:00:17,783 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 20:00:17,783 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 20:00:17,783 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 20:00:18,649 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 139 for LOIs [2023-12-02 20:00:18,797 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 20:00:29,972 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1377#(and (<= 1 |#StackHeapBarrier|) (<= 1 |ULTIMATE.start_main_~count~0#1|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |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 [2023-12-02 20:00:29,972 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 20:00:29,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 20:00:29,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 40 [2023-12-02 20:00:29,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496064672] [2023-12-02 20:00:29,973 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 20:00:29,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-02 20:00:29,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 20:00:29,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-02 20:00:29,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=3138, Unknown=4, NotChecked=0, Total=3306 [2023-12-02 20:00:29,976 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 41 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 32 states have internal predecessors, (39), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 20:00:33,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 20:00:33,068 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2023-12-02 20:00:33,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-02 20:00:33,069 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 32 states have internal predecessors, (39), 6 states have call successors, (6), 2 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 [2023-12-02 20:00:33,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 20:00:33,070 INFO L225 Difference]: With dead ends: 43 [2023-12-02 20:00:33,070 INFO L226 Difference]: Without dead ends: 38 [2023-12-02 20:00:33,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 866 ImplicationChecksByTransitivity, 35.4s TimeCoverageRelationStatistics Valid=236, Invalid=4451, Unknown=5, NotChecked=0, Total=4692 [2023-12-02 20:00:33,073 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-02 20:00:33,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 204 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-02 20:00:33,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-02 20:00:33,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2023-12-02 20:00:33,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 20:00:33,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2023-12-02 20:00:33,087 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 27 [2023-12-02 20:00:33,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 20:00:33,087 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2023-12-02 20:00:33,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 32 states have internal predecessors, (39), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 20:00:33,087 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2023-12-02 20:00:33,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 20:00:33,089 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 20:00:33,089 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 20:00:33,097 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 20:00:33,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:00:33,290 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:00:33,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:00:33,290 INFO L85 PathProgramCache]: Analyzing trace with hash 195076267, now seen corresponding path program 2 times [2023-12-02 20:00:33,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 20:00:33,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491679586] [2023-12-02 20:00:33,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:00:33,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:00:33,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:00:33,425 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 20:00:33,426 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 20:00:33,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491679586] [2023-12-02 20:00:33,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491679586] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:00:33,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378278443] [2023-12-02 20:00:33,426 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 20:00:33,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:00:33,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 20:00:33,427 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:00:33,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 20:00:33,771 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 20:00:33,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:00:33,773 INFO L262 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-02 20:00:33,776 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:00:33,823 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 20:00:33,823 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:00:33,871 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 20:00:33,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378278443] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:00:33,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [770067600] [2023-12-02 20:00:33,874 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2023-12-02 20:00:33,874 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 20:00:33,874 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 20:00:33,874 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 20:00:33,874 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 20:00:34,960 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 139 for LOIs [2023-12-02 20:00:35,104 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 20:00:54,672 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1686#(and (not (= |ULTIMATE.start_main_~count~0#1| (+ |ULTIMATE.start_main_~len~0#1| 1))) (or (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4)) 0) (exists ((|v_ULTIMATE.start_sll_prepend_#in~head#1.base_24| Int) (|v_#memory_int_213| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_prepend_~head#1.base_26| Int) (|v_#memory_$Pointer$.offset_150| (Array Int (Array Int Int))) (|v_#memory_int_26| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_154| (Array Int (Array Int Int)))) (and (= (store (store |v_#memory_$Pointer$.base_154| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0) (store (select |v_#memory_$Pointer$.base_154| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0)) 4 (select (select |v_#memory_$Pointer$.base_154| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_26| (store (select (store |v_#memory_$Pointer$.base_154| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0) (store (select |v_#memory_$Pointer$.base_154| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0)) 4 (select (select |v_#memory_$Pointer$.base_154| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0))) |#memory_$Pointer$.base|) (= |#memory_int| (store |v_#memory_int_26| |v_ULTIMATE.start_sll_prepend_~head#1.base_26| (store (select |v_#memory_int_26| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0)))) (or (and (exists ((|v_#memory_int_212| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_76| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_76| (store |v_#memory_int_212| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_212| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_76| |ULTIMATE.start_sll_create_#res#1.base|) 4))))) (exists ((|v_#length_73| (Array Int Int))) (= (store |v_#length_73| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0) 8) |#length|)) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0) 1) |#StackHeapBarrier|) (= |v_ULTIMATE.start_sll_prepend_#in~head#1.base_24| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.offset_149| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_149| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_149| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#valid_101| (Array Int Int))) (and (= |#valid| (store |v_#valid_101| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0) 1)) (= (select |v_#valid_101| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0)) 0))) (exists ((|v_#memory_$Pointer$.base_150| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_150| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0) (store (store (select |v_#memory_$Pointer$.base_150| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.base_154| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0)) 0))) |v_#memory_$Pointer$.base_154|)) (exists ((|v_#memory_$Pointer$.offset_146| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_146| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0) (store (store (select |v_#memory_$Pointer$.offset_146| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_150| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0)) 0))) |v_#memory_$Pointer$.offset_150|)) (= |v_ULTIMATE.start_sll_prepend_~head#1.base_26| |v_ULTIMATE.start_sll_prepend_#in~head#1.base_24|) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_76| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_153| (Array Int (Array Int Int)))) (and (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_76| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|) (= (store |v_#memory_$Pointer$.base_153| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_153| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_76| |ULTIMATE.start_sll_create_#res#1.base|) 4))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_76|))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0) 0)) (exists ((|v_#memory_int_209| (Array Int (Array Int Int))) (|v_#memory_int_38| (Array Int (Array Int Int)))) (and (= |v_#memory_int_213| (store |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0) (store (select |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0)) 0 5))) (= (store |v_#memory_int_209| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0) (store (select |v_#memory_int_209| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0)) 4 (select (select |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0)) 4))) |v_#memory_int_38|)))) (and (exists ((|v_#length_73| (Array Int Int))) (= (store |v_#length_73| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0) 8) |#length|)) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0) 1) |#StackHeapBarrier|) (= |v_ULTIMATE.start_sll_prepend_#in~head#1.base_24| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.offset_149| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_149| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_149| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_75| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_153| (Array Int (Array Int Int)))) (and (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_75| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_75| (store |v_#memory_$Pointer$.base_153| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_153| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_75| |ULTIMATE.start_sll_create_#res#1.base|) 4)))))) (exists ((|v_#valid_101| (Array Int Int))) (and (= |#valid| (store |v_#valid_101| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0) 1)) (= (select |v_#valid_101| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0)) 0))) (exists ((|v_#memory_int_212| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_75| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_75| (store |v_#memory_int_212| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_212| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_75| |ULTIMATE.start_sll_create_#res#1.base|) 4))))) (exists ((|v_#memory_$Pointer$.base_150| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_150| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0) (store (store (select |v_#memory_$Pointer$.base_150| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.base_154| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0)) 0))) |v_#memory_$Pointer$.base_154|)) (exists ((|v_#memory_$Pointer$.offset_146| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_146| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0) (store (store (select |v_#memory_$Pointer$.offset_146| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_150| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0)) 0))) |v_#memory_$Pointer$.offset_150|)) (= |v_ULTIMATE.start_sll_prepend_~head#1.base_26| |v_ULTIMATE.start_sll_prepend_#in~head#1.base_24|) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0) 0)) (exists ((|v_#memory_int_209| (Array Int (Array Int Int))) (|v_#memory_int_38| (Array Int (Array Int Int)))) (and (= |v_#memory_int_213| (store |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0) (store (select |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0)) 0 5))) (= (store |v_#memory_int_209| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0) (store (select |v_#memory_int_209| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0)) 4 (select (select |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0)) 4))) |v_#memory_int_38|))))) (= |v_#memory_int_26| (store |v_#memory_int_213| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0) (store (select |v_#memory_int_213| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0)) 4 (select (select |v_#memory_int_26| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0)) 4)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_150| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0) (store (select |v_#memory_$Pointer$.offset_150| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0)) 4 (select (select |v_#memory_$Pointer$.offset_150| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_26| (store (select (store |v_#memory_$Pointer$.offset_150| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0) (store (select |v_#memory_$Pointer$.offset_150| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0)) 4 (select (select |v_#memory_$Pointer$.offset_150| |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_26|) 0 0))))) (= 5 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (< 1 |ULTIMATE.start_main_~count~0#1|)) (or (and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~count~0#1| 1) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|)) (and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= 2 |ULTIMATE.start_main_~count~0#1|) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))) (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |ULTIMATE.start_main_~ptr~0#1.base| 0))' at error location [2023-12-02 20:00:54,672 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 20:00:54,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:00:54,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2023-12-02 20:00:54,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10303316] [2023-12-02 20:00:54,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:00:54,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 20:00:54,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 20:00:54,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 20:00:54,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=395, Unknown=6, NotChecked=0, Total=462 [2023-12-02 20:00:54,674 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 20:00:54,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 20:00:54,763 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2023-12-02 20:00:54,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:00:54,763 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2023-12-02 20:00:54,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 20:00:54,764 INFO L225 Difference]: With dead ends: 41 [2023-12-02 20:00:54,764 INFO L226 Difference]: Without dead ends: 30 [2023-12-02 20:00:54,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=61, Invalid=395, Unknown=6, NotChecked=0, Total=462 [2023-12-02 20:00:54,765 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 20:00:54,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 47 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 20:00:54,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-02 20:00:54,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2023-12-02 20:00:54,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-02 20:00:54,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2023-12-02 20:00:54,774 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 27 [2023-12-02 20:00:54,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 20:00:54,774 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2023-12-02 20:00:54,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 20:00:54,774 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2023-12-02 20:00:54,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-02 20:00:54,775 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 20:00:54,775 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 20:00:54,782 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 20:00:54,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:00:54,976 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:00:54,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:00:54,977 INFO L85 PathProgramCache]: Analyzing trace with hash 62920922, now seen corresponding path program 3 times [2023-12-02 20:00:54,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 20:00:54,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972168250] [2023-12-02 20:00:54,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:00:54,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:00:55,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:00:55,087 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-02 20:00:55,088 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 20:00:55,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972168250] [2023-12-02 20:00:55,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972168250] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:00:55,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468404132] [2023-12-02 20:00:55,089 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 20:00:55,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:00:55,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 20:00:55,090 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:00:55,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 20:00:55,899 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 20:00:55,899 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:00:55,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 20:00:55,903 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:00:55,918 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-02 20:00:55,918 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 20:00:55,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468404132] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:00:55,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 20:00:55,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-12-02 20:00:55,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991627273] [2023-12-02 20:00:55,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:00:55,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 20:00:55,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 20:00:55,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 20:00:55,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-02 20:00:55,920 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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) [2023-12-02 20:00:55,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 20:00:55,942 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2023-12-02 20:00:55,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:00:55,942 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 33 [2023-12-02 20:00:55,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 20:00:55,942 INFO L225 Difference]: With dead ends: 30 [2023-12-02 20:00:55,942 INFO L226 Difference]: Without dead ends: 0 [2023-12-02 20:00:55,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-02 20:00:55,943 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 20:00:55,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 20:00:55,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-02 20:00:55,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-02 20:00:55,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:00:55,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-02 20:00:55,944 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2023-12-02 20:00:55,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 20:00:55,944 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-02 20:00:55,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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) [2023-12-02 20:00:55,945 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-02 20:00:55,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-02 20:00:55,947 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-02 20:00:55,955 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 20:00:56,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-02 20:00:56,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-02 20:00:56,739 INFO L902 garLoopResultBuilder]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2023-12-02 20:00:56,739 INFO L899 garLoopResultBuilder]: For program point L618(lines 618 620) no Hoare annotation was computed. [2023-12-02 20:00:56,739 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 604 631) no Hoare annotation was computed. [2023-12-02 20:00:56,740 INFO L895 garLoopResultBuilder]: At program point L585-3(lines 585 589) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (.cse14 (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))) (let ((.cse2 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)) (.cse4 (not .cse14)) (.cse1 (= .cse0 0)) (.cse11 (= (select (select |#memory_int| |ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1)) (.cse12 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (.cse13 (<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|)) (.cse3 (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)) (.cse5 (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse6 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse7 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse8 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse9 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse10 (= |ULTIMATE.start_sll_create_~data#1| 1))) (or (and (= (select (select |#memory_int| .cse0) 0) 1) (not .cse1) .cse2 .cse3 .cse4 (= (select |#valid| .cse0) 1) (<= (+ .cse0 1) |#StackHeapBarrier|) .cse5 (<= |ULTIMATE.start_sll_create_~len#1| 0) .cse6 (= (select (select |#memory_$Pointer$.base| .cse0) 4) 0) .cse7 .cse8 .cse9 .cse10 .cse11 (= (select (select |#memory_$Pointer$.offset| .cse0) 4) 0) .cse12 .cse13) (and .cse2 .cse3 .cse4 .cse5 .cse1 .cse6 (= |ULTIMATE.start_sll_create_~len#1| 1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (= 2 |ULTIMATE.start_sll_create_~len#1|) .cse3 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2023-12-02 20:00:56,740 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 629) no Hoare annotation was computed. [2023-12-02 20:00:56,740 INFO L895 garLoopResultBuilder]: At program point L586(line 586) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)) (.cse2 (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse1 (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (.cse3 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse5 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse6 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse7 (= |ULTIMATE.start_sll_create_~data#1| 1))) (or (and (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) .cse0 (not .cse1) .cse2 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) .cse3 (= |ULTIMATE.start_sll_create_~len#1| 1) .cse4 .cse5 .cse6 .cse7 (= (select (select |#memory_int| |ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|)) (and (= 2 |ULTIMATE.start_sll_create_~len#1|) .cse0 .cse2 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7))) [2023-12-02 20:00:56,740 INFO L899 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2023-12-02 20:00:56,740 INFO L899 garLoopResultBuilder]: For program point L611(lines 611 613) no Hoare annotation was computed. [2023-12-02 20:00:56,740 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-02 20:00:56,740 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-02 20:00:56,741 INFO L895 garLoopResultBuilder]: At program point L616-2(lines 616 623) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_main_~ptr~0#1.base| 0))) (let ((.cse0 (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)) (.cse6 (not .cse2)) (.cse1 (= |ULTIMATE.start_main_~ptr~0#1.offset| 0)) (.cse3 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse11 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse4 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse5 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse12 (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) 0) 1))) (or (and .cse0 (= |ULTIMATE.start_main_~count~0#1| 3) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse3 (exists ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse9 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse10 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4))) (let ((.cse7 (select (select |#memory_$Pointer$.base| .cse9) .cse10))) (let ((.cse8 (select (select |#memory_$Pointer$.base| .cse7) 4))) (and (not (= .cse7 .cse8)) (= (select (select |#memory_$Pointer$.offset| .cse9) .cse10) 0) (= (select (select |#memory_$Pointer$.base| .cse8) 4) 0) (<= (+ .cse7 2) |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse9 .cse8)) (= (select (select |#memory_$Pointer$.offset| .cse8) 4) 0) (<= (+ .cse9 2) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse8) (= (select (select |#memory_$Pointer$.offset| .cse7) 4) 0) (not (= .cse7 .cse9)) (not (= .cse8 |ULTIMATE.start_main_~#s~0#1.base|))))))) .cse11 .cse4 .cse5 (= 2 |ULTIMATE.start_main_~count~0#1|) .cse12) (and (= |ULTIMATE.start_main_~count~0#1| 1) .cse0 .cse6 (exists ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse15 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse16 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4))) (let ((.cse13 (select (select |#memory_$Pointer$.base| .cse15) .cse16))) (let ((.cse14 (select (select |#memory_$Pointer$.base| .cse13) 4))) (and (not (= .cse13 .cse14)) (= (select (select |#memory_$Pointer$.offset| .cse15) .cse16) 0) (= (select (select |#memory_$Pointer$.base| .cse14) 4) 0) (<= (+ .cse13 2) |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse15 .cse14)) (= .cse13 |ULTIMATE.start_main_~ptr~0#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse14) 4) 0) (<= (+ .cse15 2) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse13) 4) 0) (not (= .cse13 .cse15)) (not (= .cse14 |ULTIMATE.start_main_~#s~0#1.base|))))))) (exists ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse19 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse20 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4))) (let ((.cse17 (select (select |#memory_$Pointer$.base| .cse19) .cse20))) (let ((.cse18 (select (select |#memory_$Pointer$.base| .cse17) 4))) (and (not (= .cse17 .cse18)) (= (select (select |#memory_$Pointer$.offset| .cse19) .cse20) 0) (not (= .cse19 .cse18)) (= (select (select |#memory_int| .cse18) 0) 1) (= .cse17 |ULTIMATE.start_main_~ptr~0#1.base|) (<= (+ .cse19 2) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse17) 4) 0) (<= (+ 2 .cse18) |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse17 |ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse17 .cse19))))))) .cse1 (exists ((v_subst_3 Int) (v_arrayElimIndex_13 Int)) (let ((.cse22 (select (select |#memory_$Pointer$.base| v_subst_3) 0))) (let ((.cse21 (select (select |#memory_$Pointer$.base| .cse22) v_arrayElimIndex_13))) (let ((.cse23 (select (select |#memory_$Pointer$.base| .cse21) 4))) (and (not (= .cse21 v_subst_3)) (= .cse21 |ULTIMATE.start_main_~ptr~0#1.base|) (not (= .cse21 .cse22)) (not (= .cse23 0)) (not (= .cse23 .cse22)) (<= (+ 2 .cse22) v_subst_3) (not (= .cse23 .cse21))))))) .cse3 .cse11 .cse4 .cse5 .cse12)))) [2023-12-02 20:00:56,741 INFO L899 garLoopResultBuilder]: For program point L616-3(lines 604 631) no Hoare annotation was computed. [2023-12-02 20:00:56,741 INFO L895 garLoopResultBuilder]: At program point L600(line 600) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |#memory_$Pointer$.base| .cse0) 4))) (and (not (= |ULTIMATE.start_main_~uneq~0#1| 1)) (= (select (select |#memory_$Pointer$.offset| .cse0) 4) 0) (= (select (select |#memory_int| .cse0) 0) 1) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_sll_prepend_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.base| .cse1) 4) 0) (= (select |#valid| .cse0) 1) (not (= .cse0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse1) 4) 0) (<= (+ .cse0 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select (select |#memory_int| .cse1) 0) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#valid| .cse1) 1) (= |ULTIMATE.start_main_~len~0#1| 2) (not (= .cse1 0)) (= |ULTIMATE.start_sll_prepend_~head#1.offset| 0) (<= (+ .cse1 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~uneq~0#1| |ULTIMATE.start_sll_prepend_~data#1|)))) [2023-12-02 20:00:56,741 INFO L899 garLoopResultBuilder]: For program point L600-1(line 600) no Hoare annotation was computed. [2023-12-02 20:00:56,741 INFO L899 garLoopResultBuilder]: For program point main_ERROR#1(lines 604 631) no Hoare annotation was computed. [2023-12-02 20:00:56,742 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2023-12-02 20:00:56,742 INFO L899 garLoopResultBuilder]: For program point L572(line 572) no Hoare annotation was computed. [2023-12-02 20:00:56,742 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 574 582) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2023-12-02 20:00:56,742 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2023-12-02 20:00:56,744 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1] [2023-12-02 20:00:56,746 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 20:00:56,761 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~#s~0!base] could not be translated [2023-12-02 20:00:56,762 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~#s~0!base] could not be translated [2023-12-02 20:00:56,763 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_main_~#s~0#1.base : int :: (((((((((!(#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4] == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4]][4]) && #memory_$Pointer$.offset[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4] == 0) && #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4]][4]][4] == 0) && #memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4] + 2 <= ULTIMATE.start_main_~#s~0#1.base) && !(#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0] == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4]][4])) && #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4]][4]][4] == 0) && #memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0] + 2 <= ULTIMATE.start_main_~#s~0#1.base) && ~ptr~0!base == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4]][4]) && #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4]][4] == 0) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4] == #memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0])) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4]][4] == ULTIMATE.start_main_~#s~0#1.base)) could not be translated [2023-12-02 20:00:56,763 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~ptr~0!base][0] could not be translated [2023-12-02 20:00:56,764 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~#s~0!base] could not be translated [2023-12-02 20:00:56,764 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_main_~#s~0#1.base : int :: (((((((((!(#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4] == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4]][4]) && #memory_$Pointer$.offset[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4] == 0) && #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4]][4]][4] == 0) && #memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4] + 2 <= ULTIMATE.start_main_~#s~0#1.base) && !(#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0] == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4]][4])) && #memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4] == ~ptr~0!base) && #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4]][4]][4] == 0) && #memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0] + 2 <= ULTIMATE.start_main_~#s~0#1.base) && #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4]][4] == 0) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4] == #memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0])) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4]][4] == ULTIMATE.start_main_~#s~0#1.base)) could not be translated [2023-12-02 20:00:56,765 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_main_~#s~0#1.base : int :: ((((((((!(#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4] == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4]][4]) && #memory_$Pointer$.offset[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4] == 0) && !(#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0] == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4]][4])) && #memory_int[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4]][4]][0] == 1) && #memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4] == ~ptr~0!base) && #memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0] + 2 <= ULTIMATE.start_main_~#s~0#1.base) && #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4]][4] == 0) && 2 + #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4]][4] <= ULTIMATE.start_main_~#s~0#1.base) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4] == ULTIMATE.start_main_~#s~0#1.base)) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4] == #memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0])) could not be translated [2023-12-02 20:00:56,765 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_3 : int, v_arrayElimIndex_13 : int :: (((((!(#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_3][0]][v_arrayElimIndex_13] == v_subst_3) && #memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_3][0]][v_arrayElimIndex_13] == ~ptr~0!base) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_3][0]][v_arrayElimIndex_13] == #memory_$Pointer$.base[v_subst_3][0])) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_3][0]][v_arrayElimIndex_13]][4] == 0)) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_3][0]][v_arrayElimIndex_13]][4] == #memory_$Pointer$.base[v_subst_3][0])) && 2 + #memory_$Pointer$.base[v_subst_3][0] <= v_subst_3) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_3][0]][v_arrayElimIndex_13]][4] == #memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_3][0]][v_arrayElimIndex_13])) could not be translated [2023-12-02 20:00:56,765 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~ptr~0!base][0] could not be translated [2023-12-02 20:00:56,768 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head~0!base][4]][0] could not be translated [2023-12-02 20:00:56,768 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated [2023-12-02 20:00:56,768 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-12-02 20:00:56,769 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~#s~0!base] could not be translated [2023-12-02 20:00:56,769 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$.base[~head~0!base][4]] could not be translated [2023-12-02 20:00:56,769 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated [2023-12-02 20:00:56,769 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~#s~0 [2023-12-02 20:00:56,769 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4] could not be translated [2023-12-02 20:00:56,769 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~head~0!base][0] could not be translated [2023-12-02 20:00:56,770 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~head~0!base][4]][4] could not be translated [2023-12-02 20:00:56,770 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~head~0!base][4] could not be translated [2023-12-02 20:00:56,770 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-12-02 20:00:56,770 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~#s~0!base] could not be translated [2023-12-02 20:00:56,770 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated [2023-12-02 20:00:56,770 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~#s~0 [2023-12-02 20:00:56,770 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~head~0!base][0] could not be translated [2023-12-02 20:00:56,771 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~head~0!base][4] could not be translated [2023-12-02 20:00:56,771 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~#s~0!base] could not be translated [2023-12-02 20:00:56,771 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~#s~0 [2023-12-02 20:00:56,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 08:00:56 BoogieIcfgContainer [2023-12-02 20:00:56,771 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 20:00:56,772 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 20:00:56,772 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 20:00:56,772 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 20:00:56,773 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:58:23" (3/4) ... [2023-12-02 20:00:56,775 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-12-02 20:00:56,778 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2023-12-02 20:00:56,783 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2023-12-02 20:00:56,783 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2023-12-02 20:00:56,784 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-12-02 20:00:56,784 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-12-02 20:00:56,874 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/witness.graphml [2023-12-02 20:00:56,874 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/witness.yml [2023-12-02 20:00:56,874 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 20:00:56,875 INFO L158 Benchmark]: Toolchain (without parser) took 154379.36ms. Allocated memory was 182.5MB in the beginning and 383.8MB in the end (delta: 201.3MB). Free memory was 149.3MB in the beginning and 183.6MB in the end (delta: -34.2MB). Peak memory consumption was 168.8MB. Max. memory is 16.1GB. [2023-12-02 20:00:56,875 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 117.4MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 20:00:56,876 INFO L158 Benchmark]: CACSL2BoogieTranslator took 424.14ms. Allocated memory is still 182.5MB. Free memory was 149.3MB in the beginning and 132.2MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-12-02 20:00:56,876 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.96ms. Allocated memory is still 182.5MB. Free memory was 131.4MB in the beginning and 130.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 20:00:56,876 INFO L158 Benchmark]: Boogie Preprocessor took 29.40ms. Allocated memory is still 182.5MB. Free memory was 129.3MB in the beginning and 128.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 20:00:56,876 INFO L158 Benchmark]: RCFGBuilder took 495.94ms. Allocated memory is still 182.5MB. Free memory was 128.0MB in the beginning and 109.6MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-12-02 20:00:56,877 INFO L158 Benchmark]: TraceAbstraction took 153270.57ms. Allocated memory was 182.5MB in the beginning and 383.8MB in the end (delta: 201.3MB). Free memory was 108.3MB in the beginning and 188.8MB in the end (delta: -80.5MB). Peak memory consumption was 122.7MB. Max. memory is 16.1GB. [2023-12-02 20:00:56,877 INFO L158 Benchmark]: Witness Printer took 102.44ms. Allocated memory is still 383.8MB. Free memory was 188.8MB in the beginning and 183.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-12-02 20:00:56,878 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 117.4MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 424.14ms. Allocated memory is still 182.5MB. Free memory was 149.3MB in the beginning and 132.2MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.96ms. Allocated memory is still 182.5MB. Free memory was 131.4MB in the beginning and 130.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.40ms. Allocated memory is still 182.5MB. Free memory was 129.3MB in the beginning and 128.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 495.94ms. Allocated memory is still 182.5MB. Free memory was 128.0MB in the beginning and 109.6MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 153270.57ms. Allocated memory was 182.5MB in the beginning and 383.8MB in the end (delta: 201.3MB). Free memory was 108.3MB in the beginning and 188.8MB in the end (delta: -80.5MB). Peak memory consumption was 122.7MB. Max. memory is 16.1GB. * Witness Printer took 102.44ms. Allocated memory is still 383.8MB. Free memory was 188.8MB in the beginning and 183.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~#s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~#s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_main_~#s~0#1.base : int :: (((((((((!(#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4] == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4]][4]) && #memory_$Pointer$.offset[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4] == 0) && #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4]][4]][4] == 0) && #memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4] + 2 <= ULTIMATE.start_main_~#s~0#1.base) && !(#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0] == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4]][4])) && #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4]][4]][4] == 0) && #memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0] + 2 <= ULTIMATE.start_main_~#s~0#1.base) && ~ptr~0!base == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4]][4]) && #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4]][4] == 0) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4] == #memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0])) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4]][4] == ULTIMATE.start_main_~#s~0#1.base)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~ptr~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~#s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_main_~#s~0#1.base : int :: (((((((((!(#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4] == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4]][4]) && #memory_$Pointer$.offset[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4] == 0) && #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4]][4]][4] == 0) && #memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4] + 2 <= ULTIMATE.start_main_~#s~0#1.base) && !(#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0] == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4]][4])) && #memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4] == ~ptr~0!base) && #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4]][4]][4] == 0) && #memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0] + 2 <= ULTIMATE.start_main_~#s~0#1.base) && #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4]][4] == 0) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4] == #memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0])) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4]][4] == ULTIMATE.start_main_~#s~0#1.base)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_main_~#s~0#1.base : int :: ((((((((!(#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4] == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4]][4]) && #memory_$Pointer$.offset[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4] == 0) && !(#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0] == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4]][4])) && #memory_int[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4]][4]][0] == 1) && #memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4] == ~ptr~0!base) && #memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0] + 2 <= ULTIMATE.start_main_~#s~0#1.base) && #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4]][4] == 0) && 2 + #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4]][4] <= ULTIMATE.start_main_~#s~0#1.base) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4] == ULTIMATE.start_main_~#s~0#1.base)) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0]][#memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][0] + 4] == #memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][0])) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_3 : int, v_arrayElimIndex_13 : int :: (((((!(#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_3][0]][v_arrayElimIndex_13] == v_subst_3) && #memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_3][0]][v_arrayElimIndex_13] == ~ptr~0!base) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_3][0]][v_arrayElimIndex_13] == #memory_$Pointer$.base[v_subst_3][0])) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_3][0]][v_arrayElimIndex_13]][4] == 0)) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_3][0]][v_arrayElimIndex_13]][4] == #memory_$Pointer$.base[v_subst_3][0])) && 2 + #memory_$Pointer$.base[v_subst_3][0] <= v_subst_3) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_3][0]][v_arrayElimIndex_13]][4] == #memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_3][0]][v_arrayElimIndex_13])) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~ptr~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head~0!base][4]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~#s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$.base[~head~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~#s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~head~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~#s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~#s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~head~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~#s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~#s~0 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 629]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 153.2s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 108 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 104 mSDsluCounter, 933 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 831 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2365 IncrementalHoareTripleChecker+Invalid, 2396 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 102 mSDtfsCounter, 2365 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 601 GetRequests, 272 SyntacticMatches, 2 SemanticMatches, 327 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3163 ImplicationChecksByTransitivity, 123.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=8, InterpolantAutomatonStates: 105, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 19 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 12 PreInvPairs, 22 NumberOfFragments, 1408 HoareAnnotationTreeSize, 12 FomulaSimplifications, 311 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 103 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 57.2s InterpolantComputationTime, 426 NumberOfCodeBlocks, 426 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 448 ConstructedInterpolants, 10 QuantifiedInterpolants, 7426 SizeOfPredicates, 102 NumberOfNonLiveVariables, 2688 ConjunctsInSsa, 571 ConjunctsInUnsatCore, 20 InterpolantComputations, 3 PerfectInterpolantSequences, 208/310 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: ((((count == 3) && (len == 2)) || (((data == 1) && (len == 2)) && (2 == count))) || (((count == 1) && (data == 1)) && (len == 2))) - InvariantResult [Line: 585]: Loop Invariant Derived loop invariant: ((((((len <= 0) && (data == 1)) && (len == 2)) && (data == 1)) || ((((len == 1) && (data == 1)) && (len == 2)) && (data == 1))) || ((((2 == len) && (data == 1)) && (len == 2)) && (data == 1))) RESULT: Ultimate proved your program to be correct! [2023-12-02 20:00:56,947 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e47d11d-9d90-426e-af61-873788e4298e/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE