./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/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_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 19:21:29,212 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 19:21:29,274 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Overflow-32bit-Taipan_Default.epf [2023-12-02 19:21:29,278 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 19:21:29,279 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 19:21:29,304 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 19:21:29,304 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 19:21:29,304 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 19:21:29,305 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 19:21:29,306 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 19:21:29,306 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 19:21:29,307 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 19:21:29,307 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 19:21:29,308 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 19:21:29,308 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 19:21:29,309 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 19:21:29,309 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 19:21:29,310 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 19:21:29,310 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 19:21:29,311 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 19:21:29,311 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 19:21:29,312 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 19:21:29,313 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 19:21:29,313 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 19:21:29,314 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 19:21:29,314 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 19:21:29,315 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 19:21:29,315 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 19:21:29,316 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 19:21:29,316 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 19:21:29,316 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 19:21:29,317 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-12-02 19:21:29,317 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 19:21:29,317 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 19:21:29,317 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 19:21:29,318 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 19:21:29,318 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 19:21:29,318 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 19:21:29,318 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 19:21:29,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 19:21:29,319 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 19:21:29,319 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 19:21:29,319 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 19:21:29,319 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 19:21:29,320 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 19:21:29,320 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 19:21:29,320 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 19:21:29,320 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 19:21:29,320 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 19:21:29,320 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_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/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_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/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 ! overflow) ) 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 -> e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 [2023-12-02 19:21:29,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 19:21:29,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 19:21:29,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 19:21:29,549 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 19:21:29,549 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 19:21:29,551 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2023-12-02 19:21:32,474 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 19:21:32,731 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 19:21:32,732 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2023-12-02 19:21:32,749 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/data/8e0b2242c/7917c2878efc457aae687f3f19fa7c57/FLAGfb52736e9 [2023-12-02 19:21:32,767 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/data/8e0b2242c/7917c2878efc457aae687f3f19fa7c57 [2023-12-02 19:21:32,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 19:21:32,772 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 19:21:32,773 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 19:21:32,774 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 19:21:32,780 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 19:21:32,781 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:21:32" (1/1) ... [2023-12-02 19:21:32,782 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21478d1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:21:32, skipping insertion in model container [2023-12-02 19:21:32,783 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:21:32" (1/1) ... [2023-12-02 19:21:32,835 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 19:21:33,115 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 19:21:33,125 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 19:21:33,164 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 19:21:33,196 INFO L206 MainTranslator]: Completed translation [2023-12-02 19:21:33,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:21:33 WrapperNode [2023-12-02 19:21:33,197 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 19:21:33,198 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 19:21:33,198 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 19:21:33,199 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 19:21:33,206 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:21:33" (1/1) ... [2023-12-02 19:21:33,220 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:21:33" (1/1) ... [2023-12-02 19:21:33,246 INFO L138 Inliner]: procedures = 127, calls = 31, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 114 [2023-12-02 19:21:33,246 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 19:21:33,247 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 19:21:33,247 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 19:21:33,247 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 19:21:33,257 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:21:33" (1/1) ... [2023-12-02 19:21:33,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:21:33" (1/1) ... [2023-12-02 19:21:33,262 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:21:33" (1/1) ... [2023-12-02 19:21:33,264 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:21:33" (1/1) ... [2023-12-02 19:21:33,273 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:21:33" (1/1) ... [2023-12-02 19:21:33,277 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:21:33" (1/1) ... [2023-12-02 19:21:33,279 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:21:33" (1/1) ... [2023-12-02 19:21:33,281 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:21:33" (1/1) ... [2023-12-02 19:21:33,284 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 19:21:33,285 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 19:21:33,285 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 19:21:33,286 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 19:21:33,286 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:21:33" (1/1) ... [2023-12-02 19:21:33,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 19:21:33,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:21:33,326 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/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:21:33,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/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:21:33,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 19:21:33,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 19:21:33,359 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-02 19:21:33,359 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-02 19:21:33,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 19:21:33,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 19:21:33,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 19:21:33,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 19:21:33,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 19:21:33,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 19:21:33,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-12-02 19:21:33,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 19:21:33,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 19:21:33,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 19:21:33,484 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 19:21:33,486 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 19:21:33,655 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 19:21:33,704 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 19:21:33,704 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-02 19:21:33,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:21:33 BoogieIcfgContainer [2023-12-02 19:21:33,706 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 19:21:33,709 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 19:21:33,709 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 19:21:33,712 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 19:21:33,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 07:21:32" (1/3) ... [2023-12-02 19:21:33,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b2b69e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:21:33, skipping insertion in model container [2023-12-02 19:21:33,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:21:33" (2/3) ... [2023-12-02 19:21:33,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b2b69e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:21:33, skipping insertion in model container [2023-12-02 19:21:33,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:21:33" (3/3) ... [2023-12-02 19:21:33,715 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_equal.i [2023-12-02 19:21:33,734 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 19:21:33,734 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-12-02 19:21:33,796 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 19:21:33,802 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;@27a6d5a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 19:21:33,802 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-12-02 19:21:33,806 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 19 states have (on average 1.631578947368421) internal successors, (31), 25 states have internal predecessors, (31), 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:21:33,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 19:21:33,813 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:21:33,813 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:21:33,814 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-12-02 19:21:33,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:21:33,819 INFO L85 PathProgramCache]: Analyzing trace with hash -534409377, now seen corresponding path program 1 times [2023-12-02 19:21:33,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:21:33,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717145991] [2023-12-02 19:21:33,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:21:33,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:21:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:21:34,144 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:21:34,145 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:21:34,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717145991] [2023-12-02 19:21:34,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717145991] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:21:34,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:21:34,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 19:21:34,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68232739] [2023-12-02 19:21:34,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:21:34,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 19:21:34,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:21:34,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 19:21:34,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 19:21:34,184 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.631578947368421) internal successors, (31), 25 states have internal predecessors, (31), 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 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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:21:34,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:21:34,274 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2023-12-02 19:21:34,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 19:21:34,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 8 [2023-12-02 19:21:34,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:21:34,283 INFO L225 Difference]: With dead ends: 57 [2023-12-02 19:21:34,283 INFO L226 Difference]: Without dead ends: 28 [2023-12-02 19:21:34,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 19:21:34,290 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:21:34,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 68 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:21:34,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-02 19:21:34,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-12-02 19:21:34,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 23 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 19:21:34,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2023-12-02 19:21:34,329 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 8 [2023-12-02 19:21:34,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:21:34,330 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2023-12-02 19:21:34,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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:21:34,331 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2023-12-02 19:21:34,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 19:21:34,332 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:21:34,332 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2023-12-02 19:21:34,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 19:21:34,333 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-12-02 19:21:34,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:21:34,334 INFO L85 PathProgramCache]: Analyzing trace with hash -997134256, now seen corresponding path program 1 times [2023-12-02 19:21:34,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:21:34,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630251225] [2023-12-02 19:21:34,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:21:34,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:21:34,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:21:34,469 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 19:21:34,470 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:21:34,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630251225] [2023-12-02 19:21:34,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630251225] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:21:34,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:21:34,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 19:21:34,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909348333] [2023-12-02 19:21:34,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:21:34,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 19:21:34,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:21:34,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 19:21:34,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 19:21:34,475 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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:21:34,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:21:34,525 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2023-12-02 19:21:34,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 19:21:34,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2023-12-02 19:21:34,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:21:34,527 INFO L225 Difference]: With dead ends: 28 [2023-12-02 19:21:34,527 INFO L226 Difference]: Without dead ends: 27 [2023-12-02 19:21:34,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 19:21:34,530 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:21:34,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 41 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 19:21:34,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-02 19:21:34,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-12-02 19:21:34,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 22 states have internal predecessors, (24), 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:21:34,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-12-02 19:21:34,540 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 16 [2023-12-02 19:21:34,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:21:34,541 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-12-02 19:21:34,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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:21:34,541 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-12-02 19:21:34,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 19:21:34,542 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:21:34,543 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2023-12-02 19:21:34,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 19:21:34,543 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-12-02 19:21:34,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:21:34,544 INFO L85 PathProgramCache]: Analyzing trace with hash -846390816, now seen corresponding path program 1 times [2023-12-02 19:21:34,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:21:34,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994445040] [2023-12-02 19:21:34,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:21:34,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:21:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:21:34,733 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 19:21:34,734 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:21:34,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994445040] [2023-12-02 19:21:34,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994445040] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:21:34,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837213227] [2023-12-02 19:21:34,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:21:34,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:21:34,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:21:34,739 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:21:34,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 19:21:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:21:34,881 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 19:21:34,887 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:21:34,962 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 19:21:34,963 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:21:34,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837213227] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:21:34,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 19:21:34,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-12-02 19:21:34,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238530751] [2023-12-02 19:21:34,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:21:34,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 19:21:34,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:21:34,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 19:21:34,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-02 19:21:34,966 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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:21:35,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:21:35,031 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2023-12-02 19:21:35,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 19:21:35,032 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2023-12-02 19:21:35,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:21:35,034 INFO L225 Difference]: With dead ends: 27 [2023-12-02 19:21:35,034 INFO L226 Difference]: Without dead ends: 26 [2023-12-02 19:21:35,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-12-02 19:21:35,036 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:21:35,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 46 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 19:21:35,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-02 19:21:35,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2023-12-02 19:21:35,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 18 states have internal predecessors, (20), 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:21:35,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2023-12-02 19:21:35,044 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 17 [2023-12-02 19:21:35,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:21:35,044 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2023-12-02 19:21:35,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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:21:35,045 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2023-12-02 19:21:35,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 19:21:35,045 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:21:35,046 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:21:35,055 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 19:21:35,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:21:35,247 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-12-02 19:21:35,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:21:35,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1668213283, now seen corresponding path program 1 times [2023-12-02 19:21:35,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:21:35,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985851105] [2023-12-02 19:21:35,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:21:35,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:21:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:21:35,353 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:21:35,353 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:21:35,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985851105] [2023-12-02 19:21:35,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985851105] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:21:35,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642483288] [2023-12-02 19:21:35,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:21:35,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:21:35,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:21:35,355 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:21:35,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 19:21:35,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:21:35,490 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 19:21:35,494 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:21:35,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 19:21:35,524 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:21:35,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642483288] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:21:35,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 19:21:35,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2023-12-02 19:21:35,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041505319] [2023-12-02 19:21:35,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:21:35,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:21:35,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:21:35,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:21:35,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 19:21:35,527 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 19:21:35,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:21:35,550 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2023-12-02 19:21:35,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:21:35,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 17 [2023-12-02 19:21:35,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:21:35,551 INFO L225 Difference]: With dead ends: 22 [2023-12-02 19:21:35,551 INFO L226 Difference]: Without dead ends: 21 [2023-12-02 19:21:35,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 19:21:35,553 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 8 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:21:35,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 17 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 19:21:35,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-02 19:21:35,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-12-02 19:21:35,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 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:21:35,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2023-12-02 19:21:35,558 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 17 [2023-12-02 19:21:35,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:21:35,559 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2023-12-02 19:21:35,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 19:21:35,559 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2023-12-02 19:21:35,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 19:21:35,560 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:21:35,560 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:21:35,565 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 19:21:35,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:21:35,761 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-12-02 19:21:35,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:21:35,761 INFO L85 PathProgramCache]: Analyzing trace with hash 174933863, now seen corresponding path program 1 times [2023-12-02 19:21:35,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:21:35,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125028762] [2023-12-02 19:21:35,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:21:35,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:21:35,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:21:35,872 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:21:35,872 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:21:35,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125028762] [2023-12-02 19:21:35,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125028762] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:21:35,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370055228] [2023-12-02 19:21:35,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:21:35,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:21:35,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:21:35,875 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:21:35,877 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 19:21:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:21:36,018 INFO L262 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 19:21:36,020 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:21:36,056 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:21:36,057 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:21:36,099 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:21:36,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370055228] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:21:36,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1253943487] [2023-12-02 19:21:36,123 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2023-12-02 19:21:36,123 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:21:36,128 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:21:36,134 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:21:36,135 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:21:37,966 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 120 for LOIs [2023-12-02 19:21:38,229 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:21:45,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1253943487] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:21:45,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:21:45,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [5, 5, 5] total 19 [2023-12-02 19:21:45,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441568868] [2023-12-02 19:21:45,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:21:45,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 19:21:45,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:21:45,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 19:21:45,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=296, Unknown=1, NotChecked=0, Total=342 [2023-12-02 19:21:45,133 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 19:21:46,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:21:55,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:21:55,606 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2023-12-02 19:21:55,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 19:21:55,607 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2023-12-02 19:21:55,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:21:55,608 INFO L225 Difference]: With dead ends: 30 [2023-12-02 19:21:55,608 INFO L226 Difference]: Without dead ends: 25 [2023-12-02 19:21:55,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=49, Invalid=329, Unknown=2, NotChecked=0, Total=380 [2023-12-02 19:21:55,609 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-12-02 19:21:55,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 28 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 191 Invalid, 1 Unknown, 0 Unchecked, 2.9s Time] [2023-12-02 19:21:55,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-02 19:21:55,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-12-02 19:21:55,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 19:21:55,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2023-12-02 19:21:55,615 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 18 [2023-12-02 19:21:55,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:21:55,615 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2023-12-02 19:21:55,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 19:21:55,616 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2023-12-02 19:21:55,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 19:21:55,616 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:21:55,616 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:21:55,621 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 19:21:55,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:21:55,817 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-12-02 19:21:55,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:21:55,818 INFO L85 PathProgramCache]: Analyzing trace with hash -96416608, now seen corresponding path program 1 times [2023-12-02 19:21:55,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:21:55,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233172680] [2023-12-02 19:21:55,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:21:55,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:21:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:21:55,916 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 19:21:55,917 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:21:55,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233172680] [2023-12-02 19:21:55,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233172680] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:21:55,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753709000] [2023-12-02 19:21:55,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:21:55,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:21:55,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:21:55,919 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:21:55,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 19:21:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:21:56,041 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 19:21:56,043 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:21:56,072 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 19:21:56,072 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:21:56,102 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 19:21:56,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753709000] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:21:56,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [777949726] [2023-12-02 19:21:56,105 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-12-02 19:21:56,106 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:21:56,106 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:21:56,106 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:21:56,106 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:21:57,674 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 137 for LOIs [2023-12-02 19:21:57,882 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:22:07,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [777949726] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:22:07,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:22:07,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [5, 5, 5] total 20 [2023-12-02 19:22:07,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515654839] [2023-12-02 19:22:07,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:22:07,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-02 19:22:07,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:22:07,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-02 19:22:07,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=333, Unknown=3, NotChecked=0, Total=380 [2023-12-02 19:22:07,233 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 19:22:09,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:22:11,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:22:36,554 WARN L293 SmtUtils]: Spent 18.59s on a formula simplification. DAG size of input: 205 DAG size of output: 202 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 19:22:41,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:22:41,405 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2023-12-02 19:22:41,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 19:22:41,406 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2023-12-02 19:22:41,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:22:41,406 INFO L225 Difference]: With dead ends: 25 [2023-12-02 19:22:41,406 INFO L226 Difference]: Without dead ends: 21 [2023-12-02 19:22:41,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 32.9s TimeCoverageRelationStatistics Valid=48, Invalid=368, Unknown=4, NotChecked=0, Total=420 [2023-12-02 19:22:41,407 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 4 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 2 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2023-12-02 19:22:41,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 250 Invalid, 4 Unknown, 0 Unchecked, 10.6s Time] [2023-12-02 19:22:41,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-02 19:22:41,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-12-02 19:22:41,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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:22:41,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2023-12-02 19:22:41,415 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 22 [2023-12-02 19:22:41,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:22:41,416 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2023-12-02 19:22:41,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 19:22:41,416 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2023-12-02 19:22:41,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 19:22:41,417 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:22:41,417 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:22:41,421 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 19:22:41,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:22:41,618 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-12-02 19:22:41,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:22:41,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1306052524, now seen corresponding path program 1 times [2023-12-02 19:22:41,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:22:41,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704908923] [2023-12-02 19:22:41,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:22:41,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:22:41,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:22:41,709 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 19:22:41,710 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:22:41,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704908923] [2023-12-02 19:22:41,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704908923] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:22:41,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722441373] [2023-12-02 19:22:41,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:22:41,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:22:41,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:22:41,714 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:22:41,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 19:22:41,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:22:41,833 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 19:22:41,834 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:22:41,855 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 19:22:41,855 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:22:41,878 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 19:22:41,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722441373] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:22:41,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1761588919] [2023-12-02 19:22:41,881 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-12-02 19:22:41,882 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:22:41,882 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:22:41,882 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:22:41,882 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:22:43,185 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 137 for LOIs [2023-12-02 19:22:43,348 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:22:51,898 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '988#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= 1 |#StackHeapBarrier|) (<= 2147483647 |ULTIMATE.start_main_#t~post13#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|))' at error location [2023-12-02 19:22:51,898 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 19:22:51,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:22:51,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2023-12-02 19:22:51,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236846167] [2023-12-02 19:22:51,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:22:51,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 19:22:51,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:22:51,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 19:22:51,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=371, Unknown=2, NotChecked=0, Total=420 [2023-12-02 19:22:51,900 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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:22:51,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:22:51,990 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2023-12-02 19:22:51,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 19:22:51,991 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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 23 [2023-12-02 19:22:51,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:22:51,992 INFO L225 Difference]: With dead ends: 40 [2023-12-02 19:22:51,992 INFO L226 Difference]: Without dead ends: 26 [2023-12-02 19:22:51,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=54, Invalid=406, Unknown=2, NotChecked=0, Total=462 [2023-12-02 19:22:51,993 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 5 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:22:51,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 50 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 19:22:51,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-02 19:22:52,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-02 19:22:52,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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:22:52,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2023-12-02 19:22:52,004 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 23 [2023-12-02 19:22:52,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:22:52,004 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2023-12-02 19:22:52,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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:22:52,005 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2023-12-02 19:22:52,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 19:22:52,006 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:22:52,006 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:22:52,011 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 19:22:52,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:22:52,207 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-12-02 19:22:52,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:22:52,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1282193765, now seen corresponding path program 2 times [2023-12-02 19:22:52,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:22:52,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289860668] [2023-12-02 19:22:52,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:22:52,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:22:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:22:52,329 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 19:22:52,330 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:22:52,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289860668] [2023-12-02 19:22:52,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289860668] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:22:52,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629980545] [2023-12-02 19:22:52,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 19:22:52,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:22:52,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:22:52,331 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:22:52,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 19:22:52,489 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 19:22:52,489 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:22:52,492 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 19:22:52,494 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:22:52,527 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 19:22:52,527 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:22:52,586 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 19:22:52,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629980545] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:22:52,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [614006173] [2023-12-02 19:22:52,589 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-12-02 19:22:52,589 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:22:52,590 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:22:52,590 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:22:52,590 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:22:53,959 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 120 for LOIs [2023-12-02 19:22:54,131 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:22:58,725 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1284#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= 1 |#StackHeapBarrier|) (<= 2147483647 |ULTIMATE.start_main_#t~post13#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|))' at error location [2023-12-02 19:22:58,725 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 19:22:58,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:22:58,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-12-02 19:22:58,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122210959] [2023-12-02 19:22:58,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:22:58,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 19:22:58,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:22:58,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 19:22:58,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=528, Unknown=1, NotChecked=0, Total=600 [2023-12-02 19:22:58,727 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 12 states have internal predecessors, (31), 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 19:22:58,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:22:58,906 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2023-12-02 19:22:58,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 19:22:58,907 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 12 states have internal predecessors, (31), 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 31 [2023-12-02 19:22:58,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:22:58,908 INFO L225 Difference]: With dead ends: 39 [2023-12-02 19:22:58,908 INFO L226 Difference]: Without dead ends: 38 [2023-12-02 19:22:58,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=107, Invalid=702, Unknown=3, NotChecked=0, Total=812 [2023-12-02 19:22:58,909 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 14 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:22:58,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 51 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 19:22:58,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-02 19:22:58,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-12-02 19:22:58,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 19:22:58,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2023-12-02 19:22:58,927 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 31 [2023-12-02 19:22:58,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:22:58,928 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2023-12-02 19:22:58,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 12 states have internal predecessors, (31), 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 19:22:58,928 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2023-12-02 19:22:58,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-02 19:22:58,929 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:22:58,929 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-12-02 19:22:58,934 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 19:22:59,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:22:59,130 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-12-02 19:22:59,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:22:59,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1154480336, now seen corresponding path program 3 times [2023-12-02 19:22:59,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:22:59,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672164559] [2023-12-02 19:22:59,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:22:59,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:22:59,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:22:59,385 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 19:22:59,385 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:22:59,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672164559] [2023-12-02 19:22:59,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672164559] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:22:59,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382430182] [2023-12-02 19:22:59,386 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 19:22:59,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:22:59,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:22:59,387 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:22:59,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 19:22:59,625 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 19:22:59,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:22:59,628 INFO L262 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-02 19:22:59,632 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:22:59,682 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 19:22:59,683 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:22:59,808 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 19:22:59,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382430182] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:22:59,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1328758609] [2023-12-02 19:22:59,810 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-12-02 19:22:59,810 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:22:59,811 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:22:59,811 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:22:59,811 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:23:00,947 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 137 for LOIs [2023-12-02 19:23:01,116 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:23:12,986 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1682#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= 1 |#StackHeapBarrier|) (<= 2147483647 |ULTIMATE.start_main_#t~post13#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|))' at error location [2023-12-02 19:23:12,987 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 19:23:12,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:23:12,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2023-12-02 19:23:12,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354030204] [2023-12-02 19:23:12,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:23:12,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-02 19:23:12,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:23:12,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-02 19:23:12,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1216, Unknown=4, NotChecked=0, Total=1406 [2023-12-02 19:23:12,989 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 24 states, 23 states have (on average 2.391304347826087) internal successors, (55), 24 states have internal predecessors, (55), 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 19:23:13,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:23:13,500 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2023-12-02 19:23:13,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-02 19:23:13,500 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.391304347826087) internal successors, (55), 24 states have internal predecessors, (55), 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 43 [2023-12-02 19:23:13,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:23:13,501 INFO L225 Difference]: With dead ends: 63 [2023-12-02 19:23:13,501 INFO L226 Difference]: Without dead ends: 62 [2023-12-02 19:23:13,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=363, Invalid=1887, Unknown=6, NotChecked=0, Total=2256 [2023-12-02 19:23:13,503 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 58 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:23:13,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 49 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:23:13,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-02 19:23:13,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-12-02 19:23:13,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 states have internal predecessors, (59), 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:23:13,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2023-12-02 19:23:13,521 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 43 [2023-12-02 19:23:13,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:23:13,522 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2023-12-02 19:23:13,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.391304347826087) internal successors, (55), 24 states have internal predecessors, (55), 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 19:23:13,522 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2023-12-02 19:23:13,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-02 19:23:13,523 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:23:13,523 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-12-02 19:23:13,528 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 19:23:13,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:23:13,723 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-12-02 19:23:13,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:23:13,724 INFO L85 PathProgramCache]: Analyzing trace with hash -394746182, now seen corresponding path program 4 times [2023-12-02 19:23:13,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:23:13,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873229819] [2023-12-02 19:23:13,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:23:13,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:23:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:23:14,313 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 19:23:14,314 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:23:14,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873229819] [2023-12-02 19:23:14,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873229819] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:23:14,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021462717] [2023-12-02 19:23:14,314 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 19:23:14,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:23:14,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:23:14,316 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:23:14,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 19:23:14,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:23:14,474 INFO L262 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-02 19:23:14,477 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:23:14,545 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 19:23:14,545 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:23:15,003 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 19:23:15,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021462717] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:23:15,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1293666774] [2023-12-02 19:23:15,005 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-12-02 19:23:15,005 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:23:15,005 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:23:15,005 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:23:15,006 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:23:16,262 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 137 for LOIs [2023-12-02 19:23:16,418 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:23:24,915 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2321#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= 1 |#StackHeapBarrier|) (<= 2147483647 |ULTIMATE.start_main_#t~post13#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|))' at error location [2023-12-02 19:23:24,915 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 19:23:24,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:23:24,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 47 [2023-12-02 19:23:24,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228003662] [2023-12-02 19:23:24,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:23:24,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-02 19:23:24,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:23:24,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-02 19:23:24,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=3151, Unknown=1, NotChecked=0, Total=3782 [2023-12-02 19:23:24,920 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand has 48 states, 47 states have (on average 2.1914893617021276) internal successors, (103), 48 states have internal predecessors, (103), 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 19:23:26,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:23:26,224 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2023-12-02 19:23:26,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-12-02 19:23:26,224 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.1914893617021276) internal successors, (103), 48 states have internal predecessors, (103), 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 67 [2023-12-02 19:23:26,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:23:26,226 INFO L225 Difference]: With dead ends: 111 [2023-12-02 19:23:26,226 INFO L226 Difference]: Without dead ends: 110 [2023-12-02 19:23:26,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2032 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=1413, Invalid=5555, Unknown=4, NotChecked=0, Total=6972 [2023-12-02 19:23:26,229 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 124 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:23:26,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 114 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 19:23:26,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-12-02 19:23:26,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2023-12-02 19:23:26,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 105 states have (on average 1.019047619047619) internal successors, (107), 105 states have internal predecessors, (107), 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:23:26,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 113 transitions. [2023-12-02 19:23:26,264 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 113 transitions. Word has length 67 [2023-12-02 19:23:26,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:23:26,265 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 113 transitions. [2023-12-02 19:23:26,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.1914893617021276) internal successors, (103), 48 states have internal predecessors, (103), 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 19:23:26,265 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2023-12-02 19:23:26,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-02 19:23:26,266 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:23:26,266 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 22, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-12-02 19:23:26,271 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 19:23:26,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-02 19:23:26,467 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-12-02 19:23:26,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:23:26,467 INFO L85 PathProgramCache]: Analyzing trace with hash -791533426, now seen corresponding path program 5 times [2023-12-02 19:23:26,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:23:26,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210354632] [2023-12-02 19:23:26,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:23:26,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:23:26,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:23:27,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1028 backedges. 0 proven. 1012 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 19:23:27,976 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:23:27,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210354632] [2023-12-02 19:23:27,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210354632] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:23:27,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125572389] [2023-12-02 19:23:27,976 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 19:23:27,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:23:27,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:23:27,977 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:23:27,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 19:23:29,328 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2023-12-02 19:23:29,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:23:29,336 INFO L262 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 147 conjunts are in the unsatisfiable core [2023-12-02 19:23:29,344 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:23:29,417 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:23:29,587 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:23:29,593 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:23:29,711 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:23:29,715 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:23:29,719 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:23:29,935 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 19:23:29,935 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:23:29,948 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:23:29,957 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:23:30,047 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 27 treesize of output 15 [2023-12-02 19:23:30,057 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 22 [2023-12-02 19:23:30,388 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2023-12-02 19:23:30,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 48 [2023-12-02 19:23:30,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:23:30,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:23:30,401 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:23:30,410 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:23:30,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:23:30,605 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2023-12-02 19:23:30,606 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 110 treesize of output 85 [2023-12-02 19:23:30,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:23:30,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:23:30,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:23:30,654 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2023-12-02 19:23:30,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 63 [2023-12-02 19:23:30,709 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-02 19:23:30,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-12-02 19:23:30,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:23:30,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:23:30,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:23:30,904 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 77 treesize of output 54 [2023-12-02 19:23:30,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:23:30,959 INFO L349 Elim1Store]: treesize reduction 148, result has 9.2 percent of original size [2023-12-02 19:23:30,959 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 163 treesize of output 79 [2023-12-02 19:23:32,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1028 backedges. 260 proven. 26 refuted. 0 times theorem prover too weak. 742 trivial. 0 not checked. [2023-12-02 19:23:32,256 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:23:33,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125572389] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:23:33,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1589219456] [2023-12-02 19:23:33,598 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-12-02 19:23:33,598 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:23:33,599 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:23:33,599 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:23:33,599 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:23:34,759 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 120 for LOIs [2023-12-02 19:23:34,942 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:23:43,488 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3360#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= 1 |#StackHeapBarrier|) (<= 2147483647 |ULTIMATE.start_main_#t~post13#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|))' at error location [2023-12-02 19:23:43,488 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 19:23:43,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 19:23:43,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 23] total 69 [2023-12-02 19:23:43,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546599124] [2023-12-02 19:23:43,489 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 19:23:43,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2023-12-02 19:23:43,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:23:43,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2023-12-02 19:23:43,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=706, Invalid=7124, Unknown=2, NotChecked=0, Total=7832 [2023-12-02 19:23:43,493 INFO L87 Difference]: Start difference. First operand 110 states and 113 transitions. Second operand has 69 states, 65 states have (on average 2.0923076923076924) internal successors, (136), 65 states have internal predecessors, (136), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-02 19:23:47,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:23:47,948 INFO L93 Difference]: Finished difference Result 216 states and 224 transitions. [2023-12-02 19:23:47,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2023-12-02 19:23:47,948 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 65 states have (on average 2.0923076923076924) internal successors, (136), 65 states have internal predecessors, (136), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 115 [2023-12-02 19:23:47,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:23:47,950 INFO L225 Difference]: With dead ends: 216 [2023-12-02 19:23:47,950 INFO L226 Difference]: Without dead ends: 121 [2023-12-02 19:23:47,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 281 SyntacticMatches, 2 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3692 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=1974, Invalid=13274, Unknown=4, NotChecked=0, Total=15252 [2023-12-02 19:23:47,956 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 153 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:23:47,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 304 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-02 19:23:47,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-12-02 19:23:47,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2023-12-02 19:23:47,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 113 states have (on average 1.0176991150442478) internal successors, (115), 113 states have internal predecessors, (115), 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 19:23:47,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2023-12-02 19:23:47,997 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 115 [2023-12-02 19:23:47,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:23:47,997 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2023-12-02 19:23:47,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 65 states have (on average 2.0923076923076924) internal successors, (136), 65 states have internal predecessors, (136), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-02 19:23:47,997 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2023-12-02 19:23:48,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-02 19:23:48,000 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:23:48,000 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 23, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2023-12-02 19:23:48,008 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 19:23:48,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-02 19:23:48,201 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-12-02 19:23:48,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:23:48,201 INFO L85 PathProgramCache]: Analyzing trace with hash 952813796, now seen corresponding path program 6 times [2023-12-02 19:23:48,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:23:48,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048510464] [2023-12-02 19:23:48,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:23:48,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:23:48,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:23:48,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 1122 trivial. 0 not checked. [2023-12-02 19:23:48,445 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:23:48,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048510464] [2023-12-02 19:23:48,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048510464] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:23:48,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009581009] [2023-12-02 19:23:48,446 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 19:23:48,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:23:48,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:23:48,447 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:23:48,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-02 19:23:49,700 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 19:23:49,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:23:49,706 INFO L262 TraceCheckSpWp]: Trace formula consists of 849 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 19:23:49,710 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:23:49,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 1110 trivial. 0 not checked. [2023-12-02 19:23:49,747 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:23:49,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009581009] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:23:49,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 19:23:49,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2023-12-02 19:23:49,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036734033] [2023-12-02 19:23:49,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:23:49,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 19:23:49,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:23:49,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 19:23:49,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-02 19:23:49,749 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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:23:49,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:23:49,805 INFO L93 Difference]: Finished difference Result 122 states and 125 transitions. [2023-12-02 19:23:49,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 19:23:49,806 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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 127 [2023-12-02 19:23:49,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:23:49,806 INFO L225 Difference]: With dead ends: 122 [2023-12-02 19:23:49,807 INFO L226 Difference]: Without dead ends: 0 [2023-12-02 19:23:49,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-12-02 19:23:49,808 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 4 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:23:49,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 21 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 19:23:49,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-02 19:23:49,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-02 19:23:49,809 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 19:23:49,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-02 19:23:49,810 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 127 [2023-12-02 19:23:49,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:23:49,810 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-02 19:23:49,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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:23:49,810 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-02 19:23:49,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-02 19:23:49,813 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2023-12-02 19:23:49,814 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2023-12-02 19:23:49,814 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2023-12-02 19:23:49,814 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2023-12-02 19:23:49,814 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2023-12-02 19:23:49,814 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2023-12-02 19:23:49,823 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-02 19:23:50,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-02 19:23:50,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-02 19:24:19,379 WARN L293 SmtUtils]: Spent 29.10s on a formula simplification. DAG size of input: 341 DAG size of output: 334 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-02 19:24:44,435 WARN L293 SmtUtils]: Spent 24.70s on a formula simplification. DAG size of input: 318 DAG size of output: 239 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-02 19:24:44,733 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 617) no Hoare annotation was computed. [2023-12-02 19:24:44,733 INFO L902 garLoopResultBuilder]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2023-12-02 19:24:44,733 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 604 626) no Hoare annotation was computed. [2023-12-02 19:24:44,733 INFO L899 garLoopResultBuilder]: For program point L585-3(line 585) no Hoare annotation was computed. [2023-12-02 19:24:44,733 INFO L899 garLoopResultBuilder]: For program point L585-4(line 585) no Hoare annotation was computed. [2023-12-02 19:24:44,734 INFO L895 garLoopResultBuilder]: At program point L585-5(lines 585 589) the Hoare annotation is: (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse10 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)) (.cse1 (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse11 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (.cse12 (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse2 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse3 (= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse4 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse5 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse13 (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0)) (.cse6 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse7 (= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse9 (= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse14 (<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|)) (.cse15 (exists ((|v_#memory_$Pointer$.offset_67| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_67| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_67| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 0)))))) (or (let ((.cse8 (select |#memory_int| 1))) (and (= 2 |ULTIMATE.start_sll_create_~len#1|) .cse0 .cse1 (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) .cse2 (exists ((|v_#length_22| (Array Int Int))) (and (= |#length| (store |v_#length_22| |ULTIMATE.start_main_~#s~0#1.base| 4)) (= (select |v_#length_22| 1) 2) (= 22 (select |v_#length_22| 2)))) .cse3 .cse4 (exists ((|v_#valid_45| (Array Int Int))) (and (= |#valid| (store |v_#valid_45| |ULTIMATE.start_main_~#s~0#1.base| 1)) (= (select |v_#valid_45| |ULTIMATE.start_main_~#s~0#1.base|) 0) (= (select |v_#valid_45| 1) 1) (= (select |v_#valid_45| 2) 1) (= (select |v_#valid_45| 0) 0))) .cse5 .cse6 .cse7 (= (select .cse8 0) 48) .cse9 (= (select .cse8 1) 0))) (and .cse0 .cse10 (= (select |#valid| .cse11) 1) (<= (+ .cse11 1) |#StackHeapBarrier|) .cse1 .cse12 .cse2 (= (select (select |#memory_$Pointer$.base| .cse11) 4) 0) .cse3 .cse4 (= |ULTIMATE.start_sll_create_~len#1| 0) .cse5 .cse13 .cse6 .cse7 .cse9 (= (select (select |#memory_$Pointer$.offset| .cse11) 4) 0) .cse14 .cse15 (not (= .cse11 |ULTIMATE.start_sll_create_~head~0#1.base|))) (and .cse0 .cse10 .cse1 (= .cse11 0) .cse12 .cse2 (= |ULTIMATE.start_sll_create_~len#1| 1) .cse3 .cse4 .cse5 .cse13 .cse6 .cse7 .cse9 .cse14 .cse15))) [2023-12-02 19:24:44,734 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 585) no Hoare annotation was computed. [2023-12-02 19:24:44,734 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 619) no Hoare annotation was computed. [2023-12-02 19:24:44,734 INFO L899 garLoopResultBuilder]: For program point L619(line 619) no Hoare annotation was computed. [2023-12-02 19:24:44,734 INFO L895 garLoopResultBuilder]: At program point L586(line 586) the Hoare annotation is: (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse1 (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse2 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse3 (= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.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)) (.cse9 (= |ULTIMATE.start_sll_create_#in~data#1| 1))) (or (let ((.cse8 (select |#memory_int| 1))) (and (= 2 |ULTIMATE.start_sll_create_~len#1|) .cse0 .cse1 (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) .cse2 (exists ((|v_#length_22| (Array Int Int))) (and (= |#length| (store |v_#length_22| |ULTIMATE.start_main_~#s~0#1.base| 4)) (= (select |v_#length_22| 1) 2) (= 22 (select |v_#length_22| 2)))) .cse3 .cse4 (exists ((|v_#valid_45| (Array Int Int))) (and (= |#valid| (store |v_#valid_45| |ULTIMATE.start_main_~#s~0#1.base| 1)) (= (select |v_#valid_45| |ULTIMATE.start_main_~#s~0#1.base|) 0) (= (select |v_#valid_45| 1) 1) (= (select |v_#valid_45| 2) 1) (= (select |v_#valid_45| 0) 0))) .cse5 .cse6 .cse7 (= (select .cse8 0) 48) .cse9 (= (select .cse8 1) 0))) (and .cse0 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) .cse1 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2 (= |ULTIMATE.start_sll_create_~len#1| 1) .cse3 .cse4 .cse5 (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) .cse6 .cse7 .cse9 (<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_67| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_67| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_67| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 0))))))) [2023-12-02 19:24:44,735 INFO L899 garLoopResultBuilder]: For program point L619-1(lines 619 621) no Hoare annotation was computed. [2023-12-02 19:24:44,735 INFO L899 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2023-12-02 19:24:44,735 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 585) no Hoare annotation was computed. [2023-12-02 19:24:44,736 INFO L895 garLoopResultBuilder]: At program point L611-2(lines 611 618) the Hoare annotation is: (let ((.cse1 (<= 1 |#StackHeapBarrier|)) (.cse18 (= |ULTIMATE.start_main_~count~0#1| 0)) (.cse19 (= |ULTIMATE.start_sll_create_#res#1.offset| 0)) (.cse20 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse21 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse25 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse27 (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse33 (and .cse1 .cse18 .cse19 .cse20 .cse21 .cse25 .cse27)) (.cse0 (exists ((|v_ULTIMATE.start_sll_prepend_#in~head#1.base_14| Int) (|v_#memory_int_96| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_prepend_~head#1.base_16| Int) (|v_#memory_$Pointer$.offset_68| (Array Int (Array Int Int))) (|v_#memory_int_25| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_68| (Array Int (Array Int Int)))) (let ((.cse39 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0))) (let ((.cse50 (select |v_#memory_$Pointer$.offset_68| .cse39)) (.cse51 (select |v_#memory_$Pointer$.base_68| .cse39))) (and (= |#memory_int| (store |v_#memory_int_25| |v_ULTIMATE.start_sll_prepend_~head#1.base_16| (store (select |v_#memory_int_25| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0)))) (= |v_#memory_int_25| (store |v_#memory_int_96| .cse39 (store (select |v_#memory_int_96| .cse39) 4 (select (select |v_#memory_int_25| .cse39) 4)))) (let ((.cse40 (exists ((|v_#valid_46| (Array Int Int))) (and (= (store |v_#valid_46| .cse39 1) |#valid|) (= (select |v_#valid_46| .cse39) 0)))) (.cse41 (exists ((|v_#memory_int_37| (Array Int (Array Int Int))) (|v_#memory_int_92| (Array Int (Array Int Int)))) (let ((.cse52 (select |v_#memory_int_37| .cse39))) (and (= (store |v_#memory_int_37| .cse39 (store .cse52 0 1)) |v_#memory_int_96|) (= |v_#memory_int_37| (store |v_#memory_int_92| .cse39 (store (select |v_#memory_int_92| .cse39) 4 (select .cse52 4)))))))) (.cse42 (<= (+ .cse39 1) |#StackHeapBarrier|)) (.cse43 (not (= .cse39 0))) (.cse44 (= |v_ULTIMATE.start_sll_prepend_~head#1.base_16| |v_ULTIMATE.start_sll_prepend_#in~head#1.base_14|)) (.cse45 (exists ((|v_#memory_$Pointer$.base_64| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_64| .cse39 (store (store (select |v_#memory_$Pointer$.base_64| .cse39) 4 0) 0 (select .cse51 0))) |v_#memory_$Pointer$.base_68|))) (.cse46 (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))) (.cse47 (= |v_ULTIMATE.start_sll_prepend_#in~head#1.base_14| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse48 (exists ((|v_#memory_$Pointer$.offset_64| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_64| .cse39 (store (store (select |v_#memory_$Pointer$.offset_64| .cse39) 4 0) 0 (select .cse50 0))) |v_#memory_$Pointer$.offset_68|))) (.cse49 (exists ((|v_#length_34| (Array Int Int))) (= (store |v_#length_34| .cse39 8) |#length|)))) (or (and .cse40 (exists ((|v_#memory_int_95| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_24| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_24| (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_24| |ULTIMATE.start_sll_create_#res#1.base|) 4))))) .cse41 .cse42 .cse43 .cse44 (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_24| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_67| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_24| (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_24| |ULTIMATE.start_sll_create_#res#1.base|) 4)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_24| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|))) .cse45 .cse46 .cse47 .cse48 .cse49) (and .cse40 (exists ((|v_#memory_int_95| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_23| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_23| (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_23| |ULTIMATE.start_sll_create_#res#1.base|) 4))))) .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_23| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_67| (Array Int (Array Int Int)))) (and (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_23| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_23| (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_23| |ULTIMATE.start_sll_create_#res#1.base|) 4))))))))) (= |#memory_$Pointer$.offset| (let ((.cse53 (store |v_#memory_$Pointer$.offset_68| .cse39 (store .cse50 4 (select (select |v_#memory_$Pointer$.offset_68| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0))))) (store .cse53 |v_ULTIMATE.start_sll_prepend_~head#1.base_16| (store (select .cse53 |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0 0)))) (= |#memory_$Pointer$.base| (let ((.cse54 (store |v_#memory_$Pointer$.base_68| .cse39 (store .cse51 4 (select (select |v_#memory_$Pointer$.base_68| |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0))))) (store .cse54 |v_ULTIMATE.start_sll_prepend_~head#1.base_16| (store (select .cse54 |v_ULTIMATE.start_sll_prepend_~head#1.base_16|) 0 .cse39))))))))) (.cse26 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|))) (let ((.cse31 (and .cse0 .cse26)) (.cse34 (< 0 |ULTIMATE.start_main_~count~0#1|)) (.cse35 (or .cse33 (and .cse1 (<= 1 |ULTIMATE.start_main_~count~0#1|) .cse19 .cse20 .cse21 .cse25 .cse27))) (.cse17 (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (or (and .cse0 .cse1 (exists ((|v_#memory_int_74| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_52| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_52| (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_25| (Array Int (Array Int Int)))) (let ((.cse11 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0))) (let ((.cse13 (select |v_#memory_$Pointer$.base_52| .cse11)) (.cse12 (select |v_#memory_$Pointer$.offset_52| .cse11))) (and (let ((.cse2 (exists ((|v_#valid_35| (Array Int Int))) (and (= (select |v_#valid_35| .cse11) 0) (= |#valid| (store |v_#valid_35| .cse11 1))))) (.cse3 (exists ((|v_#length_23| (Array Int Int))) (= |#length| (store |v_#length_23| .cse11 8)))) (.cse4 (exists ((|v_#memory_int_37| (Array Int (Array Int Int))) (|v_#memory_int_70| (Array Int (Array Int Int)))) (let ((.cse14 (select |v_#memory_int_37| .cse11))) (and (= (store |v_#memory_int_37| .cse11 (store .cse14 0 1)) |v_#memory_int_74|) (= |v_#memory_int_37| (store |v_#memory_int_70| .cse11 (store (select |v_#memory_int_70| .cse11) 4 (select .cse14 4)))))))) (.cse5 (not (= 0 .cse11))) (.cse6 (= |v_ULTIMATE.start_sll_prepend_~head#1.base_14| |v_ULTIMATE.start_sll_prepend_#in~head#1.base_11|)) (.cse7 (exists ((|v_#memory_$Pointer$.base_48| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_48| .cse11 (store (store (select |v_#memory_$Pointer$.base_48| .cse11) 4 0) 0 (select .cse13 0))) |v_#memory_$Pointer$.base_52|))) (.cse8 (exists ((|v_#memory_$Pointer$.offset_48| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_48| .cse11 (store (store (select |v_#memory_$Pointer$.offset_48| .cse11) 4 0) 0 (select .cse12 0))) |v_#memory_$Pointer$.offset_52|))) (.cse9 (= |v_ULTIMATE.start_sll_prepend_#in~head#1.base_11| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse10 (<= (+ 1 .cse11) |#StackHeapBarrier|))) (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_15| (Array Int (Array Int Int)))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_15| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_13| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_13| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|)) .cse9 .cse10) (and (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_17| (Array Int (Array Int Int)))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_17| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) .cse2 .cse3 (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_14| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_14| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (= (let ((.cse15 (store |v_#memory_$Pointer$.base_52| .cse11 (store .cse13 4 (select (select |v_#memory_$Pointer$.base_52| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0))))) (store .cse15 |v_ULTIMATE.start_sll_prepend_~head#1.base_14| (store (select .cse15 |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0 .cse11))) |#memory_$Pointer$.base|) (= |#memory_int| (store |v_#memory_int_25| |v_ULTIMATE.start_sll_prepend_~head#1.base_14| (store (select |v_#memory_int_25| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)))) (= (store |v_#memory_int_74| .cse11 (store (select |v_#memory_int_74| .cse11) 4 (select (select |v_#memory_int_25| .cse11) 4))) |v_#memory_int_25|) (= |#memory_$Pointer$.offset| (let ((.cse16 (store |v_#memory_$Pointer$.offset_52| .cse11 (store .cse12 4 (select (select |v_#memory_$Pointer$.offset_52| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0))))) (store .cse16 |v_ULTIMATE.start_sll_prepend_~head#1.base_14| (store (select .cse16 |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0 0)))))))) .cse17 .cse18 .cse19 .cse20 .cse21 (exists ((|ULTIMATE.start_main_~#s~0#1.offset| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse22 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse24 (select (select |#memory_$Pointer$.base| .cse22) 4))) (let ((.cse23 (select (select |#memory_$Pointer$.base| .cse24) 4))) (and (<= (+ 2 .cse22) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.base| .cse23) 4) 0) (<= (+ 2 .cse23) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse23) 4) 0) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse22) (not (= .cse23 .cse22)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| .cse24) 4) 0) (not (= .cse24 .cse23)) (<= (+ 2 .cse24) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse22) 4) 0)))))) .cse25 .cse26 .cse27) (let ((.cse32 (= |ULTIMATE.start_main_~count~0#1| 1))) (and .cse17 (exists ((|ULTIMATE.start_main_~#s~0#1.offset| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse28 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse30 (select (select |#memory_$Pointer$.base| .cse28) 4))) (let ((.cse29 (select (select |#memory_$Pointer$.base| .cse30) 4))) (and (<= (+ 2 .cse28) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.base| .cse29) 4) 0) (<= (+ 2 .cse29) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse30) (= (select (select |#memory_$Pointer$.offset| .cse29) 4) 0) (not (= .cse29 .cse28)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| .cse30) 4) 0) (not (= .cse30 .cse29)) (<= (+ 2 .cse30) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse28) 4) 0)))))) (or .cse31 .cse32) (or .cse33 (and .cse1 .cse32 .cse19 .cse20 .cse21 .cse25 .cse27)))) (and (<= |ULTIMATE.start_main_~count~0#1| 2) (or .cse31 .cse34) .cse35 (exists ((|ULTIMATE.start_main_~#s~0#1.offset| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse37 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse38 (select (select |#memory_$Pointer$.base| .cse37) 4))) (let ((.cse36 (select (select |#memory_$Pointer$.base| .cse38) 4))) (and (= |ULTIMATE.start_main_~ptr~0#1.base| .cse36) (<= (+ 2 .cse37) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.base| .cse36) 4) 0) (<= (+ 2 .cse36) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse36) 4) 0) (not (= .cse36 .cse37)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| .cse38) 4) 0) (not (= .cse38 .cse36)) (<= (+ 2 .cse38) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse37) 4) 0)))))) .cse17) (and (<= |ULTIMATE.start_main_~count~0#1| 3) .cse34 .cse35 .cse17 (= |ULTIMATE.start_main_~ptr~0#1.base| 0)))))) [2023-12-02 19:24:44,736 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-02 19:24:44,736 INFO L899 garLoopResultBuilder]: For program point L611-3(lines 611 618) no Hoare annotation was computed. [2023-12-02 19:24:44,736 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 619) no Hoare annotation was computed. [2023-12-02 19:24:44,737 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-02 19:24:44,737 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 617) no Hoare annotation was computed. [2023-12-02 19:24:44,737 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 (<= 1 |#StackHeapBarrier|) (not (= .cse0 .cse1)) (= |ULTIMATE.start_sll_prepend_~data#1| 1) (= (select (select |#memory_$Pointer$.base| .cse1) 4) 0) (= (select |#valid| .cse0) 1) (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_prepend_#in~head#1.base|) (= |ULTIMATE.start_sll_prepend_~head#1.base| |ULTIMATE.start_sll_prepend_#in~head#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse1) 4) 0) (<= (+ .cse0 1) |#StackHeapBarrier|) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#memory_$Pointer$.offset_67| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (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.offset| 0) (= (select |#valid| .cse1) 1) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_prepend_#in~data#1| 1) (= |ULTIMATE.start_sll_prepend_#in~head#1.offset| 0) (= |ULTIMATE.start_sll_prepend_~head#1.offset| 0) (<= (+ .cse1 1) |#StackHeapBarrier|) (= .cse0 |ULTIMATE.start_sll_create_#res#1.base|)))) [2023-12-02 19:24:44,737 INFO L899 garLoopResultBuilder]: For program point L600-1(line 600) no Hoare annotation was computed. [2023-12-02 19:24:44,737 INFO L899 garLoopResultBuilder]: For program point main_ERROR#1(lines 604 626) no Hoare annotation was computed. [2023-12-02 19:24:44,737 INFO L899 garLoopResultBuilder]: For program point L617(line 617) no Hoare annotation was computed. [2023-12-02 19:24:44,737 INFO L899 garLoopResultBuilder]: For program point L617-1(line 617) no Hoare annotation was computed. [2023-12-02 19:24:44,737 INFO L899 garLoopResultBuilder]: For program point L613(lines 613 615) no Hoare annotation was computed. [2023-12-02 19:24:44,737 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2023-12-02 19:24:44,737 INFO L899 garLoopResultBuilder]: For program point L572(line 572) no Hoare annotation was computed. [2023-12-02 19:24:44,738 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 574 582) the Hoare annotation is: (let ((.cse21 (select |old(#memory_int)| 1))) (let ((.cse1 (+ |#StackHeapBarrier| 1)) (.cse3 (not (= (select .cse21 0) 48))) (.cse4 (not (= (select .cse21 1) 0))) (.cse10 (not (= |node_create_#in~data#1| 1))) (.cse11 (< |#StackHeapBarrier| 1))) (or (and (forall ((|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1| Int)) (or (< |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1| 2) (not (= (select (select |old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) 0) 0)))) (forall ((|v_ULTIMATE.start_sll_create_#in~len#1_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~len~0#1_BEFORE_CALL_12| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_sll_create_~len#1_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_create_#in~data#1_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse0 (not (= |v_ULTIMATE.start_sll_create_~len#1_BEFORE_CALL_11| 1))) (.cse2 (not (= 2 |v_ULTIMATE.start_sll_create_~len#1_BEFORE_CALL_11|)))) (or (and (or (forall ((|v_#memory_$Pointer$.base_51| (Array Int (Array Int Int)))) (not (= (store |v_#memory_$Pointer$.base_51| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_BEFORE_CALL_5| (store (select |v_#memory_$Pointer$.base_51| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_BEFORE_CALL_5|) 4 0)) |old(#memory_$Pointer$.base)|))) (forall ((|v_#memory_int_73| (Array Int (Array Int Int)))) (not (= |old(#memory_int)| (store |v_#memory_int_73| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_BEFORE_CALL_5| (store (select |v_#memory_int_73| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_BEFORE_CALL_5|) 4 (select (select |old(#memory_int)| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_BEFORE_CALL_5|) 4)))))) (forall ((|v_#memory_$Pointer$.offset_51| (Array Int (Array Int Int)))) (not (= |old(#memory_$Pointer$.offset)| (store |v_#memory_$Pointer$.offset_51| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_BEFORE_CALL_5| (store (select |v_#memory_$Pointer$.offset_51| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_BEFORE_CALL_5|) 4 0))))) (not (= |v_ULTIMATE.start_sll_create_~new_head~0#1.base_BEFORE_CALL_5| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_7|)) .cse0) (or (< |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10| .cse1) (forall ((|v_#length_22| (Array Int Int))) (or (not (= |old(#length)| (store |v_#length_22| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10| 4))) (not (= 22 (select |v_#length_22| 2))) (not (= (select |v_#length_22| 1) 2)))) .cse2 .cse3 .cse4 (forall ((|v_#valid_34| (Array Int Int))) (or (not (= (select |v_#valid_34| 2) 1)) (not (= |old(#valid)| (store |v_#valid_34| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10| 1))) (not (= (select |v_#valid_34| 0) 0)) (not (= (select |v_#valid_34| 1) 1)) (not (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|) 0)))))) (let ((.cse5 (not (= |v_ULTIMATE.start_sll_create_~head~0#1.offset_BEFORE_CALL_7| 0))) (.cse6 (not (= |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10| 0))) (.cse7 (not (= |v_ULTIMATE.start_main_~len~0#1_BEFORE_CALL_12| 2))) (.cse8 (not (= |v_ULTIMATE.start_sll_create_#in~data#1_BEFORE_CALL_7| 1))) (.cse9 (not (= |v_ULTIMATE.start_sll_create_#in~len#1_BEFORE_CALL_7| 2))) (.cse12 (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_10| 1)))) (and (or .cse5 (not (= |v_ULTIMATE.start_sll_create_~new_head~0#1.offset_BEFORE_CALL_5| 0)) .cse6 .cse7 .cse8 (< |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10| 2) .cse9 .cse10 .cse11 .cse12 .cse0) (or .cse5 .cse6 .cse7 .cse8 .cse2 .cse9 .cse10 .cse11 (not (= |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_7| 0)) .cse12))))))) (forall ((|v_ULTIMATE.start_main_~len~0#1_BEFORE_CALL_22| Int) (|v_ULTIMATE.start_sll_create_#in~len#1_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_sll_create_~len#1_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_sll_create_#in~data#1_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.offset_BEFORE_CALL_14| Int)) (let ((.cse14 (not (= |v_ULTIMATE.start_sll_create_~len#1_BEFORE_CALL_20| 1))) (.cse13 (not (= 2 |v_ULTIMATE.start_sll_create_~len#1_BEFORE_CALL_20|)))) (or (and (or (< |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| .cse1) (forall ((|v_#valid_45| (Array Int Int))) (or (not (= (select |v_#valid_45| 2) 1)) (not (= (select |v_#valid_45| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|) 0)) (not (= |old(#valid)| (store |v_#valid_45| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| 1))) (not (= (select |v_#valid_45| 0) 0)) (not (= (select |v_#valid_45| 1) 1)))) (forall ((|v_#length_33| (Array Int Int))) (or (not (= 2 (select |v_#length_33| 1))) (not (= 22 (select |v_#length_33| 2))) (not (= |old(#length)| (store |v_#length_33| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| 4))))) .cse3 .cse4 .cse13) (or (forall ((|v_#memory_$Pointer$.offset_67| (Array Int (Array Int Int)))) (not (= |old(#memory_$Pointer$.offset)| (store |v_#memory_$Pointer$.offset_67| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_BEFORE_CALL_10| (store (select |v_#memory_$Pointer$.offset_67| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_BEFORE_CALL_10|) 4 0))))) .cse14 (forall ((|v_#memory_$Pointer$.base_67| (Array Int (Array Int Int)))) (not (= |old(#memory_$Pointer$.base)| (store |v_#memory_$Pointer$.base_67| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_BEFORE_CALL_10| (store (select |v_#memory_$Pointer$.base_67| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_BEFORE_CALL_10|) 4 (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_BEFORE_CALL_10|) 4)))))) (forall ((|v_#memory_int_95| (Array Int (Array Int Int)))) (not (= |old(#memory_int)| (store |v_#memory_int_95| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_BEFORE_CALL_10| (store (select |v_#memory_int_95| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_BEFORE_CALL_10|) 4 (select (select |old(#memory_int)| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_BEFORE_CALL_10|) 4)))))) (not (= |v_ULTIMATE.start_sll_create_~new_head~0#1.base_BEFORE_CALL_10| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)))) (let ((.cse15 (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_20| 1))) (.cse16 (not (= |v_ULTIMATE.start_sll_create_~head~0#1.offset_BEFORE_CALL_14| 0))) (.cse17 (not (= |v_ULTIMATE.start_sll_create_#in~len#1_BEFORE_CALL_14| 2))) (.cse18 (not (= |v_ULTIMATE.start_main_~len~0#1_BEFORE_CALL_22| 2))) (.cse19 (not (= |v_ULTIMATE.start_sll_create_#in~data#1_BEFORE_CALL_14| 1))) (.cse20 (not (= |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_20| 0)))) (and (or .cse15 .cse16 .cse17 .cse14 .cse18 (< |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| 2) .cse10 .cse11 .cse19 .cse20 (not (= |v_ULTIMATE.start_sll_create_~new_head~0#1.offset_BEFORE_CALL_10| 0))) (or .cse15 .cse16 .cse17 .cse18 .cse10 .cse11 .cse19 .cse20 (not (= |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| 0)) .cse13)))))) (and (= |old(#length)| |#length|) (= |#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 19:24:44,738 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2023-12-02 19:24:44,741 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1] [2023-12-02 19:24:44,743 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 19:24:44,758 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~#s~0 [2023-12-02 19:24:44,759 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_22 : [int]int :: (#length == v_#length_22[~#s~0!base := 4] && v_#length_22[1] == 2) && 22 == v_#length_22[2]) could not be translated [2023-12-02 19:24:44,760 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_45 : [int]int :: (((#valid == v_#valid_45[~#s~0!base := 1] && v_#valid_45[~#s~0!base] == 0) && v_#valid_45[1] == 1) && v_#valid_45[2] == 1) && v_#valid_45[0] == 0) could not be translated [2023-12-02 19:24:44,760 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-12-02 19:24:44,760 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-12-02 19:24:44,760 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-12-02 19:24:44,761 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$.base[~head~0!base][4]] could not be translated [2023-12-02 19:24:44,761 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated [2023-12-02 19:24:44,761 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~#s~0 [2023-12-02 19:24:44,761 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4] could not be translated [2023-12-02 19:24:44,761 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~head~0!base][4]][4] could not be translated [2023-12-02 19:24:44,762 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.offset_67 : [int,int]int :: #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_67[~new_head~0!base := v_#memory_$Pointer$.offset_67[~new_head~0!base][4 := 0]]) could not be translated [2023-12-02 19:24:44,762 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated [2023-12-02 19:24:44,762 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-12-02 19:24:44,762 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated [2023-12-02 19:24:44,762 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~#s~0 [2023-12-02 19:24:44,763 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.offset_67 : [int,int]int :: #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_67[~new_head~0!base := v_#memory_$Pointer$.offset_67[~new_head~0!base][4 := 0]]) could not be translated [2023-12-02 19:24:44,782 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_sll_prepend_#in~head#1.base_14 : int, v_#memory_int_96 : [int,int]int, v_ULTIMATE.start_sll_prepend_~head#1.base_16 : int, v_#memory_$Pointer$.offset_68 : [int,int]int, v_#memory_int_25 : [int,int]int, v_#memory_$Pointer$.base_68 : [int,int]int :: (((#memory_int == v_#memory_int_25[v_ULTIMATE.start_sll_prepend_~head#1.base_16 := v_#memory_int_25[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0 := #memory_int[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]]] && v_#memory_int_25 == v_#memory_int_96[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_int_96[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := v_#memory_int_25[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4]]]) && (((((((((((((exists v_#valid_46 : [int]int :: v_#valid_46[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := 1] == #valid && v_#valid_46[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]] == 0) && (exists v_#memory_int_95 : [int,int]int, v_old(#memory_int)_AFTER_CALL_24 : [int,int]int :: v_old_#memory_int__AFTER_CALL_24 == v_#memory_int_95[#res!base := v_#memory_int_95[#res!base][4 := v_old_#memory_int__AFTER_CALL_24[#res!base][4]]])) && (exists v_#memory_int_37 : [int,int]int, v_#memory_int_92 : [int,int]int :: v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][0 := 1]] == v_#memory_int_96 && v_#memory_int_37 == v_#memory_int_92[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_int_92[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4]]])) && #memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] + 1 <= #StackHeapBarrier) && !(#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] == 0)) && v_ULTIMATE.start_sll_prepend_~head#1.base_16 == v_ULTIMATE.start_sll_prepend_#in~head#1.base_14) && (exists v_old(#memory_$Pointer$.base)_AFTER_CALL_24 : [int,int]int, v_#memory_$Pointer$.base_67 : [int,int]int :: v_old_#memory_$Pointer$.base__AFTER_CALL_24 == v_#memory_$Pointer$.base_67[#res!base := v_#memory_$Pointer$.base_67[#res!base][4 := v_old_#memory_$Pointer$.base__AFTER_CALL_24[#res!base][4]]] && v_old_#memory_$Pointer$.base__AFTER_CALL_24[~#s~0!base][0] == #res!base)) && (exists v_#memory_$Pointer$.base_64 : [int,int]int :: v_#memory_$Pointer$.base_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.base_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := 0][0 := v_#memory_$Pointer$.base_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][0]]] == v_#memory_$Pointer$.base_68)) && (exists v_#memory_$Pointer$.offset_67 : [int,int]int :: v_#memory_$Pointer$.offset_67[#res!base := v_#memory_$Pointer$.offset_67[#res!base][4 := 0]][~#s~0!base][0] == 0)) && v_ULTIMATE.start_sll_prepend_#in~head#1.base_14 == ~#s~0!base) && (exists v_#memory_$Pointer$.offset_64 : [int,int]int :: v_#memory_$Pointer$.offset_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.offset_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := 0][0 := v_#memory_$Pointer$.offset_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][0]]] == v_#memory_$Pointer$.offset_68)) && (exists v_#length_34 : [int]int :: v_#length_34[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := 8] == #length)) || ((((((((((((exists v_#valid_46 : [int]int :: v_#valid_46[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := 1] == #valid && v_#valid_46[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]] == 0) && (exists v_#memory_int_95 : [int,int]int, v_old(#memory_int)_AFTER_CALL_23 : [int,int]int :: v_old_#memory_int__AFTER_CALL_23 == v_#memory_int_95[#res!base := v_#memory_int_95[#res!base][4 := v_old_#memory_int__AFTER_CALL_23[#res!base][4]]])) && (exists v_#memory_int_37 : [int,int]int, v_#memory_int_92 : [int,int]int :: v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][0 := 1]] == v_#memory_int_96 && v_#memory_int_37 == v_#memory_int_92[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_int_92[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4]]])) && #memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] + 1 <= #StackHeapBarrier) && !(#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] == 0)) && v_ULTIMATE.start_sll_prepend_~head#1.base_16 == v_ULTIMATE.start_sll_prepend_#in~head#1.base_14) && (exists v_#memory_$Pointer$.base_64 : [int,int]int :: v_#memory_$Pointer$.base_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.base_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := 0][0 := v_#memory_$Pointer$.base_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][0]]] == v_#memory_$Pointer$.base_68)) && (exists v_#memory_$Pointer$.offset_67 : [int,int]int :: v_#memory_$Pointer$.offset_67[#res!base := v_#memory_$Pointer$.offset_67[#res!base][4 := 0]][~#s~0!base][0] == 0)) && v_ULTIMATE.start_sll_prepend_#in~head#1.base_14 == ~#s~0!base) && (exists v_#memory_$Pointer$.offset_64 : [int,int]int :: v_#memory_$Pointer$.offset_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.offset_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := 0][0 := v_#memory_$Pointer$.offset_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][0]]] == v_#memory_$Pointer$.offset_68)) && (exists v_#length_34 : [int]int :: v_#length_34[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := 8] == #length)) && (exists v_old(#memory_$Pointer$.base)_AFTER_CALL_23 : [int,int]int, v_#memory_$Pointer$.base_67 : [int,int]int :: v_old_#memory_$Pointer$.base__AFTER_CALL_23[~#s~0!base][0] == #res!base && v_old_#memory_$Pointer$.base__AFTER_CALL_23 == v_#memory_$Pointer$.base_67[#res!base := v_#memory_$Pointer$.base_67[#res!base][4 := v_old_#memory_$Pointer$.base__AFTER_CALL_23[#res!base][4]]])))) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.offset_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := v_#memory_$Pointer$.offset_68[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]]][v_ULTIMATE.start_sll_prepend_~head#1.base_16 := v_#memory_$Pointer$.offset_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.offset_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := 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]]) && #memory_$Pointer$.base == v_#memory_$Pointer$.base_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.base_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := v_#memory_$Pointer$.base_68[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]]][v_ULTIMATE.start_sll_prepend_~head#1.base_16 := v_#memory_$Pointer$.base_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.base_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := 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 := #memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]]]) could not be translated [2023-12-02 19:24:44,784 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_74 : [int,int]int, v_#memory_$Pointer$.base_52 : [int,int]int, v_#memory_$Pointer$.offset_52 : [int,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_25 : [int,int]int :: (((((((((((((((exists v_#valid_35 : [int]int :: v_#valid_35[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]] == 0 && #valid == v_#valid_35[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0] := 1]) && (exists v_#length_23 : [int]int :: #length == v_#length_23[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0] := 8])) && (exists v_#memory_int_37 : [int,int]int, v_#memory_int_70 : [int,int]int :: v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0] := v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]][0 := 1]] == v_#memory_int_74 && v_#memory_int_37 == v_#memory_int_70[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0] := v_#memory_int_70[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]][4 := v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]][4]]])) && !(0 == #memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0])) && v_ULTIMATE.start_sll_prepend_~head#1.base_14 == v_ULTIMATE.start_sll_prepend_#in~head#1.base_11) && (exists v_#memory_$Pointer$.base_48 : [int,int]int :: v_#memory_$Pointer$.base_48[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0] := v_#memory_$Pointer$.base_48[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]][4 := 0][0 := v_#memory_$Pointer$.base_52[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]][0]]] == v_#memory_$Pointer$.base_52)) && (exists v_#memory_$Pointer$.offset_48 : [int,int]int :: v_#memory_$Pointer$.offset_48[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0] := v_#memory_$Pointer$.offset_48[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]][4 := 0][0 := v_#memory_$Pointer$.offset_52[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]][0]]] == v_#memory_$Pointer$.offset_52)) && (exists v_#memory_$Pointer$.offset_BEFORE_CALL_15 : [int,int]int :: v_#memory_$Pointer$.offset_BEFORE_CALL_15[~#s~0!base][0] == 0)) && (exists v_old(#memory_$Pointer$.base)_AFTER_CALL_13 : [int,int]int :: v_old_#memory_$Pointer$.base__AFTER_CALL_13[~#s~0!base][0] == #res!base)) && v_ULTIMATE.start_sll_prepend_#in~head#1.base_11 == ~#s~0!base) && 1 + #memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0] <= #StackHeapBarrier) || (((((((((((exists v_#memory_$Pointer$.offset_BEFORE_CALL_17 : [int,int]int :: v_#memory_$Pointer$.offset_BEFORE_CALL_17[~#s~0!base][0] == 0) && (exists v_#valid_35 : [int]int :: v_#valid_35[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]] == 0 && #valid == v_#valid_35[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0] := 1])) && (exists v_#length_23 : [int]int :: #length == v_#length_23[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0] := 8])) && (exists v_old(#memory_$Pointer$.base)_AFTER_CALL_14 : [int,int]int :: v_old_#memory_$Pointer$.base__AFTER_CALL_14[~#s~0!base][0] == #res!base)) && (exists v_#memory_int_37 : [int,int]int, v_#memory_int_70 : [int,int]int :: v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0] := v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]][0 := 1]] == v_#memory_int_74 && v_#memory_int_37 == v_#memory_int_70[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0] := v_#memory_int_70[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]][4 := v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]][4]]])) && !(0 == #memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0])) && v_ULTIMATE.start_sll_prepend_~head#1.base_14 == v_ULTIMATE.start_sll_prepend_#in~head#1.base_11) && (exists v_#memory_$Pointer$.base_48 : [int,int]int :: v_#memory_$Pointer$.base_48[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0] := v_#memory_$Pointer$.base_48[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]][4 := 0][0 := v_#memory_$Pointer$.base_52[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]][0]]] == v_#memory_$Pointer$.base_52)) && (exists v_#memory_$Pointer$.offset_48 : [int,int]int :: v_#memory_$Pointer$.offset_48[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0] := v_#memory_$Pointer$.offset_48[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]][4 := 0][0 := v_#memory_$Pointer$.offset_52[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]][0]]] == v_#memory_$Pointer$.offset_52)) && v_ULTIMATE.start_sll_prepend_#in~head#1.base_11 == ~#s~0!base) && 1 + #memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0] <= #StackHeapBarrier)) && v_#memory_$Pointer$.base_52[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0] := v_#memory_$Pointer$.base_52[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]][4 := v_#memory_$Pointer$.base_52[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]]][v_ULTIMATE.start_sll_prepend_~head#1.base_14 := v_#memory_$Pointer$.base_52[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0] := v_#memory_$Pointer$.base_52[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]][4 := v_#memory_$Pointer$.base_52[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]]][v_ULTIMATE.start_sll_prepend_~head#1.base_14][0 := #memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]]] == #memory_$Pointer$.base) && #memory_int == v_#memory_int_25[v_ULTIMATE.start_sll_prepend_~head#1.base_14 := v_#memory_int_25[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0 := #memory_int[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]]]) && v_#memory_int_74[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0] := v_#memory_int_74[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]][4 := v_#memory_int_25[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]][4]]] == v_#memory_int_25) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_52[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0] := v_#memory_$Pointer$.offset_52[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]][4 := v_#memory_$Pointer$.offset_52[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]]][v_ULTIMATE.start_sll_prepend_~head#1.base_14 := v_#memory_$Pointer$.offset_52[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0] := v_#memory_$Pointer$.offset_52[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]][4 := v_#memory_$Pointer$.offset_52[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]]][v_ULTIMATE.start_sll_prepend_~head#1.base_14][0 := 0]]) could not be translated [2023-12-02 19:24:44,784 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:24:44,785 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_main_~#s~0#1.offset : int, ULTIMATE.start_main_~#s~0#1.base : int :: (((((((((2 + #memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset] <= ULTIMATE.start_main_~#s~0#1.base && #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4]][4]][4] == 0) && 2 + #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4]][4] <= ULTIMATE.start_main_~#s~0#1.base) && #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4]][4]][4] == 0) && ~ptr~0!base == #memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4]][4] == #memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset])) && #memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset] == 0) && #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4]][4] == 0) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4] == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4]][4])) && 2 + #memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4] <= ULTIMATE.start_main_~#s~0#1.base) && #memory_$Pointer$.offset[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4] == 0) could not be translated [2023-12-02 19:24:44,785 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#s~0!base][0] could not be translated [2023-12-02 19:24:44,785 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_main_~#s~0#1.offset : int, ULTIMATE.start_main_~#s~0#1.base : int :: (((((((((2 + #memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset] <= ULTIMATE.start_main_~#s~0#1.base && #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4]][4]][4] == 0) && 2 + #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4]][4] <= ULTIMATE.start_main_~#s~0#1.base) && ~ptr~0!base == #memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4]) && #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4]][4]][4] == 0) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4]][4] == #memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset])) && #memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset] == 0) && #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4]][4] == 0) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4] == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4]][4])) && 2 + #memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4] <= ULTIMATE.start_main_~#s~0#1.base) && #memory_$Pointer$.offset[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4] == 0) could not be translated [2023-12-02 19:24:44,786 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_sll_prepend_#in~head#1.base_14 : int, v_#memory_int_96 : [int,int]int, v_ULTIMATE.start_sll_prepend_~head#1.base_16 : int, v_#memory_$Pointer$.offset_68 : [int,int]int, v_#memory_int_25 : [int,int]int, v_#memory_$Pointer$.base_68 : [int,int]int :: (((#memory_int == v_#memory_int_25[v_ULTIMATE.start_sll_prepend_~head#1.base_16 := v_#memory_int_25[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0 := #memory_int[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]]] && v_#memory_int_25 == v_#memory_int_96[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_int_96[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := v_#memory_int_25[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4]]]) && (((((((((((((exists v_#valid_46 : [int]int :: v_#valid_46[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := 1] == #valid && v_#valid_46[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]] == 0) && (exists v_#memory_int_95 : [int,int]int, v_old(#memory_int)_AFTER_CALL_24 : [int,int]int :: v_old_#memory_int__AFTER_CALL_24 == v_#memory_int_95[#res!base := v_#memory_int_95[#res!base][4 := v_old_#memory_int__AFTER_CALL_24[#res!base][4]]])) && (exists v_#memory_int_37 : [int,int]int, v_#memory_int_92 : [int,int]int :: v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][0 := 1]] == v_#memory_int_96 && v_#memory_int_37 == v_#memory_int_92[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_int_92[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4]]])) && #memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] + 1 <= #StackHeapBarrier) && !(#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] == 0)) && v_ULTIMATE.start_sll_prepend_~head#1.base_16 == v_ULTIMATE.start_sll_prepend_#in~head#1.base_14) && (exists v_old(#memory_$Pointer$.base)_AFTER_CALL_24 : [int,int]int, v_#memory_$Pointer$.base_67 : [int,int]int :: v_old_#memory_$Pointer$.base__AFTER_CALL_24 == v_#memory_$Pointer$.base_67[#res!base := v_#memory_$Pointer$.base_67[#res!base][4 := v_old_#memory_$Pointer$.base__AFTER_CALL_24[#res!base][4]]] && v_old_#memory_$Pointer$.base__AFTER_CALL_24[~#s~0!base][0] == #res!base)) && (exists v_#memory_$Pointer$.base_64 : [int,int]int :: v_#memory_$Pointer$.base_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.base_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := 0][0 := v_#memory_$Pointer$.base_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][0]]] == v_#memory_$Pointer$.base_68)) && (exists v_#memory_$Pointer$.offset_67 : [int,int]int :: v_#memory_$Pointer$.offset_67[#res!base := v_#memory_$Pointer$.offset_67[#res!base][4 := 0]][~#s~0!base][0] == 0)) && v_ULTIMATE.start_sll_prepend_#in~head#1.base_14 == ~#s~0!base) && (exists v_#memory_$Pointer$.offset_64 : [int,int]int :: v_#memory_$Pointer$.offset_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.offset_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := 0][0 := v_#memory_$Pointer$.offset_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][0]]] == v_#memory_$Pointer$.offset_68)) && (exists v_#length_34 : [int]int :: v_#length_34[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := 8] == #length)) || ((((((((((((exists v_#valid_46 : [int]int :: v_#valid_46[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := 1] == #valid && v_#valid_46[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]] == 0) && (exists v_#memory_int_95 : [int,int]int, v_old(#memory_int)_AFTER_CALL_23 : [int,int]int :: v_old_#memory_int__AFTER_CALL_23 == v_#memory_int_95[#res!base := v_#memory_int_95[#res!base][4 := v_old_#memory_int__AFTER_CALL_23[#res!base][4]]])) && (exists v_#memory_int_37 : [int,int]int, v_#memory_int_92 : [int,int]int :: v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][0 := 1]] == v_#memory_int_96 && v_#memory_int_37 == v_#memory_int_92[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_int_92[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4]]])) && #memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] + 1 <= #StackHeapBarrier) && !(#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] == 0)) && v_ULTIMATE.start_sll_prepend_~head#1.base_16 == v_ULTIMATE.start_sll_prepend_#in~head#1.base_14) && (exists v_#memory_$Pointer$.base_64 : [int,int]int :: v_#memory_$Pointer$.base_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.base_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := 0][0 := v_#memory_$Pointer$.base_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][0]]] == v_#memory_$Pointer$.base_68)) && (exists v_#memory_$Pointer$.offset_67 : [int,int]int :: v_#memory_$Pointer$.offset_67[#res!base := v_#memory_$Pointer$.offset_67[#res!base][4 := 0]][~#s~0!base][0] == 0)) && v_ULTIMATE.start_sll_prepend_#in~head#1.base_14 == ~#s~0!base) && (exists v_#memory_$Pointer$.offset_64 : [int,int]int :: v_#memory_$Pointer$.offset_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.offset_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := 0][0 := v_#memory_$Pointer$.offset_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][0]]] == v_#memory_$Pointer$.offset_68)) && (exists v_#length_34 : [int]int :: v_#length_34[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := 8] == #length)) && (exists v_old(#memory_$Pointer$.base)_AFTER_CALL_23 : [int,int]int, v_#memory_$Pointer$.base_67 : [int,int]int :: v_old_#memory_$Pointer$.base__AFTER_CALL_23[~#s~0!base][0] == #res!base && v_old_#memory_$Pointer$.base__AFTER_CALL_23 == v_#memory_$Pointer$.base_67[#res!base := v_#memory_$Pointer$.base_67[#res!base][4 := v_old_#memory_$Pointer$.base__AFTER_CALL_23[#res!base][4]]])))) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.offset_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := v_#memory_$Pointer$.offset_68[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]]][v_ULTIMATE.start_sll_prepend_~head#1.base_16 := v_#memory_$Pointer$.offset_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.offset_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := 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]]) && #memory_$Pointer$.base == v_#memory_$Pointer$.base_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.base_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := v_#memory_$Pointer$.base_68[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]]][v_ULTIMATE.start_sll_prepend_~head#1.base_16 := v_#memory_$Pointer$.base_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.base_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := 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 := #memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]]]) could not be translated [2023-12-02 19:24:44,786 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#s~0!base][0] could not be translated [2023-12-02 19:24:44,787 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:24:44,787 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:24:44,788 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_sll_prepend_#in~head#1.base_14 : int, v_#memory_int_96 : [int,int]int, v_ULTIMATE.start_sll_prepend_~head#1.base_16 : int, v_#memory_$Pointer$.offset_68 : [int,int]int, v_#memory_int_25 : [int,int]int, v_#memory_$Pointer$.base_68 : [int,int]int :: (((#memory_int == v_#memory_int_25[v_ULTIMATE.start_sll_prepend_~head#1.base_16 := v_#memory_int_25[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0 := #memory_int[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]]] && v_#memory_int_25 == v_#memory_int_96[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_int_96[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := v_#memory_int_25[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4]]]) && (((((((((((((exists v_#valid_46 : [int]int :: v_#valid_46[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := 1] == #valid && v_#valid_46[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]] == 0) && (exists v_#memory_int_95 : [int,int]int, v_old(#memory_int)_AFTER_CALL_24 : [int,int]int :: v_old_#memory_int__AFTER_CALL_24 == v_#memory_int_95[#res!base := v_#memory_int_95[#res!base][4 := v_old_#memory_int__AFTER_CALL_24[#res!base][4]]])) && (exists v_#memory_int_37 : [int,int]int, v_#memory_int_92 : [int,int]int :: v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][0 := 1]] == v_#memory_int_96 && v_#memory_int_37 == v_#memory_int_92[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_int_92[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4]]])) && #memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] + 1 <= #StackHeapBarrier) && !(#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] == 0)) && v_ULTIMATE.start_sll_prepend_~head#1.base_16 == v_ULTIMATE.start_sll_prepend_#in~head#1.base_14) && (exists v_old(#memory_$Pointer$.base)_AFTER_CALL_24 : [int,int]int, v_#memory_$Pointer$.base_67 : [int,int]int :: v_old_#memory_$Pointer$.base__AFTER_CALL_24 == v_#memory_$Pointer$.base_67[#res!base := v_#memory_$Pointer$.base_67[#res!base][4 := v_old_#memory_$Pointer$.base__AFTER_CALL_24[#res!base][4]]] && v_old_#memory_$Pointer$.base__AFTER_CALL_24[~#s~0!base][0] == #res!base)) && (exists v_#memory_$Pointer$.base_64 : [int,int]int :: v_#memory_$Pointer$.base_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.base_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := 0][0 := v_#memory_$Pointer$.base_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][0]]] == v_#memory_$Pointer$.base_68)) && (exists v_#memory_$Pointer$.offset_67 : [int,int]int :: v_#memory_$Pointer$.offset_67[#res!base := v_#memory_$Pointer$.offset_67[#res!base][4 := 0]][~#s~0!base][0] == 0)) && v_ULTIMATE.start_sll_prepend_#in~head#1.base_14 == ~#s~0!base) && (exists v_#memory_$Pointer$.offset_64 : [int,int]int :: v_#memory_$Pointer$.offset_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.offset_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := 0][0 := v_#memory_$Pointer$.offset_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][0]]] == v_#memory_$Pointer$.offset_68)) && (exists v_#length_34 : [int]int :: v_#length_34[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := 8] == #length)) || ((((((((((((exists v_#valid_46 : [int]int :: v_#valid_46[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := 1] == #valid && v_#valid_46[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]] == 0) && (exists v_#memory_int_95 : [int,int]int, v_old(#memory_int)_AFTER_CALL_23 : [int,int]int :: v_old_#memory_int__AFTER_CALL_23 == v_#memory_int_95[#res!base := v_#memory_int_95[#res!base][4 := v_old_#memory_int__AFTER_CALL_23[#res!base][4]]])) && (exists v_#memory_int_37 : [int,int]int, v_#memory_int_92 : [int,int]int :: v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][0 := 1]] == v_#memory_int_96 && v_#memory_int_37 == v_#memory_int_92[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_int_92[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4]]])) && #memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] + 1 <= #StackHeapBarrier) && !(#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] == 0)) && v_ULTIMATE.start_sll_prepend_~head#1.base_16 == v_ULTIMATE.start_sll_prepend_#in~head#1.base_14) && (exists v_#memory_$Pointer$.base_64 : [int,int]int :: v_#memory_$Pointer$.base_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.base_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := 0][0 := v_#memory_$Pointer$.base_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][0]]] == v_#memory_$Pointer$.base_68)) && (exists v_#memory_$Pointer$.offset_67 : [int,int]int :: v_#memory_$Pointer$.offset_67[#res!base := v_#memory_$Pointer$.offset_67[#res!base][4 := 0]][~#s~0!base][0] == 0)) && v_ULTIMATE.start_sll_prepend_#in~head#1.base_14 == ~#s~0!base) && (exists v_#memory_$Pointer$.offset_64 : [int,int]int :: v_#memory_$Pointer$.offset_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.offset_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := 0][0 := v_#memory_$Pointer$.offset_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][0]]] == v_#memory_$Pointer$.offset_68)) && (exists v_#length_34 : [int]int :: v_#length_34[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := 8] == #length)) && (exists v_old(#memory_$Pointer$.base)_AFTER_CALL_23 : [int,int]int, v_#memory_$Pointer$.base_67 : [int,int]int :: v_old_#memory_$Pointer$.base__AFTER_CALL_23[~#s~0!base][0] == #res!base && v_old_#memory_$Pointer$.base__AFTER_CALL_23 == v_#memory_$Pointer$.base_67[#res!base := v_#memory_$Pointer$.base_67[#res!base][4 := v_old_#memory_$Pointer$.base__AFTER_CALL_23[#res!base][4]]])))) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.offset_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := v_#memory_$Pointer$.offset_68[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]]][v_ULTIMATE.start_sll_prepend_~head#1.base_16 := v_#memory_$Pointer$.offset_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.offset_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := 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]]) && #memory_$Pointer$.base == v_#memory_$Pointer$.base_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.base_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := v_#memory_$Pointer$.base_68[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]]][v_ULTIMATE.start_sll_prepend_~head#1.base_16 := v_#memory_$Pointer$.base_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.base_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := 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 := #memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]]]) could not be translated [2023-12-02 19:24:44,788 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#s~0!base][0] could not be translated [2023-12-02 19:24:44,789 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:24:44,789 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:24:44,790 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_main_~#s~0#1.offset : int, ULTIMATE.start_main_~#s~0#1.base : int :: (((((((((~ptr~0!base == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4]][4] && 2 + #memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset] <= ULTIMATE.start_main_~#s~0#1.base) && #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4]][4]][4] == 0) && 2 + #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4]][4] <= ULTIMATE.start_main_~#s~0#1.base) && #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4]][4]][4] == 0) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4]][4] == #memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset])) && #memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset] == 0) && #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4]][4] == 0) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4] == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4]][4])) && 2 + #memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4] <= ULTIMATE.start_main_~#s~0#1.base) && #memory_$Pointer$.offset[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4] == 0) could not be translated [2023-12-02 19:24:44,790 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:24:44,790 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:24:44,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 07:24:44 BoogieIcfgContainer [2023-12-02 19:24:44,791 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 19:24:44,792 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 19:24:44,792 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 19:24:44,792 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 19:24:44,793 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:21:33" (3/4) ... [2023-12-02 19:24:44,795 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-12-02 19:24:44,798 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2023-12-02 19:24:44,803 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2023-12-02 19:24:44,803 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2023-12-02 19:24:44,804 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-12-02 19:24:44,804 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-12-02 19:24:44,832 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((2 == len) && (2 == \old(len))) && (data == 1)) && (len == 2)) && (data == 1)) && (\old(data) == 1)) || ((((((2 == \old(len)) && (data == 1)) && (len == 0)) && (len == 2)) && (data == 1)) && (\old(data) == 1))) || ((((((len == 1) && (2 == \old(len))) && (data == 1)) && (len == 2)) && (data == 1)) && (\old(data) == 1))) [2023-12-02 19:24:44,850 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((2 == len) && (2 == \old(len))) && (data == 1)) && (len == 2)) && (data == 1)) && (\old(data) == 1)) || ((((((2 == \old(len)) && (data == 1)) && (len == 0)) && (len == 2)) && (data == 1)) && (\old(data) == 1))) || ((((((len == 1) && (2 == \old(len))) && (data == 1)) && (len == 2)) && (data == 1)) && (\old(data) == 1))) [2023-12-02 19:24:44,898 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/witness.graphml [2023-12-02 19:24:44,898 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/witness.yml [2023-12-02 19:24:44,898 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 19:24:44,899 INFO L158 Benchmark]: Toolchain (without parser) took 192127.12ms. Allocated memory was 167.8MB in the beginning and 362.8MB in the end (delta: 195.0MB). Free memory was 126.5MB in the beginning and 146.9MB in the end (delta: -20.4MB). Peak memory consumption was 175.8MB. Max. memory is 16.1GB. [2023-12-02 19:24:44,899 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 111.1MB. Free memory is still 60.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 19:24:44,899 INFO L158 Benchmark]: CACSL2BoogieTranslator took 424.24ms. Allocated memory is still 167.8MB. Free memory was 126.0MB in the beginning and 108.8MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-12-02 19:24:44,900 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.03ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 106.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 19:24:44,900 INFO L158 Benchmark]: Boogie Preprocessor took 37.50ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 105.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 19:24:44,901 INFO L158 Benchmark]: RCFGBuilder took 420.58ms. Allocated memory is still 167.8MB. Free memory was 105.0MB in the beginning and 86.7MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-12-02 19:24:44,901 INFO L158 Benchmark]: TraceAbstraction took 191082.51ms. Allocated memory was 167.8MB in the beginning and 362.8MB in the end (delta: 195.0MB). Free memory was 85.7MB in the beginning and 152.1MB in the end (delta: -66.4MB). Peak memory consumption was 176.5MB. Max. memory is 16.1GB. [2023-12-02 19:24:44,901 INFO L158 Benchmark]: Witness Printer took 106.39ms. Allocated memory is still 362.8MB. Free memory was 152.1MB in the beginning and 146.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-12-02 19:24:44,903 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.22ms. Allocated memory is still 111.1MB. Free memory is still 60.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 424.24ms. Allocated memory is still 167.8MB. Free memory was 126.0MB in the beginning and 108.8MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.03ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 106.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.50ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 105.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 420.58ms. Allocated memory is still 167.8MB. Free memory was 105.0MB in the beginning and 86.7MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 191082.51ms. Allocated memory was 167.8MB in the beginning and 362.8MB in the end (delta: 195.0MB). Free memory was 85.7MB in the beginning and 152.1MB in the end (delta: -66.4MB). Peak memory consumption was 176.5MB. Max. memory is 16.1GB. * Witness Printer took 106.39ms. Allocated memory is still 362.8MB. Free memory was 152.1MB in the beginning and 146.9MB 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: unknown boogie variable ~#s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#length_22 : [int]int :: (#length == v_#length_22[~#s~0!base := 4] && v_#length_22[1] == 2) && 22 == v_#length_22[2]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#valid_45 : [int]int :: (((#valid == v_#valid_45[~#s~0!base := 1] && v_#valid_45[~#s~0!base] == 0) && v_#valid_45[1] == 1) && v_#valid_45[2] == 1) && v_#valid_45[0] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] 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[#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_$Pointer$.offset[#memory_$Pointer$.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.offset_67 : [int,int]int :: #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_67[~new_head~0!base := v_#memory_$Pointer$.offset_67[~new_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 #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: QuantifierExpression (exists v_#memory_$Pointer$.offset_67 : [int,int]int :: #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_67[~new_head~0!base := v_#memory_$Pointer$.offset_67[~new_head~0!base][4 := 0]]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_sll_prepend_#in~head#1.base_14 : int, v_#memory_int_96 : [int,int]int, v_ULTIMATE.start_sll_prepend_~head#1.base_16 : int, v_#memory_$Pointer$.offset_68 : [int,int]int, v_#memory_int_25 : [int,int]int, v_#memory_$Pointer$.base_68 : [int,int]int :: (((#memory_int == v_#memory_int_25[v_ULTIMATE.start_sll_prepend_~head#1.base_16 := v_#memory_int_25[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0 := #memory_int[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]]] && v_#memory_int_25 == v_#memory_int_96[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_int_96[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := v_#memory_int_25[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4]]]) && (((((((((((((exists v_#valid_46 : [int]int :: v_#valid_46[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := 1] == #valid && v_#valid_46[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]] == 0) && (exists v_#memory_int_95 : [int,int]int, v_old(#memory_int)_AFTER_CALL_24 : [int,int]int :: v_old_#memory_int__AFTER_CALL_24 == v_#memory_int_95[#res!base := v_#memory_int_95[#res!base][4 := v_old_#memory_int__AFTER_CALL_24[#res!base][4]]])) && (exists v_#memory_int_37 : [int,int]int, v_#memory_int_92 : [int,int]int :: v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][0 := 1]] == v_#memory_int_96 && v_#memory_int_37 == v_#memory_int_92[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_int_92[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4]]])) && #memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] + 1 <= #StackHeapBarrier) && !(#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] == 0)) && v_ULTIMATE.start_sll_prepend_~head#1.base_16 == v_ULTIMATE.start_sll_prepend_#in~head#1.base_14) && (exists v_old(#memory_$Pointer$.base)_AFTER_CALL_24 : [int,int]int, v_#memory_$Pointer$.base_67 : [int,int]int :: v_old_#memory_$Pointer$.base__AFTER_CALL_24 == v_#memory_$Pointer$.base_67[#res!base := v_#memory_$Pointer$.base_67[#res!base][4 := v_old_#memory_$Pointer$.base__AFTER_CALL_24[#res!base][4]]] && v_old_#memory_$Pointer$.base__AFTER_CALL_24[~#s~0!base][0] == #res!base)) && (exists v_#memory_$Pointer$.base_64 : [int,int]int :: v_#memory_$Pointer$.base_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.base_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := 0][0 := v_#memory_$Pointer$.base_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][0]]] == v_#memory_$Pointer$.base_68)) && (exists v_#memory_$Pointer$.offset_67 : [int,int]int :: v_#memory_$Pointer$.offset_67[#res!base := v_#memory_$Pointer$.offset_67[#res!base][4 := 0]][~#s~0!base][0] == 0)) && v_ULTIMATE.start_sll_prepend_#in~head#1.base_14 == ~#s~0!base) && (exists v_#memory_$Pointer$.offset_64 : [int,int]int :: v_#memory_$Pointer$.offset_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.offset_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := 0][0 := v_#memory_$Pointer$.offset_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][0]]] == v_#memory_$Pointer$.offset_68)) && (exists v_#length_34 : [int]int :: v_#length_34[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := 8] == #length)) || ((((((((((((exists v_#valid_46 : [int]int :: v_#valid_46[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := 1] == #valid && v_#valid_46[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]] == 0) && (exists v_#memory_int_95 : [int,int]int, v_old(#memory_int)_AFTER_CALL_23 : [int,int]int :: v_old_#memory_int__AFTER_CALL_23 == v_#memory_int_95[#res!base := v_#memory_int_95[#res!base][4 := v_old_#memory_int__AFTER_CALL_23[#res!base][4]]])) && (exists v_#memory_int_37 : [int,int]int, v_#memory_int_92 : [int,int]int :: v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][0 := 1]] == v_#memory_int_96 && v_#memory_int_37 == v_#memory_int_92[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_int_92[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4]]])) && #memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] + 1 <= #StackHeapBarrier) && !(#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] == 0)) && v_ULTIMATE.start_sll_prepend_~head#1.base_16 == v_ULTIMATE.start_sll_prepend_#in~head#1.base_14) && (exists v_#memory_$Pointer$.base_64 : [int,int]int :: v_#memory_$Pointer$.base_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.base_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := 0][0 := v_#memory_$Pointer$.base_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][0]]] == v_#memory_$Pointer$.base_68)) && (exists v_#memory_$Pointer$.offset_67 : [int,int]int :: v_#memory_$Pointer$.offset_67[#res!base := v_#memory_$Pointer$.offset_67[#res!base][4 := 0]][~#s~0!base][0] == 0)) && v_ULTIMATE.start_sll_prepend_#in~head#1.base_14 == ~#s~0!base) && (exists v_#memory_$Pointer$.offset_64 : [int,int]int :: v_#memory_$Pointer$.offset_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.offset_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := 0][0 := v_#memory_$Pointer$.offset_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][0]]] == v_#memory_$Pointer$.offset_68)) && (exists v_#length_34 : [int]int :: v_#length_34[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := 8] == #length)) && (exists v_old(#memory_$Pointer$.base)_AFTER_CALL_23 : [int,int]int, v_#memory_$Pointer$.base_67 : [int,int]int :: v_old_#memory_$Pointer$.base__AFTER_CALL_23[~#s~0!base][0] == #res!base && v_old_#memory_$Pointer$.base__AFTER_CALL_23 == v_#memory_$Pointer$.base_67[#res!base := v_#memory_$Pointer$.base_67[#res!base][4 := v_old_#memory_$Pointer$.base__AFTER_CALL_23[#res!base][4]]])))) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.offset_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := v_#memory_$Pointer$.offset_68[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]]][v_ULTIMATE.start_sll_prepend_~head#1.base_16 := v_#memory_$Pointer$.offset_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.offset_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := 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]]) && #memory_$Pointer$.base == v_#memory_$Pointer$.base_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.base_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := v_#memory_$Pointer$.base_68[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]]][v_ULTIMATE.start_sll_prepend_~head#1.base_16 := v_#memory_$Pointer$.base_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.base_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := 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 := #memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]]]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_74 : [int,int]int, v_#memory_$Pointer$.base_52 : [int,int]int, v_#memory_$Pointer$.offset_52 : [int,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_25 : [int,int]int :: (((((((((((((((exists v_#valid_35 : [int]int :: v_#valid_35[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]] == 0 && #valid == v_#valid_35[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0] := 1]) && (exists v_#length_23 : [int]int :: #length == v_#length_23[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0] := 8])) && (exists v_#memory_int_37 : [int,int]int, v_#memory_int_70 : [int,int]int :: v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0] := v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]][0 := 1]] == v_#memory_int_74 && v_#memory_int_37 == v_#memory_int_70[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0] := v_#memory_int_70[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]][4 := v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]][4]]])) && !(0 == #memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0])) && v_ULTIMATE.start_sll_prepend_~head#1.base_14 == v_ULTIMATE.start_sll_prepend_#in~head#1.base_11) && (exists v_#memory_$Pointer$.base_48 : [int,int]int :: v_#memory_$Pointer$.base_48[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0] := v_#memory_$Pointer$.base_48[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]][4 := 0][0 := v_#memory_$Pointer$.base_52[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]][0]]] == v_#memory_$Pointer$.base_52)) && (exists v_#memory_$Pointer$.offset_48 : [int,int]int :: v_#memory_$Pointer$.offset_48[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0] := v_#memory_$Pointer$.offset_48[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]][4 := 0][0 := v_#memory_$Pointer$.offset_52[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]][0]]] == v_#memory_$Pointer$.offset_52)) && (exists v_#memory_$Pointer$.offset_BEFORE_CALL_15 : [int,int]int :: v_#memory_$Pointer$.offset_BEFORE_CALL_15[~#s~0!base][0] == 0)) && (exists v_old(#memory_$Pointer$.base)_AFTER_CALL_13 : [int,int]int :: v_old_#memory_$Pointer$.base__AFTER_CALL_13[~#s~0!base][0] == #res!base)) && v_ULTIMATE.start_sll_prepend_#in~head#1.base_11 == ~#s~0!base) && 1 + #memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0] <= #StackHeapBarrier) || (((((((((((exists v_#memory_$Pointer$.offset_BEFORE_CALL_17 : [int,int]int :: v_#memory_$Pointer$.offset_BEFORE_CALL_17[~#s~0!base][0] == 0) && (exists v_#valid_35 : [int]int :: v_#valid_35[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]] == 0 && #valid == v_#valid_35[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0] := 1])) && (exists v_#length_23 : [int]int :: #length == v_#length_23[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0] := 8])) && (exists v_old(#memory_$Pointer$.base)_AFTER_CALL_14 : [int,int]int :: v_old_#memory_$Pointer$.base__AFTER_CALL_14[~#s~0!base][0] == #res!base)) && (exists v_#memory_int_37 : [int,int]int, v_#memory_int_70 : [int,int]int :: v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0] := v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]][0 := 1]] == v_#memory_int_74 && v_#memory_int_37 == v_#memory_int_70[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0] := v_#memory_int_70[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]][4 := v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]][4]]])) && !(0 == #memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0])) && v_ULTIMATE.start_sll_prepend_~head#1.base_14 == v_ULTIMATE.start_sll_prepend_#in~head#1.base_11) && (exists v_#memory_$Pointer$.base_48 : [int,int]int :: v_#memory_$Pointer$.base_48[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0] := v_#memory_$Pointer$.base_48[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]][4 := 0][0 := v_#memory_$Pointer$.base_52[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]][0]]] == v_#memory_$Pointer$.base_52)) && (exists v_#memory_$Pointer$.offset_48 : [int,int]int :: v_#memory_$Pointer$.offset_48[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0] := v_#memory_$Pointer$.offset_48[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]][4 := 0][0 := v_#memory_$Pointer$.offset_52[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]][0]]] == v_#memory_$Pointer$.offset_52)) && v_ULTIMATE.start_sll_prepend_#in~head#1.base_11 == ~#s~0!base) && 1 + #memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0] <= #StackHeapBarrier)) && v_#memory_$Pointer$.base_52[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0] := v_#memory_$Pointer$.base_52[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]][4 := v_#memory_$Pointer$.base_52[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]]][v_ULTIMATE.start_sll_prepend_~head#1.base_14 := v_#memory_$Pointer$.base_52[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0] := v_#memory_$Pointer$.base_52[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]][4 := v_#memory_$Pointer$.base_52[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]]][v_ULTIMATE.start_sll_prepend_~head#1.base_14][0 := #memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]]] == #memory_$Pointer$.base) && #memory_int == v_#memory_int_25[v_ULTIMATE.start_sll_prepend_~head#1.base_14 := v_#memory_int_25[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0 := #memory_int[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]]]) && v_#memory_int_74[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0] := v_#memory_int_74[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]][4 := v_#memory_int_25[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]][4]]] == v_#memory_int_25) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_52[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0] := v_#memory_$Pointer$.offset_52[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]][4 := v_#memory_$Pointer$.offset_52[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]]][v_ULTIMATE.start_sll_prepend_~head#1.base_14 := v_#memory_$Pointer$.offset_52[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0] := v_#memory_$Pointer$.offset_52[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]][4 := v_#memory_$Pointer$.offset_52[v_ULTIMATE.start_sll_prepend_~head#1.base_14][0]]][v_ULTIMATE.start_sll_prepend_~head#1.base_14][0 := 0]]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_main_~#s~0#1.offset : int, ULTIMATE.start_main_~#s~0#1.base : int :: (((((((((2 + #memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset] <= ULTIMATE.start_main_~#s~0#1.base && #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4]][4]][4] == 0) && 2 + #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4]][4] <= ULTIMATE.start_main_~#s~0#1.base) && #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4]][4]][4] == 0) && ~ptr~0!base == #memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4]][4] == #memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset])) && #memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset] == 0) && #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4]][4] == 0) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4] == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4]][4])) && 2 + #memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4] <= ULTIMATE.start_main_~#s~0#1.base) && #memory_$Pointer$.offset[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_main_~#s~0#1.offset : int, ULTIMATE.start_main_~#s~0#1.base : int :: (((((((((2 + #memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset] <= ULTIMATE.start_main_~#s~0#1.base && #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4]][4]][4] == 0) && 2 + #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4]][4] <= ULTIMATE.start_main_~#s~0#1.base) && ~ptr~0!base == #memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4]) && #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4]][4]][4] == 0) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4]][4] == #memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset])) && #memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset] == 0) && #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4]][4] == 0) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4] == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4]][4])) && 2 + #memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4] <= ULTIMATE.start_main_~#s~0#1.base) && #memory_$Pointer$.offset[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_sll_prepend_#in~head#1.base_14 : int, v_#memory_int_96 : [int,int]int, v_ULTIMATE.start_sll_prepend_~head#1.base_16 : int, v_#memory_$Pointer$.offset_68 : [int,int]int, v_#memory_int_25 : [int,int]int, v_#memory_$Pointer$.base_68 : [int,int]int :: (((#memory_int == v_#memory_int_25[v_ULTIMATE.start_sll_prepend_~head#1.base_16 := v_#memory_int_25[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0 := #memory_int[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]]] && v_#memory_int_25 == v_#memory_int_96[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_int_96[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := v_#memory_int_25[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4]]]) && (((((((((((((exists v_#valid_46 : [int]int :: v_#valid_46[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := 1] == #valid && v_#valid_46[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]] == 0) && (exists v_#memory_int_95 : [int,int]int, v_old(#memory_int)_AFTER_CALL_24 : [int,int]int :: v_old_#memory_int__AFTER_CALL_24 == v_#memory_int_95[#res!base := v_#memory_int_95[#res!base][4 := v_old_#memory_int__AFTER_CALL_24[#res!base][4]]])) && (exists v_#memory_int_37 : [int,int]int, v_#memory_int_92 : [int,int]int :: v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][0 := 1]] == v_#memory_int_96 && v_#memory_int_37 == v_#memory_int_92[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_int_92[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4]]])) && #memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] + 1 <= #StackHeapBarrier) && !(#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] == 0)) && v_ULTIMATE.start_sll_prepend_~head#1.base_16 == v_ULTIMATE.start_sll_prepend_#in~head#1.base_14) && (exists v_old(#memory_$Pointer$.base)_AFTER_CALL_24 : [int,int]int, v_#memory_$Pointer$.base_67 : [int,int]int :: v_old_#memory_$Pointer$.base__AFTER_CALL_24 == v_#memory_$Pointer$.base_67[#res!base := v_#memory_$Pointer$.base_67[#res!base][4 := v_old_#memory_$Pointer$.base__AFTER_CALL_24[#res!base][4]]] && v_old_#memory_$Pointer$.base__AFTER_CALL_24[~#s~0!base][0] == #res!base)) && (exists v_#memory_$Pointer$.base_64 : [int,int]int :: v_#memory_$Pointer$.base_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.base_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := 0][0 := v_#memory_$Pointer$.base_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][0]]] == v_#memory_$Pointer$.base_68)) && (exists v_#memory_$Pointer$.offset_67 : [int,int]int :: v_#memory_$Pointer$.offset_67[#res!base := v_#memory_$Pointer$.offset_67[#res!base][4 := 0]][~#s~0!base][0] == 0)) && v_ULTIMATE.start_sll_prepend_#in~head#1.base_14 == ~#s~0!base) && (exists v_#memory_$Pointer$.offset_64 : [int,int]int :: v_#memory_$Pointer$.offset_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.offset_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := 0][0 := v_#memory_$Pointer$.offset_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][0]]] == v_#memory_$Pointer$.offset_68)) && (exists v_#length_34 : [int]int :: v_#length_34[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := 8] == #length)) || ((((((((((((exists v_#valid_46 : [int]int :: v_#valid_46[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := 1] == #valid && v_#valid_46[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]] == 0) && (exists v_#memory_int_95 : [int,int]int, v_old(#memory_int)_AFTER_CALL_23 : [int,int]int :: v_old_#memory_int__AFTER_CALL_23 == v_#memory_int_95[#res!base := v_#memory_int_95[#res!base][4 := v_old_#memory_int__AFTER_CALL_23[#res!base][4]]])) && (exists v_#memory_int_37 : [int,int]int, v_#memory_int_92 : [int,int]int :: v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][0 := 1]] == v_#memory_int_96 && v_#memory_int_37 == v_#memory_int_92[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_int_92[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4]]])) && #memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] + 1 <= #StackHeapBarrier) && !(#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] == 0)) && v_ULTIMATE.start_sll_prepend_~head#1.base_16 == v_ULTIMATE.start_sll_prepend_#in~head#1.base_14) && (exists v_#memory_$Pointer$.base_64 : [int,int]int :: v_#memory_$Pointer$.base_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.base_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := 0][0 := v_#memory_$Pointer$.base_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][0]]] == v_#memory_$Pointer$.base_68)) && (exists v_#memory_$Pointer$.offset_67 : [int,int]int :: v_#memory_$Pointer$.offset_67[#res!base := v_#memory_$Pointer$.offset_67[#res!base][4 := 0]][~#s~0!base][0] == 0)) && v_ULTIMATE.start_sll_prepend_#in~head#1.base_14 == ~#s~0!base) && (exists v_#memory_$Pointer$.offset_64 : [int,int]int :: v_#memory_$Pointer$.offset_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.offset_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := 0][0 := v_#memory_$Pointer$.offset_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][0]]] == v_#memory_$Pointer$.offset_68)) && (exists v_#length_34 : [int]int :: v_#length_34[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := 8] == #length)) && (exists v_old(#memory_$Pointer$.base)_AFTER_CALL_23 : [int,int]int, v_#memory_$Pointer$.base_67 : [int,int]int :: v_old_#memory_$Pointer$.base__AFTER_CALL_23[~#s~0!base][0] == #res!base && v_old_#memory_$Pointer$.base__AFTER_CALL_23 == v_#memory_$Pointer$.base_67[#res!base := v_#memory_$Pointer$.base_67[#res!base][4 := v_old_#memory_$Pointer$.base__AFTER_CALL_23[#res!base][4]]])))) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.offset_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := v_#memory_$Pointer$.offset_68[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]]][v_ULTIMATE.start_sll_prepend_~head#1.base_16 := v_#memory_$Pointer$.offset_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.offset_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := 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]]) && #memory_$Pointer$.base == v_#memory_$Pointer$.base_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.base_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := v_#memory_$Pointer$.base_68[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]]][v_ULTIMATE.start_sll_prepend_~head#1.base_16 := v_#memory_$Pointer$.base_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.base_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := 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 := #memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]]]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_sll_prepend_#in~head#1.base_14 : int, v_#memory_int_96 : [int,int]int, v_ULTIMATE.start_sll_prepend_~head#1.base_16 : int, v_#memory_$Pointer$.offset_68 : [int,int]int, v_#memory_int_25 : [int,int]int, v_#memory_$Pointer$.base_68 : [int,int]int :: (((#memory_int == v_#memory_int_25[v_ULTIMATE.start_sll_prepend_~head#1.base_16 := v_#memory_int_25[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0 := #memory_int[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]]] && v_#memory_int_25 == v_#memory_int_96[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_int_96[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := v_#memory_int_25[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4]]]) && (((((((((((((exists v_#valid_46 : [int]int :: v_#valid_46[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := 1] == #valid && v_#valid_46[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]] == 0) && (exists v_#memory_int_95 : [int,int]int, v_old(#memory_int)_AFTER_CALL_24 : [int,int]int :: v_old_#memory_int__AFTER_CALL_24 == v_#memory_int_95[#res!base := v_#memory_int_95[#res!base][4 := v_old_#memory_int__AFTER_CALL_24[#res!base][4]]])) && (exists v_#memory_int_37 : [int,int]int, v_#memory_int_92 : [int,int]int :: v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][0 := 1]] == v_#memory_int_96 && v_#memory_int_37 == v_#memory_int_92[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_int_92[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4]]])) && #memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] + 1 <= #StackHeapBarrier) && !(#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] == 0)) && v_ULTIMATE.start_sll_prepend_~head#1.base_16 == v_ULTIMATE.start_sll_prepend_#in~head#1.base_14) && (exists v_old(#memory_$Pointer$.base)_AFTER_CALL_24 : [int,int]int, v_#memory_$Pointer$.base_67 : [int,int]int :: v_old_#memory_$Pointer$.base__AFTER_CALL_24 == v_#memory_$Pointer$.base_67[#res!base := v_#memory_$Pointer$.base_67[#res!base][4 := v_old_#memory_$Pointer$.base__AFTER_CALL_24[#res!base][4]]] && v_old_#memory_$Pointer$.base__AFTER_CALL_24[~#s~0!base][0] == #res!base)) && (exists v_#memory_$Pointer$.base_64 : [int,int]int :: v_#memory_$Pointer$.base_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.base_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := 0][0 := v_#memory_$Pointer$.base_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][0]]] == v_#memory_$Pointer$.base_68)) && (exists v_#memory_$Pointer$.offset_67 : [int,int]int :: v_#memory_$Pointer$.offset_67[#res!base := v_#memory_$Pointer$.offset_67[#res!base][4 := 0]][~#s~0!base][0] == 0)) && v_ULTIMATE.start_sll_prepend_#in~head#1.base_14 == ~#s~0!base) && (exists v_#memory_$Pointer$.offset_64 : [int,int]int :: v_#memory_$Pointer$.offset_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.offset_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := 0][0 := v_#memory_$Pointer$.offset_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][0]]] == v_#memory_$Pointer$.offset_68)) && (exists v_#length_34 : [int]int :: v_#length_34[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := 8] == #length)) || ((((((((((((exists v_#valid_46 : [int]int :: v_#valid_46[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := 1] == #valid && v_#valid_46[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]] == 0) && (exists v_#memory_int_95 : [int,int]int, v_old(#memory_int)_AFTER_CALL_23 : [int,int]int :: v_old_#memory_int__AFTER_CALL_23 == v_#memory_int_95[#res!base := v_#memory_int_95[#res!base][4 := v_old_#memory_int__AFTER_CALL_23[#res!base][4]]])) && (exists v_#memory_int_37 : [int,int]int, v_#memory_int_92 : [int,int]int :: v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][0 := 1]] == v_#memory_int_96 && v_#memory_int_37 == v_#memory_int_92[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_int_92[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := v_#memory_int_37[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4]]])) && #memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] + 1 <= #StackHeapBarrier) && !(#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] == 0)) && v_ULTIMATE.start_sll_prepend_~head#1.base_16 == v_ULTIMATE.start_sll_prepend_#in~head#1.base_14) && (exists v_#memory_$Pointer$.base_64 : [int,int]int :: v_#memory_$Pointer$.base_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.base_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := 0][0 := v_#memory_$Pointer$.base_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][0]]] == v_#memory_$Pointer$.base_68)) && (exists v_#memory_$Pointer$.offset_67 : [int,int]int :: v_#memory_$Pointer$.offset_67[#res!base := v_#memory_$Pointer$.offset_67[#res!base][4 := 0]][~#s~0!base][0] == 0)) && v_ULTIMATE.start_sll_prepend_#in~head#1.base_14 == ~#s~0!base) && (exists v_#memory_$Pointer$.offset_64 : [int,int]int :: v_#memory_$Pointer$.offset_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.offset_64[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := 0][0 := v_#memory_$Pointer$.offset_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][0]]] == v_#memory_$Pointer$.offset_68)) && (exists v_#length_34 : [int]int :: v_#length_34[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := 8] == #length)) && (exists v_old(#memory_$Pointer$.base)_AFTER_CALL_23 : [int,int]int, v_#memory_$Pointer$.base_67 : [int,int]int :: v_old_#memory_$Pointer$.base__AFTER_CALL_23[~#s~0!base][0] == #res!base && v_old_#memory_$Pointer$.base__AFTER_CALL_23 == v_#memory_$Pointer$.base_67[#res!base := v_#memory_$Pointer$.base_67[#res!base][4 := v_old_#memory_$Pointer$.base__AFTER_CALL_23[#res!base][4]]])))) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.offset_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := v_#memory_$Pointer$.offset_68[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]]][v_ULTIMATE.start_sll_prepend_~head#1.base_16 := v_#memory_$Pointer$.offset_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.offset_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := 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]]) && #memory_$Pointer$.base == v_#memory_$Pointer$.base_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.base_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := v_#memory_$Pointer$.base_68[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]]][v_ULTIMATE.start_sll_prepend_~head#1.base_16 := v_#memory_$Pointer$.base_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0] := v_#memory_$Pointer$.base_68[#memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]][4 := 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 := #memory_$Pointer$.base[v_ULTIMATE.start_sll_prepend_~head#1.base_16][0]]]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_main_~#s~0#1.offset : int, ULTIMATE.start_main_~#s~0#1.base : int :: (((((((((~ptr~0!base == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4]][4] && 2 + #memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset] <= ULTIMATE.start_main_~#s~0#1.base) && #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4]][4]][4] == 0) && 2 + #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4]][4] <= ULTIMATE.start_main_~#s~0#1.base) && #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4]][4]][4] == 0) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4]][4] == #memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset])) && #memory_$Pointer$.offset[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset] == 0) && #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4]][4] == 0) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4] == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4]][4])) && 2 + #memory_$Pointer$.base[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4] <= ULTIMATE.start_main_~#s~0#1.base) && #memory_$Pointer$.offset[#memory_$Pointer$.base[ULTIMATE.start_main_~#s~0#1.base][ULTIMATE.start_main_~#s~0#1.offset]][4] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression * 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: 585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 617]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 617]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 619]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 619]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 191.0s, OverallIterations: 12, TraceHistogramMax: 24, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 51.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 54.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 385 SdHoareTripleChecker+Valid, 15.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 384 mSDsluCounter, 791 SdHoareTripleChecker+Invalid, 14.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 659 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1661 IncrementalHoareTripleChecker+Invalid, 1684 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 132 mSDtfsCounter, 1661 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1286 GetRequests, 911 SyntacticMatches, 14 SemanticMatches, 361 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6910 ImplicationChecksByTransitivity, 98.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=11, InterpolantAutomatonStates: 204, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 12 PreInvPairs, 23 NumberOfFragments, 4085 HoareAnnotationTreeSize, 12 FomulaSimplifications, 1115 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 1564 FormulaSimplificationTreeSizeReductionInter, 54.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 984 NumberOfCodeBlocks, 940 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1160 ConstructedInterpolants, 9 QuantifiedInterpolants, 4413 SizeOfPredicates, 66 NumberOfNonLiveVariables, 3842 ConjunctsInSsa, 221 ConjunctsInUnsatCore, 28 InterpolantComputations, 5 PerfectInterpolantSequences, 3509/5360 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: OVERALL_TIME: 3.9s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 4, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 37, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 57, TOOLS_POST_TIME: 1.9s, TOOLS_POST_CALL_APPLICATIONS: 20, TOOLS_POST_CALL_TIME: 0.4s, TOOLS_POST_RETURN_APPLICATIONS: 16, TOOLS_POST_RETURN_TIME: 0.8s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 93, TOOLS_QUANTIFIERELIM_TIME: 3.1s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.2s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 131, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 22, DOMAIN_JOIN_TIME: 0.4s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 3, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 6, DOMAIN_ISSUBSETEQ_TIME: 0.1s, DOMAIN_ISBOTTOM_APPLICATIONS: 37, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 3, LOOP_SUMMARIZER_CACHE_MISSES: 3, LOOP_SUMMARIZER_OVERALL_TIME: 1.9s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 1.9s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 6, CALL_SUMMARIZER_APPLICATIONS: 16, CALL_SUMMARIZER_CACHE_MISSES: 2, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 542, DAG_COMPRESSION_RETAINED_NODES: 110, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 585]: Loop Invariant Derived loop invariant: ((((((((2 == len) && (2 == \old(len))) && (data == 1)) && (len == 2)) && (data == 1)) && (\old(data) == 1)) || ((((((2 == \old(len)) && (data == 1)) && (len == 0)) && (len == 2)) && (data == 1)) && (\old(data) == 1))) || ((((((len == 1) && (2 == \old(len))) && (data == 1)) && (len == 2)) && (data == 1)) && (\old(data) == 1))) - InvariantResult [Line: 611]: Loop Invariant Derived loop invariant: ((((((count == 0) && (data == 1)) && (len == 2)) || ((((count == 0) && (data == 1)) && (len == 2)) || (((count == 1) && (data == 1)) && (len == 2)))) || ((count <= 2) && ((((count == 0) && (data == 1)) && (len == 2)) || (((1 <= count) && (data == 1)) && (len == 2))))) || (((count <= 3) && (0 < count)) && ((((count == 0) && (data == 1)) && (len == 2)) || (((1 <= count) && (data == 1)) && (len == 2))))) RESULT: Ultimate proved your program to be correct! [2023-12-02 19:24:45,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342dde8c-485a-4083-b5f5-9e7fc0b8ef3c/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE