./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all.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_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/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_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/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_f033110a-e349-4c27-ad77-f0a6c6aea767/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 1fd0aba5d9be2820550e57012fb4e12f76fe291bb253443319d08539e5b2ba1a --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 15:37:55,812 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 15:37:55,875 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Overflow-32bit-Taipan_Default.epf [2023-12-02 15:37:55,879 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 15:37:55,880 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 15:37:55,903 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 15:37:55,904 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 15:37:55,904 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 15:37:55,905 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 15:37:55,906 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 15:37:55,906 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 15:37:55,907 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 15:37:55,907 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 15:37:55,908 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 15:37:55,908 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 15:37:55,909 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 15:37:55,909 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 15:37:55,910 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 15:37:55,910 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 15:37:55,911 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 15:37:55,911 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 15:37:55,912 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 15:37:55,913 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 15:37:55,913 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 15:37:55,914 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 15:37:55,914 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 15:37:55,915 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 15:37:55,915 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 15:37:55,915 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 15:37:55,916 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 15:37:55,916 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 15:37:55,916 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-12-02 15:37:55,917 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 15:37:55,917 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 15:37:55,917 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 15:37:55,917 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 15:37:55,918 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 15:37:55,918 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 15:37:55,918 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 15:37:55,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:37:55,918 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 15:37:55,919 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 15:37:55,919 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 15:37:55,919 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 15:37:55,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 15:37:55,919 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 15:37:55,920 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 15:37:55,920 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 15:37:55,920 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 15:37:55,920 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_f033110a-e349-4c27-ad77-f0a6c6aea767/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_f033110a-e349-4c27-ad77-f0a6c6aea767/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 -> 1fd0aba5d9be2820550e57012fb4e12f76fe291bb253443319d08539e5b2ba1a [2023-12-02 15:37:56,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 15:37:56,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 15:37:56,167 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 15:37:56,168 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 15:37:56,168 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 15:37:56,170 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/list-simple/sll2n_update_all.i [2023-12-02 15:37:58,920 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 15:37:59,153 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 15:37:59,154 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/sv-benchmarks/c/list-simple/sll2n_update_all.i [2023-12-02 15:37:59,167 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/data/2051eca0c/cf84160a72664e3c9c254e86ce678337/FLAG7ad2ad7a2 [2023-12-02 15:37:59,178 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/data/2051eca0c/cf84160a72664e3c9c254e86ce678337 [2023-12-02 15:37:59,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 15:37:59,181 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 15:37:59,182 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 15:37:59,182 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 15:37:59,187 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 15:37:59,187 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:37:59" (1/1) ... [2023-12-02 15:37:59,188 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@794fbfb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:37:59, skipping insertion in model container [2023-12-02 15:37:59,189 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:37:59" (1/1) ... [2023-12-02 15:37:59,234 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 15:37:59,495 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:37:59,504 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 15:37:59,540 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:37:59,570 INFO L206 MainTranslator]: Completed translation [2023-12-02 15:37:59,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:37:59 WrapperNode [2023-12-02 15:37:59,570 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 15:37:59,571 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 15:37:59,571 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 15:37:59,572 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 15:37:59,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:37:59" (1/1) ... [2023-12-02 15:37:59,592 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:37:59" (1/1) ... [2023-12-02 15:37:59,618 INFO L138 Inliner]: procedures = 126, calls = 23, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 138 [2023-12-02 15:37:59,619 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 15:37:59,619 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 15:37:59,620 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 15:37:59,620 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 15:37:59,630 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:37:59" (1/1) ... [2023-12-02 15:37:59,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:37:59" (1/1) ... [2023-12-02 15:37:59,634 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:37:59" (1/1) ... [2023-12-02 15:37:59,634 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:37:59" (1/1) ... [2023-12-02 15:37:59,642 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:37:59" (1/1) ... [2023-12-02 15:37:59,646 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:37:59" (1/1) ... [2023-12-02 15:37:59,648 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:37:59" (1/1) ... [2023-12-02 15:37:59,650 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:37:59" (1/1) ... [2023-12-02 15:37:59,653 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 15:37:59,654 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 15:37:59,655 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 15:37:59,655 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 15:37:59,656 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:37:59" (1/1) ... [2023-12-02 15:37:59,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:37:59,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:37:59,685 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 15:37:59,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 15:37:59,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 15:37:59,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 15:37:59,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 15:37:59,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 15:37:59,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 15:37:59,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 15:37:59,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 15:37:59,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 15:37:59,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 15:37:59,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 15:37:59,819 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 15:37:59,820 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 15:38:00,005 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 15:38:00,067 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 15:38:00,067 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-12-02 15:38:00,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:38:00 BoogieIcfgContainer [2023-12-02 15:38:00,069 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 15:38:00,072 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 15:38:00,072 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 15:38:00,074 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 15:38:00,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:37:59" (1/3) ... [2023-12-02 15:38:00,075 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1da92eba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:38:00, skipping insertion in model container [2023-12-02 15:38:00,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:37:59" (2/3) ... [2023-12-02 15:38:00,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1da92eba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:38:00, skipping insertion in model container [2023-12-02 15:38:00,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:38:00" (3/3) ... [2023-12-02 15:38:00,078 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all.i [2023-12-02 15:38:00,092 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 15:38:00,093 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2023-12-02 15:38:00,133 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 15:38:00,138 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;@5c754347, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 15:38:00,138 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2023-12-02 15:38:00,142 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 25 states have (on average 1.88) internal successors, (47), 39 states have internal predecessors, (47), 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 15:38:00,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-02 15:38:00,147 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:38:00,147 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-02 15:38:00,148 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 15:38:00,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:38:00,151 INFO L85 PathProgramCache]: Analyzing trace with hash 5636585, now seen corresponding path program 1 times [2023-12-02 15:38:00,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:38:00,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023837850] [2023-12-02 15:38:00,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:38:00,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:38:00,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:38:00,402 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 15:38:00,402 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:38:00,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023837850] [2023-12-02 15:38:00,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023837850] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:38:00,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:38:00,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 15:38:00,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956762764] [2023-12-02 15:38:00,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:38:00,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:38:00,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:38:00,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:38:00,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:38:00,440 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.88) internal successors, (47), 39 states have internal predecessors, (47), 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) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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 15:38:00,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:38:00,498 INFO L93 Difference]: Finished difference Result 79 states and 93 transitions. [2023-12-02 15:38:00,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:38:00,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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) Word has length 4 [2023-12-02 15:38:00,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:38:00,508 INFO L225 Difference]: With dead ends: 79 [2023-12-02 15:38:00,508 INFO L226 Difference]: Without dead ends: 42 [2023-12-02 15:38:00,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:38:00,515 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 7 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:38:00,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 69 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:38:00,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-02 15:38:00,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2023-12-02 15:38:00,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 36 states have internal predecessors, (41), 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 15:38:00,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2023-12-02 15:38:00,549 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 4 [2023-12-02 15:38:00,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:38:00,549 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2023-12-02 15:38:00,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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 15:38:00,550 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2023-12-02 15:38:00,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-02 15:38:00,550 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:38:00,550 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-02 15:38:00,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 15:38:00,551 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 15:38:00,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:38:00,551 INFO L85 PathProgramCache]: Analyzing trace with hash 5495951, now seen corresponding path program 1 times [2023-12-02 15:38:00,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:38:00,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152286460] [2023-12-02 15:38:00,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:38:00,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:38:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:38:00,679 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 15:38:00,680 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:38:00,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152286460] [2023-12-02 15:38:00,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152286460] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:38:00,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:38:00,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 15:38:00,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530266274] [2023-12-02 15:38:00,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:38:00,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:38:00,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:38:00,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:38:00,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:38:00,683 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 15:38:00,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:38:00,743 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2023-12-02 15:38:00,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:38:00,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Word has length 4 [2023-12-02 15:38:00,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:38:00,744 INFO L225 Difference]: With dead ends: 42 [2023-12-02 15:38:00,745 INFO L226 Difference]: Without dead ends: 40 [2023-12-02 15:38:00,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 15:38:00,747 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 3 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:38:00,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 89 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:38:00,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-12-02 15:38:00,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2023-12-02 15:38:00,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 39 states have internal predecessors, (44), 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 15:38:00,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2023-12-02 15:38:00,753 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 4 [2023-12-02 15:38:00,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:38:00,754 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2023-12-02 15:38:00,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 15:38:00,754 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2023-12-02 15:38:00,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 15:38:00,754 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:38:00,755 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:38:00,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 15:38:00,755 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 15:38:00,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:38:00,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1023327273, now seen corresponding path program 1 times [2023-12-02 15:38:00,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:38:00,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915879461] [2023-12-02 15:38:00,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:38:00,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:38:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:38:00,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:38:00,864 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:38:00,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915879461] [2023-12-02 15:38:00,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915879461] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:38:00,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275350863] [2023-12-02 15:38:00,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:38:00,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:38:00,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:38:00,867 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:38:00,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 15:38:00,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:38:00,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 15:38:00,977 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:38:01,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:38:01,027 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:38:01,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:38:01,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275350863] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:38:01,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1722551928] [2023-12-02 15:38:01,074 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2023-12-02 15:38:01,075 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:38:01,078 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:38:01,083 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:38:01,084 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:38:02,807 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:38:13,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1722551928] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:38:13,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:38:13,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 4, 4] total 11 [2023-12-02 15:38:13,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978144924] [2023-12-02 15:38:13,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:38:13,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 15:38:13,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:38:13,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 15:38:13,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=102, Unknown=1, NotChecked=0, Total=132 [2023-12-02 15:38:13,270 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 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 15:38:15,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:38:15,540 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2023-12-02 15:38:15,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 15:38:15,541 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 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) Word has length 8 [2023-12-02 15:38:15,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:38:15,542 INFO L225 Difference]: With dead ends: 65 [2023-12-02 15:38:15,542 INFO L226 Difference]: Without dead ends: 46 [2023-12-02 15:38:15,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=29, Invalid=102, Unknown=1, NotChecked=0, Total=132 [2023-12-02 15:38:15,543 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 7 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-02 15:38:15,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 102 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-02 15:38:15,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-02 15:38:15,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38. [2023-12-02 15:38:15,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 37 states have internal predecessors, (42), 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 15:38:15,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2023-12-02 15:38:15,552 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 8 [2023-12-02 15:38:15,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:38:15,552 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2023-12-02 15:38:15,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 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 15:38:15,553 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2023-12-02 15:38:15,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 15:38:15,553 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:38:15,553 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:38:15,559 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 15:38:15,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:38:15,754 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 15:38:15,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:38:15,754 INFO L85 PathProgramCache]: Analyzing trace with hash -264849163, now seen corresponding path program 1 times [2023-12-02 15:38:15,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:38:15,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174427769] [2023-12-02 15:38:15,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:38:15,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:38:15,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:38:15,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:38:15,840 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:38:15,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174427769] [2023-12-02 15:38:15,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174427769] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:38:15,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782668461] [2023-12-02 15:38:15,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:38:15,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:38:15,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:38:15,841 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:38:15,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 15:38:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:38:15,926 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 15:38:15,928 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:38:15,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:38:15,950 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:38:15,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:38:15,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782668461] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:38:15,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1875067331] [2023-12-02 15:38:15,976 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2023-12-02 15:38:15,976 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:38:15,977 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:38:15,977 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:38:15,977 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:38:19,947 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:38:33,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1875067331] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:38:33,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:38:33,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 4, 4] total 12 [2023-12-02 15:38:33,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395367142] [2023-12-02 15:38:33,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:38:33,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 15:38:33,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:38:33,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 15:38:33,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=123, Unknown=2, NotChecked=0, Total=156 [2023-12-02 15:38:33,424 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 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 15:38:37,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:38:37,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:38:37,698 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2023-12-02 15:38:37,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 15:38:37,698 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 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) Word has length 11 [2023-12-02 15:38:37,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:38:37,699 INFO L225 Difference]: With dead ends: 68 [2023-12-02 15:38:37,699 INFO L226 Difference]: Without dead ends: 39 [2023-12-02 15:38:37,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=31, Invalid=123, Unknown=2, NotChecked=0, Total=156 [2023-12-02 15:38:37,700 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-12-02 15:38:37,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 100 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2023-12-02 15:38:37,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-02 15:38:37,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-12-02 15:38:37,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 38 states have internal predecessors, (43), 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 15:38:37,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2023-12-02 15:38:37,710 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 11 [2023-12-02 15:38:37,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:38:37,711 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2023-12-02 15:38:37,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 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 15:38:37,711 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2023-12-02 15:38:37,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 15:38:37,711 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:38:37,712 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:38:37,716 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 15:38:37,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:38:37,912 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 15:38:37,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:38:37,913 INFO L85 PathProgramCache]: Analyzing trace with hash -264845493, now seen corresponding path program 1 times [2023-12-02 15:38:37,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:38:37,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961446260] [2023-12-02 15:38:37,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:38:37,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:38:37,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:38:37,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:38:37,981 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:38:37,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961446260] [2023-12-02 15:38:37,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961446260] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:38:37,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096218678] [2023-12-02 15:38:37,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:38:37,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:38:37,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:38:37,983 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:38:37,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 15:38:38,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:38:38,077 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 15:38:38,078 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:38:38,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:38:38,096 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:38:38,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:38:38,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096218678] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:38:38,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [541420468] [2023-12-02 15:38:38,121 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2023-12-02 15:38:38,121 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:38:38,122 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:38:38,122 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:38:38,122 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:38:42,610 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:38:42,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [541420468] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:38:42,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:38:42,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4, 4, 4] total 12 [2023-12-02 15:38:42,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348641036] [2023-12-02 15:38:42,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:38:42,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 15:38:42,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:38:42,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 15:38:42,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-12-02 15:38:42,995 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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 15:38:43,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:38:43,153 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2023-12-02 15:38:43,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 15:38:43,154 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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) Word has length 11 [2023-12-02 15:38:43,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:38:43,155 INFO L225 Difference]: With dead ends: 43 [2023-12-02 15:38:43,155 INFO L226 Difference]: Without dead ends: 41 [2023-12-02 15:38:43,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-12-02 15:38:43,156 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:38:43,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 95 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:38:43,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-02 15:38:43,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-12-02 15:38:43,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 40 states have internal predecessors, (45), 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 15:38:43,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2023-12-02 15:38:43,169 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 11 [2023-12-02 15:38:43,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:38:43,170 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2023-12-02 15:38:43,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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 15:38:43,170 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2023-12-02 15:38:43,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-02 15:38:43,170 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:38:43,171 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:38:43,175 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 15:38:43,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:38:43,371 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 15:38:43,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:38:43,372 INFO L85 PathProgramCache]: Analyzing trace with hash -157061830, now seen corresponding path program 1 times [2023-12-02 15:38:43,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:38:43,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675365103] [2023-12-02 15:38:43,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:38:43,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:38:43,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:38:43,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 15:38:43,433 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:38:43,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675365103] [2023-12-02 15:38:43,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675365103] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:38:43,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528519647] [2023-12-02 15:38:43,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:38:43,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:38:43,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:38:43,435 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:38:43,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 15:38:43,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:38:43,517 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 15:38:43,518 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:38:43,535 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 15:38:43,535 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:38:43,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 15:38:43,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528519647] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:38:43,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [909122045] [2023-12-02 15:38:43,557 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2023-12-02 15:38:43,557 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:38:43,557 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:38:43,557 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:38:43,557 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:38:48,089 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:38:48,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [909122045] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:38:48,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:38:48,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 4, 4] total 13 [2023-12-02 15:38:48,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34561279] [2023-12-02 15:38:48,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:38:48,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 15:38:48,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:38:48,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 15:38:48,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-12-02 15:38:48,763 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 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 15:38:48,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:38:48,893 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2023-12-02 15:38:48,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 15:38:48,894 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 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) Word has length 14 [2023-12-02 15:38:48,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:38:48,895 INFO L225 Difference]: With dead ends: 75 [2023-12-02 15:38:48,895 INFO L226 Difference]: Without dead ends: 56 [2023-12-02 15:38:48,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-12-02 15:38:48,896 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 11 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:38:48,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 69 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:38:48,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-02 15:38:48,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 45. [2023-12-02 15:38:48,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 44 states have internal predecessors, (50), 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 15:38:48,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2023-12-02 15:38:48,910 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 14 [2023-12-02 15:38:48,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:38:48,910 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2023-12-02 15:38:48,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 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 15:38:48,910 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2023-12-02 15:38:48,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 15:38:48,910 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:38:48,910 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:38:48,914 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 15:38:49,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:38:49,111 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 15:38:49,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:38:49,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1809518414, now seen corresponding path program 1 times [2023-12-02 15:38:49,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:38:49,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329451923] [2023-12-02 15:38:49,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:38:49,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:38:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:38:49,169 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 15:38:49,169 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:38:49,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329451923] [2023-12-02 15:38:49,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329451923] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:38:49,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663154728] [2023-12-02 15:38:49,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:38:49,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:38:49,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:38:49,171 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:38:49,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 15:38:49,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:38:49,260 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 15:38:49,262 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:38:49,279 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 15:38:49,279 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:38:49,299 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 15:38:49,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663154728] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:38:49,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1269385931] [2023-12-02 15:38:49,301 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2023-12-02 15:38:49,301 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:38:49,302 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:38:49,302 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:38:49,302 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:38:51,135 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:39:17,179 WARN L293 SmtUtils]: Spent 5.49s on a formula simplification. DAG size of input: 247 DAG size of output: 244 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 15:39:26,755 WARN L293 SmtUtils]: Spent 7.31s on a formula simplification. DAG size of input: 270 DAG size of output: 265 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 15:39:40,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1269385931] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:39:40,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:39:40,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [4, 4, 4] total 15 [2023-12-02 15:39:40,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473201761] [2023-12-02 15:39:40,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:39:40,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 15:39:40,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:39:40,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 15:39:40,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=196, Unknown=7, NotChecked=0, Total=240 [2023-12-02 15:39:40,861 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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 15:39:45,080 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 15:39:48,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:39:55,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:39:57,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:40:01,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:40:04,582 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 15:40:06,681 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 15:40:12,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:40:16,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:40:16,873 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2023-12-02 15:40:16,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 15:40:16,873 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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) Word has length 17 [2023-12-02 15:40:16,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:40:16,874 INFO L225 Difference]: With dead ends: 49 [2023-12-02 15:40:16,874 INFO L226 Difference]: Without dead ends: 47 [2023-12-02 15:40:16,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 49.7s TimeCoverageRelationStatistics Valid=37, Invalid=196, Unknown=7, NotChecked=0, Total=240 [2023-12-02 15:40:16,875 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 3 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:40:16,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 121 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 266 Invalid, 7 Unknown, 0 Unchecked, 36.0s Time] [2023-12-02 15:40:16,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-02 15:40:16,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-12-02 15:40:16,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 46 states have internal predecessors, (52), 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 15:40:16,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2023-12-02 15:40:16,889 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 17 [2023-12-02 15:40:16,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:40:16,889 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2023-12-02 15:40:16,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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 15:40:16,890 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2023-12-02 15:40:16,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 15:40:16,890 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:40:16,890 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:40:16,895 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-02 15:40:17,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:40:17,091 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 15:40:17,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:40:17,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1228453113, now seen corresponding path program 1 times [2023-12-02 15:40:17,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:40:17,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122408303] [2023-12-02 15:40:17,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:40:17,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:40:17,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:40:17,163 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 15:40:17,163 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:40:17,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122408303] [2023-12-02 15:40:17,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122408303] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:40:17,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540980477] [2023-12-02 15:40:17,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:40:17,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:40:17,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:40:17,165 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:40:17,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 15:40:17,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:40:17,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 15:40:17,251 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:40:17,264 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 15:40:17,265 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:40:17,281 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 15:40:17,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540980477] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:40:17,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1108965790] [2023-12-02 15:40:17,283 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-12-02 15:40:17,283 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:40:17,284 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:40:17,284 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:40:17,284 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:40:22,130 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:40:23,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1108965790] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:40:23,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:40:23,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4, 4, 4] total 14 [2023-12-02 15:40:23,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815415241] [2023-12-02 15:40:23,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:40:23,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 15:40:23,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:40:23,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 15:40:23,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2023-12-02 15:40:23,439 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 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 15:40:23,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:40:23,984 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2023-12-02 15:40:23,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 15:40:23,984 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 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) Word has length 20 [2023-12-02 15:40:23,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:40:23,985 INFO L225 Difference]: With dead ends: 62 [2023-12-02 15:40:23,985 INFO L226 Difference]: Without dead ends: 54 [2023-12-02 15:40:23,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 8 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2023-12-02 15:40:23,986 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 26 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 15:40:23,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 62 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 15:40:23,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-12-02 15:40:24,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 42. [2023-12-02 15:40:24,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 41 states have internal predecessors, (47), 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 15:40:24,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2023-12-02 15:40:24,001 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 20 [2023-12-02 15:40:24,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:40:24,001 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2023-12-02 15:40:24,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 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 15:40:24,001 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2023-12-02 15:40:24,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 15:40:24,002 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:40:24,002 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:40:24,008 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 15:40:24,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:40:24,203 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 15:40:24,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:40:24,203 INFO L85 PathProgramCache]: Analyzing trace with hash 867992441, now seen corresponding path program 1 times [2023-12-02 15:40:24,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:40:24,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686308106] [2023-12-02 15:40:24,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:40:24,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:40:24,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:40:24,285 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 15:40:24,285 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:40:24,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686308106] [2023-12-02 15:40:24,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686308106] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:40:24,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645080576] [2023-12-02 15:40:24,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:40:24,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:40:24,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:40:24,287 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:40:24,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 15:40:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:40:24,397 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 15:40:24,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:40:24,416 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 15:40:24,416 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:40:24,436 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 15:40:24,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645080576] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:40:24,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [334573754] [2023-12-02 15:40:24,439 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-12-02 15:40:24,439 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:40:24,439 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:40:24,439 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:40:24,440 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:40:30,434 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:40:41,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [334573754] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:40:41,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:40:41,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [4, 4, 4] total 17 [2023-12-02 15:40:41,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256583349] [2023-12-02 15:40:41,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:40:41,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-02 15:40:41,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:40:41,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-02 15:40:41,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=254, Unknown=1, NotChecked=0, Total=306 [2023-12-02 15:40:41,921 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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 15:40:44,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:40:44,108 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2023-12-02 15:40:44,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 15:40:44,109 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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) Word has length 27 [2023-12-02 15:40:44,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:40:44,109 INFO L225 Difference]: With dead ends: 66 [2023-12-02 15:40:44,109 INFO L226 Difference]: Without dead ends: 51 [2023-12-02 15:40:44,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 59 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=63, Invalid=316, Unknown=1, NotChecked=0, Total=380 [2023-12-02 15:40:44,111 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:40:44,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 75 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-12-02 15:40:44,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-02 15:40:44,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2023-12-02 15:40:44,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 42 states have internal predecessors, (48), 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 15:40:44,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2023-12-02 15:40:44,131 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 27 [2023-12-02 15:40:44,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:40:44,131 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2023-12-02 15:40:44,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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 15:40:44,131 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2023-12-02 15:40:44,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 15:40:44,132 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:40:44,132 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:40:44,137 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 15:40:44,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-12-02 15:40:44,333 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 15:40:44,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:40:44,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1138030889, now seen corresponding path program 1 times [2023-12-02 15:40:44,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:40:44,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23952333] [2023-12-02 15:40:44,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:40:44,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:40:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:40:44,409 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 15:40:44,410 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:40:44,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23952333] [2023-12-02 15:40:44,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23952333] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:40:44,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581654870] [2023-12-02 15:40:44,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:40:44,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:40:44,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:40:44,411 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:40:44,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 15:40:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:40:44,527 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 15:40:44,528 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:40:44,544 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 15:40:44,544 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:40:44,571 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 15:40:44,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581654870] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:40:44,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1829203153] [2023-12-02 15:40:44,574 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-12-02 15:40:44,574 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:40:44,574 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:40:44,574 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:40:44,574 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:40:54,034 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:41:06,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1829203153] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:41:06,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:41:06,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [4, 4, 4] total 19 [2023-12-02 15:41:06,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323325379] [2023-12-02 15:41:06,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:41:06,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-02 15:41:06,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:41:06,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-02 15:41:06,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=319, Unknown=1, NotChecked=0, Total=380 [2023-12-02 15:41:06,215 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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 15:41:09,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:41:09,247 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2023-12-02 15:41:09,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 15:41:09,247 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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) Word has length 28 [2023-12-02 15:41:09,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:41:09,248 INFO L225 Difference]: With dead ends: 66 [2023-12-02 15:41:09,248 INFO L226 Difference]: Without dead ends: 62 [2023-12-02 15:41:09,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 60 SyntacticMatches, 8 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=72, Invalid=389, Unknown=1, NotChecked=0, Total=462 [2023-12-02 15:41:09,249 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 23 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-12-02 15:41:09,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 68 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-12-02 15:41:09,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-02 15:41:09,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 49. [2023-12-02 15:41:09,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 43 states have (on average 1.255813953488372) internal successors, (54), 48 states have internal predecessors, (54), 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 15:41:09,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2023-12-02 15:41:09,275 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 28 [2023-12-02 15:41:09,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:41:09,276 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2023-12-02 15:41:09,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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 15:41:09,276 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2023-12-02 15:41:09,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 15:41:09,277 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:41:09,277 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:41:09,282 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 15:41:09,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-02 15:41:09,478 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 15:41:09,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:41:09,478 INFO L85 PathProgramCache]: Analyzing trace with hash 2065020555, now seen corresponding path program 1 times [2023-12-02 15:41:09,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:41:09,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720765109] [2023-12-02 15:41:09,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:41:09,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:41:09,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:41:09,560 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 15:41:09,561 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:41:09,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720765109] [2023-12-02 15:41:09,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720765109] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:41:09,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653433610] [2023-12-02 15:41:09,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:41:09,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:41:09,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:41:09,562 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:41:09,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 15:41:09,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:41:09,690 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 15:41:09,692 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:41:09,715 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 15:41:09,715 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:41:09,737 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 15:41:09,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653433610] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:41:09,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [622595858] [2023-12-02 15:41:09,739 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-12-02 15:41:09,739 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:41:09,740 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:41:09,740 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:41:09,740 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:41:15,691 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:41:28,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [622595858] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:41:28,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:41:28,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [4, 4, 4] total 20 [2023-12-02 15:41:28,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435359105] [2023-12-02 15:41:28,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:41:28,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-02 15:41:28,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:41:28,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-02 15:41:28,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=358, Unknown=1, NotChecked=0, Total=420 [2023-12-02 15:41:28,248 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 15 states have internal predecessors, (25), 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 15:41:30,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:41:32,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:41:32,024 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2023-12-02 15:41:32,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-02 15:41:32,024 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 15 states have internal predecessors, (25), 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) Word has length 34 [2023-12-02 15:41:32,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:41:32,025 INFO L225 Difference]: With dead ends: 74 [2023-12-02 15:41:32,025 INFO L226 Difference]: Without dead ends: 68 [2023-12-02 15:41:32,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 72 SyntacticMatches, 13 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=78, Invalid=473, Unknown=1, NotChecked=0, Total=552 [2023-12-02 15:41:32,026 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 18 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2023-12-02 15:41:32,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 54 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2023-12-02 15:41:32,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-12-02 15:41:32,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 52. [2023-12-02 15:41:32,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 51 states have internal predecessors, (58), 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 15:41:32,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2023-12-02 15:41:32,051 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 34 [2023-12-02 15:41:32,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:41:32,052 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2023-12-02 15:41:32,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 15 states have internal predecessors, (25), 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 15:41:32,052 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2023-12-02 15:41:32,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 15:41:32,052 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:41:32,053 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:41:32,057 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-02 15:41:32,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-02 15:41:32,253 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 15:41:32,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:41:32,254 INFO L85 PathProgramCache]: Analyzing trace with hash -2084066921, now seen corresponding path program 1 times [2023-12-02 15:41:32,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:41:32,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110963141] [2023-12-02 15:41:32,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:41:32,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:41:32,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:41:32,328 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 15:41:32,328 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:41:32,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110963141] [2023-12-02 15:41:32,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110963141] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:41:32,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201585826] [2023-12-02 15:41:32,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:41:32,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:41:32,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:41:32,330 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:41:32,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-02 15:41:32,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:41:32,467 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 15:41:32,469 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:41:32,486 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 15:41:32,487 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:41:32,504 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 15:41:32,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201585826] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:41:32,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1636327506] [2023-12-02 15:41:32,505 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-12-02 15:41:32,505 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:41:32,506 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:41:32,506 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:41:32,506 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:41:40,083 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:41:50,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1636327506] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:41:50,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:41:50,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [4, 4, 4] total 20 [2023-12-02 15:41:50,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884399009] [2023-12-02 15:41:50,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:41:50,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-02 15:41:50,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:41:50,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-02 15:41:50,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2023-12-02 15:41:50,150 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 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 15:41:52,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:41:52,164 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2023-12-02 15:41:52,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-02 15:41:52,164 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 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) Word has length 37 [2023-12-02 15:41:52,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:41:52,164 INFO L225 Difference]: With dead ends: 55 [2023-12-02 15:41:52,164 INFO L226 Difference]: Without dead ends: 0 [2023-12-02 15:41:52,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 80 SyntacticMatches, 14 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2023-12-02 15:41:52,166 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 6 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-02 15:41:52,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 0 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-02 15:41:52,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-02 15:41:52,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-02 15:41:52,166 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 15:41:52,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-02 15:41:52,167 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2023-12-02 15:41:52,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:41:52,167 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-02 15:41:52,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 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 15:41:52,167 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-02 15:41:52,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-02 15:41:52,169 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2023-12-02 15:41:52,169 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2023-12-02 15:41:52,169 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2023-12-02 15:41:52,169 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2023-12-02 15:41:52,169 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2023-12-02 15:41:52,169 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2023-12-02 15:41:52,169 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2023-12-02 15:41:52,169 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2023-12-02 15:41:52,170 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2023-12-02 15:41:52,170 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2023-12-02 15:41:52,170 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2023-12-02 15:41:52,170 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2023-12-02 15:41:52,170 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2023-12-02 15:41:52,170 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2023-12-02 15:41:52,176 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-02 15:41:52,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-02 15:41:52,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-02 15:45:08,299 WARN L293 SmtUtils]: Spent 3.26m on a formula simplification. DAG size of input: 984 DAG size of output: 971 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-02 15:45:15,428 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 619) no Hoare annotation was computed. [2023-12-02 15:45:15,428 INFO L899 garLoopResultBuilder]: For program point L572(line 572) no Hoare annotation was computed. [2023-12-02 15:45:15,428 INFO L899 garLoopResultBuilder]: For program point L622-3(line 622) no Hoare annotation was computed. [2023-12-02 15:45:15,428 INFO L899 garLoopResultBuilder]: For program point L622-4(line 622) no Hoare annotation was computed. [2023-12-02 15:45:15,428 INFO L895 garLoopResultBuilder]: At program point L622-5(lines 622 627) the Hoare annotation is: (and (<= 1 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~i~0#1| 2) (= |ULTIMATE.start_node_create_#res#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~s~0#1.offset| 0)) [2023-12-02 15:45:15,428 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 613 632) no Hoare annotation was computed. [2023-12-02 15:45:15,429 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 618) no Hoare annotation was computed. [2023-12-02 15:45:15,429 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 585) no Hoare annotation was computed. [2023-12-02 15:45:15,429 INFO L899 garLoopResultBuilder]: For program point L623(line 623) no Hoare annotation was computed. [2023-12-02 15:45:15,429 INFO L899 garLoopResultBuilder]: For program point L623-1(line 623) no Hoare annotation was computed. [2023-12-02 15:45:15,429 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 623) no Hoare annotation was computed. [2023-12-02 15:45:15,429 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 585) no Hoare annotation was computed. [2023-12-02 15:45:15,429 INFO L895 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_main_~i~0#1| 1))) (and (<= 1 |#StackHeapBarrier|) (let ((.cse0 (= |ULTIMATE.start_main_~new_data~0#1| |ULTIMATE.start_sll_update_at_#in~data#1|)) (.cse2 (= |ULTIMATE.start_sll_update_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse3 (= |ULTIMATE.start_sll_update_at_~data#1| |ULTIMATE.start_sll_update_at_#in~data#1|)) (.cse4 (= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~new_data~0#1|)) (.cse5 (= |ULTIMATE.start_sll_update_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|))) (or (and .cse0 (= |ULTIMATE.start_sll_update_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_update_at_#in~head#1.base|) 4)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_update_at_#in~head#1.base|) 4) |ULTIMATE.start_sll_update_at_~head#1.offset|) (exists ((|v_ULTIMATE.start_main_~new_data~0#1_48| Int)) (and .cse1 (= |v_ULTIMATE.start_main_~new_data~0#1_48| 2))) .cse2 (= (+ |ULTIMATE.start_sll_update_at_~index#1| 1) |ULTIMATE.start_sll_update_at_#in~index#1|) .cse3 .cse4 .cse5) (and .cse0 (= |ULTIMATE.start_sll_update_at_~head#1.base| |ULTIMATE.start_sll_update_at_#in~head#1.base|) (= |ULTIMATE.start_sll_update_at_~index#1| |ULTIMATE.start_sll_update_at_#in~index#1|) .cse2 .cse3 (= |ULTIMATE.start_sll_update_at_~head#1.offset| 0) .cse4 .cse5))) (= |ULTIMATE.start_node_create_#res#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~new_data~0#1_24| Int)) (let ((.cse7 (= |ULTIMATE.start_main_~i~0#1| 0))) (and (let ((.cse6 (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|))) (or (and .cse6 (exists ((|v_#memory_$Pointer$.base_96| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_96| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_$Pointer$.base_96| |ULTIMATE.start_main_~s~0#1.base|) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 0))))) (exists ((|v_#memory_int_106| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_106| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_int_106| |ULTIMATE.start_main_~s~0#1.base|) 0 2)))) (exists ((|v_#memory_$Pointer$.offset_96| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_96| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_$Pointer$.offset_96| |ULTIMATE.start_main_~s~0#1.base|) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 0)))))) (and .cse6 .cse7))) (or (and .cse1 (= |v_ULTIMATE.start_main_~new_data~0#1_24| 2)) .cse7)))) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_update_at_#in~head#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~s~0#1.offset| 0))) [2023-12-02 15:45:15,429 INFO L899 garLoopResultBuilder]: For program point L624(lines 624 626) no Hoare annotation was computed. [2023-12-02 15:45:15,430 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 623) no Hoare annotation was computed. [2023-12-02 15:45:15,430 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-02 15:45:15,430 INFO L895 garLoopResultBuilder]: At program point L600-2(lines 600 603) the Hoare annotation is: (and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 0) (<= |ULTIMATE.start_sll_get_data_at_~index#1| 1) (= |ULTIMATE.start_node_create_#res#1.offset| 0) (<= 0 |ULTIMATE.start_sll_get_data_at_~index#1|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |ULTIMATE.start_sll_get_data_at_#in~index#1|) (<= |ULTIMATE.start_sll_get_data_at_#in~index#1| 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0)) [2023-12-02 15:45:15,430 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 602) no Hoare annotation was computed. [2023-12-02 15:45:15,430 INFO L899 garLoopResultBuilder]: For program point L609(line 609) no Hoare annotation was computed. [2023-12-02 15:45:15,430 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2023-12-02 15:45:15,430 INFO L899 garLoopResultBuilder]: For program point L609-1(line 609) no Hoare annotation was computed. [2023-12-02 15:45:15,430 INFO L902 garLoopResultBuilder]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2023-12-02 15:45:15,430 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 602) no Hoare annotation was computed. [2023-12-02 15:45:15,431 INFO L899 garLoopResultBuilder]: For program point L618-3(line 618) no Hoare annotation was computed. [2023-12-02 15:45:15,431 INFO L899 garLoopResultBuilder]: For program point L585-3(line 585) no Hoare annotation was computed. [2023-12-02 15:45:15,431 INFO L899 garLoopResultBuilder]: For program point L618-4(line 618) no Hoare annotation was computed. [2023-12-02 15:45:15,431 INFO L899 garLoopResultBuilder]: For program point L585-4(line 585) no Hoare annotation was computed. [2023-12-02 15:45:15,431 INFO L895 garLoopResultBuilder]: At program point L618-5(lines 618 621) the Hoare annotation is: (and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_node_create_#res#1.offset| 0) (let ((.cse0 (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|))) (or (exists ((|v_ULTIMATE.start_main_~i~0#1_58| Int)) (or (and .cse0 (= 2 |ULTIMATE.start_main_~i~0#1|) (= |v_ULTIMATE.start_main_~i~0#1_58| 1) (= 3 |ULTIMATE.start_main_~new_data~0#1|) (exists ((|v_#memory_$Pointer$.base_97| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_96| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_97| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_96| (Array Int (Array Int Int))) (|v_#memory_int_106| (Array Int (Array Int Int)))) (let ((.cse4 (select |v_#memory_$Pointer$.offset_97| |ULTIMATE.start_main_~s~0#1.base|)) (.cse1 (select |v_#memory_$Pointer$.base_97| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse2 (select .cse1 4)) (.cse3 (select .cse4 4))) (and (= |v_#memory_$Pointer$.base_97| (store |v_#memory_$Pointer$.base_96| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_$Pointer$.base_96| |ULTIMATE.start_main_~s~0#1.base|) 0 (select .cse1 0)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_97| .cse2 (store (select |v_#memory_$Pointer$.offset_97| .cse2) .cse3 (select (select |#memory_$Pointer$.offset| .cse2) .cse3)))) (= (store |v_#memory_$Pointer$.offset_96| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_$Pointer$.offset_96| |ULTIMATE.start_main_~s~0#1.base|) 0 (select .cse4 0))) |v_#memory_$Pointer$.offset_97|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_97| .cse2 (store (select |v_#memory_$Pointer$.base_97| .cse2) .cse3 (select (select |#memory_$Pointer$.base| .cse2) .cse3)))) (= |#memory_int| (let ((.cse5 (store |v_#memory_int_106| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_int_106| |ULTIMATE.start_main_~s~0#1.base|) 0 2)))) (store .cse5 .cse2 (store (select .cse5 .cse2) .cse3 3))))))))) (and .cse0 (= |v_ULTIMATE.start_main_~i~0#1_58| 0) (exists ((|v_#memory_$Pointer$.base_96| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_96| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_$Pointer$.base_96| |ULTIMATE.start_main_~s~0#1.base|) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 0))))) (exists ((|v_#memory_int_106| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_106| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_int_106| |ULTIMATE.start_main_~s~0#1.base|) 0 2)))) (= |ULTIMATE.start_main_~i~0#1| 1) (exists ((|v_#memory_$Pointer$.offset_96| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_96| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_$Pointer$.offset_96| |ULTIMATE.start_main_~s~0#1.base|) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 0))))) (= 2 |ULTIMATE.start_main_~new_data~0#1|)))) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 0)))) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~s~0#1.offset| 0)) [2023-12-02 15:45:15,435 INFO L895 garLoopResultBuilder]: At program point L585-5(lines 585 589) the Hoare annotation is: (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse1 (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse2 (= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse3 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse4 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse5 (= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse7 (= |ULTIMATE.start_sll_create_#in~data#1| 1))) (or (let ((.cse6 (select |#memory_int| 1))) (and (= 2 |ULTIMATE.start_sll_create_~len#1|) .cse0 (= 2 (select |#length| 1)) .cse1 (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) .cse2 (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) .cse3 (= (select |#valid| 0) 0) .cse4 (= (select |#valid| 2) 1) .cse5 (= (select .cse6 0) 48) .cse7 (= (select .cse6 1) 0))) (let ((.cse11 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (let ((.cse8 (not (= .cse11 0))) (.cse19 (= |ULTIMATE.start_sll_create_~len#1| 0)) (.cse25 (<= (+ .cse11 1) |#StackHeapBarrier|)) (.cse24 (select (select |#memory_int| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)) (.cse9 (<= (+ |ULTIMATE.start_node_create_#res#1.base| 1) |#StackHeapBarrier|)) (.cse16 (not (= |ULTIMATE.start_node_create_#res#1.base| 0))) (.cse17 (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse29 (= |ULTIMATE.start_sll_create_~len#1| 1)) (.cse18 (= |ULTIMATE.start_node_create_#res#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|))) (and .cse0 (exists ((|v_ULTIMATE.start_sll_create_~len#1_66| Int)) (or (and .cse8 .cse9 (exists ((|v_#valid_44| (Array Int Int))) (let ((.cse10 (store |v_#valid_44| .cse11 1))) (and (= (store .cse10 |ULTIMATE.start_node_create_#res#1.base| 1) |#valid|) (= (select |v_#valid_44| 2) 1) (= (select |v_#valid_44| .cse11) 0) (= (select |v_#valid_44| 0) 0) (= (select |v_#valid_44| 1) 1) (= (select .cse10 |ULTIMATE.start_node_create_#res#1.base|) 0)))) (exists ((|v_#memory_$Pointer$.base_119| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_117| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_28| (Array Int (Array Int Int)))) (let ((.cse12 (select |v_#memory_$Pointer$.base_119| .cse11))) (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_28| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_28| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 .cse11))) (= (store |v_#memory_$Pointer$.base_117| .cse11 (store (store (select |v_#memory_$Pointer$.base_117| .cse11) 4 0) 0 (select .cse12 0))) |v_#memory_$Pointer$.base_119|) (= (let ((.cse13 (store |v_#memory_$Pointer$.base_119| .cse11 (store .cse12 4 0)))) (store .cse13 |ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse13 |ULTIMATE.start_node_create_#res#1.base|) 4 0) 0 (select (select |v_#memory_$Pointer$.base_28| |ULTIMATE.start_node_create_#res#1.base|) 0)))) |v_#memory_$Pointer$.base_28|)))) (exists ((|v_#length_42| (Array Int Int))) (and (= 19 (select |v_#length_42| 2)) (= (select |v_#length_42| 1) 2) (= |#length| (store (store |v_#length_42| .cse11 8) |ULTIMATE.start_node_create_#res#1.base| 8)))) (exists ((|v_#memory_$Pointer$.offset_117| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_119| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_28| (Array Int (Array Int Int)))) (let ((.cse14 (select |v_#memory_$Pointer$.offset_119| .cse11))) (and (= (store |v_#memory_$Pointer$.offset_117| .cse11 (store (store (select |v_#memory_$Pointer$.offset_117| .cse11) 4 0) 0 (select .cse14 0))) |v_#memory_$Pointer$.offset_119|) (= (let ((.cse15 (store |v_#memory_$Pointer$.offset_119| .cse11 (store .cse14 4 0)))) (store .cse15 |ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse15 |ULTIMATE.start_node_create_#res#1.base|) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_node_create_#res#1.base|) 0)))) |v_#memory_$Pointer$.offset_28|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 0)))))) .cse16 .cse17 .cse18 .cse19 (exists ((|v_#memory_int_129| (Array Int (Array Int Int))) (|v_#memory_int_127| (Array Int (Array Int Int))) (|v_#memory_int_128| (Array Int (Array Int Int))) (|v_#memory_int_36| (Array Int (Array Int Int)))) (let ((.cse20 (select |v_#memory_int_36| |ULTIMATE.start_node_create_#res#1.base|)) (.cse22 (select |v_#memory_int_127| 1)) (.cse21 (select |v_#memory_int_129| .cse11))) (and (= |v_#memory_int_36| (store |v_#memory_int_128| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_int_128| |ULTIMATE.start_node_create_#res#1.base|) 4 (select .cse20 4)))) (= (store |v_#memory_int_129| .cse11 (store (store .cse21 0 1) 4 (select (select |v_#memory_int_128| .cse11) 4))) |v_#memory_int_128|) (= (select .cse22 1) 0) (= |#memory_int| (let ((.cse23 (store |v_#memory_int_36| |ULTIMATE.start_node_create_#res#1.base| (store .cse20 0 1)))) (store .cse23 |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select .cse23 |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 .cse24)))) (= 48 (select .cse22 0)) (= (store |v_#memory_int_127| .cse11 (store (select |v_#memory_int_127| .cse11) 4 (select .cse21 4))) |v_#memory_int_129|)))) (= |v_ULTIMATE.start_sll_create_~len#1_66| 1) .cse25) (and .cse9 (exists ((|v_#valid_44| (Array Int Int))) (and (= (select |v_#valid_44| 2) 1) (= (select |v_#valid_44| 0) 0) (= (select |v_#valid_44| |ULTIMATE.start_node_create_#res#1.base|) 0) (= (select |v_#valid_44| 1) 1) (= (store |v_#valid_44| |ULTIMATE.start_node_create_#res#1.base| 1) |#valid|))) (exists ((|v_#memory_int_127| (Array Int (Array Int Int))) (|v_#memory_int_36| (Array Int (Array Int Int)))) (let ((.cse26 (select |v_#memory_int_36| |ULTIMATE.start_node_create_#res#1.base|)) (.cse27 (select |v_#memory_int_127| 1))) (and (= (store |v_#memory_int_127| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_int_127| |ULTIMATE.start_node_create_#res#1.base|) 4 (select .cse26 4))) |v_#memory_int_36|) (= (select .cse27 1) 0) (= |#memory_int| (let ((.cse28 (store |v_#memory_int_36| |ULTIMATE.start_node_create_#res#1.base| (store .cse26 0 1)))) (store .cse28 |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select .cse28 |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 .cse24)))) (= 48 (select .cse27 0))))) (exists ((|v_#memory_$Pointer$.offset_117| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_28| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.offset_28| (store |v_#memory_$Pointer$.offset_117| |ULTIMATE.start_node_create_#res#1.base| (store (store (select |v_#memory_$Pointer$.offset_117| |ULTIMATE.start_node_create_#res#1.base|) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_node_create_#res#1.base|) 0)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 0))))) .cse16 .cse17 .cse29 .cse18 (= 2 |v_ULTIMATE.start_sll_create_~len#1_66|) (exists ((|v_#length_42| (Array Int Int))) (and (= 19 (select |v_#length_42| 2)) (= (select |v_#length_42| 1) 2) (= (store |v_#length_42| |ULTIMATE.start_node_create_#res#1.base| 8) |#length|))) (exists ((|v_#memory_$Pointer$.base_117| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_28| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_28| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_28| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 0))) (= (store |v_#memory_$Pointer$.base_117| |ULTIMATE.start_node_create_#res#1.base| (store (store (select |v_#memory_$Pointer$.base_117| |ULTIMATE.start_node_create_#res#1.base|) 4 0) 0 (select (select |v_#memory_$Pointer$.base_28| |ULTIMATE.start_node_create_#res#1.base|) 0))) |v_#memory_$Pointer$.base_28|)))))) (exists ((|v_ULTIMATE.start_sll_create_~len#1_72| Int)) (or (and (exists ((|v_#valid_49| (Array Int Int))) (and (= (select |v_#valid_49| 1) 1) (= (select |v_#valid_49| 0) 0) (= (select |v_#valid_49| |ULTIMATE.start_node_create_#res#1.base|) 0) (= (store |v_#valid_49| |ULTIMATE.start_node_create_#res#1.base| 1) |#valid|) (= (select |v_#valid_49| 2) 1))) .cse9 (exists ((|v_#memory_$Pointer$.base_130| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_28| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_28| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_28| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 0))) (= (store |v_#memory_$Pointer$.base_130| |ULTIMATE.start_node_create_#res#1.base| (store (store (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_node_create_#res#1.base|) 4 0) 0 (select (select |v_#memory_$Pointer$.base_28| |ULTIMATE.start_node_create_#res#1.base|) 0))) |v_#memory_$Pointer$.base_28|))) (exists ((|v_#length_47| (Array Int Int))) (and (= 2 (select |v_#length_47| 1)) (= 19 (select |v_#length_47| 2)) (= |#length| (store |v_#length_47| |ULTIMATE.start_node_create_#res#1.base| 8)))) (exists ((|v_#memory_int_36| (Array Int (Array Int Int))) (|v_#memory_int_140| (Array Int (Array Int Int)))) (let ((.cse30 (select |v_#memory_int_140| 1)) (.cse32 (select |v_#memory_int_36| |ULTIMATE.start_node_create_#res#1.base|))) (and (= 48 (select .cse30 0)) (= (select .cse30 1) 0) (= |#memory_int| (let ((.cse31 (store |v_#memory_int_36| |ULTIMATE.start_node_create_#res#1.base| (store .cse32 0 1)))) (store .cse31 |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select .cse31 |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 .cse24)))) (= |v_#memory_int_36| (store |v_#memory_int_140| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_int_140| |ULTIMATE.start_node_create_#res#1.base|) 4 (select .cse32 4))))))) .cse16 .cse17 (= 2 |v_ULTIMATE.start_sll_create_~len#1_72|) .cse29 .cse18 (exists ((|v_#memory_$Pointer$.offset_130| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_28| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_130| |ULTIMATE.start_node_create_#res#1.base| (store (store (select |v_#memory_$Pointer$.offset_130| |ULTIMATE.start_node_create_#res#1.base|) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_node_create_#res#1.base|) 0))) |v_#memory_$Pointer$.offset_28|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 0)))))) (and .cse8 (exists ((|v_#valid_49| (Array Int Int))) (let ((.cse33 (store |v_#valid_49| .cse11 1))) (and (= (select |v_#valid_49| 1) 1) (= |#valid| (store .cse33 |ULTIMATE.start_node_create_#res#1.base| 1)) (= (select |v_#valid_49| 0) 0) (= (select .cse33 |ULTIMATE.start_node_create_#res#1.base|) 0) (= (select |v_#valid_49| .cse11) 0) (= (select |v_#valid_49| 2) 1)))) .cse9 (exists ((|v_#memory_int_36| (Array Int (Array Int Int))) (|v_#memory_int_140| (Array Int (Array Int Int))) (|v_#memory_int_141| (Array Int (Array Int Int))) (|v_#memory_int_142| (Array Int (Array Int Int)))) (let ((.cse35 (select |v_#memory_int_140| 1)) (.cse36 (select |v_#memory_int_142| .cse11)) (.cse34 (select |v_#memory_int_36| |ULTIMATE.start_node_create_#res#1.base|))) (and (= |v_#memory_int_36| (store |v_#memory_int_141| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_int_141| |ULTIMATE.start_node_create_#res#1.base|) 4 (select .cse34 4)))) (= 48 (select .cse35 0)) (= (select .cse35 1) 0) (= (store |v_#memory_int_142| .cse11 (store (store .cse36 0 1) 4 (select (select |v_#memory_int_141| .cse11) 4))) |v_#memory_int_141|) (= (store |v_#memory_int_140| .cse11 (store (select |v_#memory_int_140| .cse11) 4 (select .cse36 4))) |v_#memory_int_142|) (= |#memory_int| (let ((.cse37 (store |v_#memory_int_36| |ULTIMATE.start_node_create_#res#1.base| (store .cse34 0 1)))) (store .cse37 |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select .cse37 |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 .cse24))))))) (exists ((|v_#memory_$Pointer$.offset_130| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_28| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_132| (Array Int (Array Int Int)))) (let ((.cse38 (select |v_#memory_$Pointer$.offset_132| .cse11))) (and (= |v_#memory_$Pointer$.offset_132| (store |v_#memory_$Pointer$.offset_130| .cse11 (store (store (select |v_#memory_$Pointer$.offset_130| .cse11) 4 0) 0 (select .cse38 0)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 0))) (= (let ((.cse39 (store |v_#memory_$Pointer$.offset_132| .cse11 (store .cse38 4 0)))) (store .cse39 |ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse39 |ULTIMATE.start_node_create_#res#1.base|) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_node_create_#res#1.base|) 0)))) |v_#memory_$Pointer$.offset_28|)))) (exists ((|v_#length_47| (Array Int Int))) (and (= 2 (select |v_#length_47| 1)) (= 19 (select |v_#length_47| 2)) (= |#length| (store (store |v_#length_47| .cse11 8) |ULTIMATE.start_node_create_#res#1.base| 8)))) .cse16 .cse17 .cse18 (exists ((|v_#memory_$Pointer$.base_130| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_28| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_132| (Array Int (Array Int Int)))) (let ((.cse40 (select |v_#memory_$Pointer$.base_132| .cse11))) (and (= |v_#memory_$Pointer$.base_132| (store |v_#memory_$Pointer$.base_130| .cse11 (store (store (select |v_#memory_$Pointer$.base_130| .cse11) 4 0) 0 (select .cse40 0)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_28| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_28| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 .cse11))) (= (let ((.cse41 (store |v_#memory_$Pointer$.base_132| .cse11 (store .cse40 4 0)))) (store .cse41 |ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse41 |ULTIMATE.start_node_create_#res#1.base|) 4 0) 0 (select (select |v_#memory_$Pointer$.base_28| |ULTIMATE.start_node_create_#res#1.base|) 0)))) |v_#memory_$Pointer$.base_28|)))) .cse19 .cse25 (= |v_ULTIMATE.start_sll_create_~len#1_72| 1)))) (exists ((|v_ULTIMATE.start_sll_create_~len#1_48| Int)) (or (and .cse8 (exists ((|v_#memory_int_36| (Array Int (Array Int Int))) (|v_#memory_int_90| (Array Int (Array Int Int))) (|v_#memory_int_91| (Array Int (Array Int Int))) (|v_#memory_int_92| (Array Int (Array Int Int)))) (let ((.cse43 (select |v_#memory_int_90| 1)) (.cse42 (select |v_#memory_int_92| .cse11)) (.cse44 (select |v_#memory_int_36| |ULTIMATE.start_node_create_#res#1.base|))) (and (= |v_#memory_int_91| (store |v_#memory_int_92| .cse11 (store (store .cse42 0 1) 4 (select (select |v_#memory_int_91| .cse11) 4)))) (= (select .cse43 1) 0) (= 48 (select .cse43 0)) (= (store |v_#memory_int_90| .cse11 (store (select |v_#memory_int_90| .cse11) 4 (select .cse42 4))) |v_#memory_int_92|) (= (store |v_#memory_int_91| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_int_91| |ULTIMATE.start_node_create_#res#1.base|) 4 (select .cse44 4))) |v_#memory_int_36|) (= |#memory_int| (let ((.cse45 (store |v_#memory_int_36| |ULTIMATE.start_node_create_#res#1.base| (store .cse44 0 1)))) (store .cse45 |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select .cse45 |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 .cse24))))))) .cse9 (exists ((|v_#memory_$Pointer$.base_82| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_28| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_80| (Array Int (Array Int Int)))) (let ((.cse46 (select |v_#memory_$Pointer$.base_82| .cse11))) (and (= (store |v_#memory_$Pointer$.base_80| .cse11 (store (store (select |v_#memory_$Pointer$.base_80| .cse11) 4 0) 0 (select .cse46 0))) |v_#memory_$Pointer$.base_82|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_28| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_28| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 .cse11))) (= |v_#memory_$Pointer$.base_28| (let ((.cse47 (store |v_#memory_$Pointer$.base_82| .cse11 (store .cse46 4 0)))) (store .cse47 |ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse47 |ULTIMATE.start_node_create_#res#1.base|) 4 0) 0 (select (select |v_#memory_$Pointer$.base_28| |ULTIMATE.start_node_create_#res#1.base|) 0)))))))) (exists ((|v_#length_27| (Array Int Int))) (and (= (store (store |v_#length_27| .cse11 8) |ULTIMATE.start_node_create_#res#1.base| 8) |#length|) (= 19 (select |v_#length_27| 2)) (= (select |v_#length_27| 1) 2))) (exists ((|v_#memory_$Pointer$.offset_28| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_80| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_82| (Array Int (Array Int Int)))) (let ((.cse49 (select |v_#memory_$Pointer$.offset_82| .cse11))) (and (= (let ((.cse48 (store |v_#memory_$Pointer$.offset_82| .cse11 (store .cse49 4 0)))) (store .cse48 |ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse48 |ULTIMATE.start_node_create_#res#1.base|) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_node_create_#res#1.base|) 0)))) |v_#memory_$Pointer$.offset_28|) (= (store |v_#memory_$Pointer$.offset_80| .cse11 (store (store (select |v_#memory_$Pointer$.offset_80| .cse11) 4 0) 0 (select .cse49 0))) |v_#memory_$Pointer$.offset_82|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 0)))))) .cse16 .cse17 .cse18 (exists ((|v_#valid_29| (Array Int Int))) (let ((.cse50 (store |v_#valid_29| .cse11 1))) (and (= (select |v_#valid_29| 2) 1) (= (select |v_#valid_29| .cse11) 0) (= (select |v_#valid_29| 1) 1) (= (select .cse50 |ULTIMATE.start_node_create_#res#1.base|) 0) (= (store .cse50 |ULTIMATE.start_node_create_#res#1.base| 1) |#valid|) (= (select |v_#valid_29| 0) 0)))) .cse19 .cse25 (= |v_ULTIMATE.start_sll_create_~len#1_48| 1)) (and .cse9 (exists ((|v_#valid_29| (Array Int Int))) (and (= (select |v_#valid_29| 2) 1) (= (select |v_#valid_29| 1) 1) (= (select |v_#valid_29| |ULTIMATE.start_node_create_#res#1.base|) 0) (= (store |v_#valid_29| |ULTIMATE.start_node_create_#res#1.base| 1) |#valid|) (= (select |v_#valid_29| 0) 0))) .cse16 .cse17 (= 2 |v_ULTIMATE.start_sll_create_~len#1_48|) (exists ((|v_#length_27| (Array Int Int))) (and (= 19 (select |v_#length_27| 2)) (= (select |v_#length_27| 1) 2) (= |#length| (store |v_#length_27| |ULTIMATE.start_node_create_#res#1.base| 8)))) .cse29 .cse18 (exists ((|v_#memory_$Pointer$.base_28| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_80| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_28| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_28| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 0))) (= (store |v_#memory_$Pointer$.base_80| |ULTIMATE.start_node_create_#res#1.base| (store (store (select |v_#memory_$Pointer$.base_80| |ULTIMATE.start_node_create_#res#1.base|) 4 0) 0 (select (select |v_#memory_$Pointer$.base_28| |ULTIMATE.start_node_create_#res#1.base|) 0))) |v_#memory_$Pointer$.base_28|))) (exists ((|v_#memory_int_36| (Array Int (Array Int Int))) (|v_#memory_int_90| (Array Int (Array Int Int)))) (let ((.cse51 (select |v_#memory_int_90| 1)) (.cse52 (select |v_#memory_int_36| |ULTIMATE.start_node_create_#res#1.base|))) (and (= (select .cse51 1) 0) (= 48 (select .cse51 0)) (= |v_#memory_int_36| (store |v_#memory_int_90| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_int_90| |ULTIMATE.start_node_create_#res#1.base|) 4 (select .cse52 4)))) (= |#memory_int| (let ((.cse53 (store |v_#memory_int_36| |ULTIMATE.start_node_create_#res#1.base| (store .cse52 0 1)))) (store .cse53 |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select .cse53 |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 .cse24))))))) (exists ((|v_#memory_$Pointer$.offset_28| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_80| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_80| |ULTIMATE.start_node_create_#res#1.base| (store (store (select |v_#memory_$Pointer$.offset_80| |ULTIMATE.start_node_create_#res#1.base|) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_node_create_#res#1.base|) 0))) |v_#memory_$Pointer$.offset_28|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 0)))))))) (exists ((|v_ULTIMATE.start_sll_create_~len#1_30| Int)) (or (and .cse9 (exists ((|v_#memory_int_36| (Array Int (Array Int Int))) (|v_#memory_int_59| (Array Int (Array Int Int)))) (let ((.cse55 (select |v_#memory_int_59| 1)) (.cse54 (select |v_#memory_int_36| |ULTIMATE.start_node_create_#res#1.base|))) (and (= |v_#memory_int_36| (store |v_#memory_int_59| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_int_59| |ULTIMATE.start_node_create_#res#1.base|) 4 (select .cse54 4)))) (= 48 (select .cse55 0)) (= (select .cse55 1) 0) (= |#memory_int| (let ((.cse56 (store |v_#memory_int_36| |ULTIMATE.start_node_create_#res#1.base| (store .cse54 0 1)))) (store .cse56 |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select .cse56 |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 .cse24))))))) (exists ((|v_#valid_14| (Array Int Int))) (and (= (store |v_#valid_14| |ULTIMATE.start_node_create_#res#1.base| 1) |#valid|) (= (select |v_#valid_14| 0) 0) (= (select |v_#valid_14| 1) 1) (= (select |v_#valid_14| |ULTIMATE.start_node_create_#res#1.base|) 0) (= (select |v_#valid_14| 2) 1))) (exists ((|v_#memory_$Pointer$.offset_28| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_49| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_node_create_#res#1.base| (store (store (select |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_node_create_#res#1.base|) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_node_create_#res#1.base|) 0))) |v_#memory_$Pointer$.offset_28|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 0))))) (= 2 |v_ULTIMATE.start_sll_create_~len#1_30|) .cse16 .cse17 .cse29 .cse18 (exists ((|v_#memory_$Pointer$.base_28| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_49| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_28| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_28| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 0))) (= |v_#memory_$Pointer$.base_28| (store |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base| (store (store (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base|) 4 0) 0 (select (select |v_#memory_$Pointer$.base_28| |ULTIMATE.start_node_create_#res#1.base|) 0)))))) (exists ((|v_#length_12| (Array Int Int))) (and (= 2 (select |v_#length_12| 1)) (= 19 (select |v_#length_12| 2)) (= |#length| (store |v_#length_12| |ULTIMATE.start_node_create_#res#1.base| 8))))) (and .cse8 .cse9 (exists ((|v_#memory_int_36| (Array Int (Array Int Int))) (|v_#memory_int_59| (Array Int (Array Int Int))) (|v_#memory_int_60| (Array Int (Array Int Int))) (|v_#memory_int_61| (Array Int (Array Int Int)))) (let ((.cse57 (select |v_#memory_int_61| .cse11)) (.cse59 (select |v_#memory_int_59| 1)) (.cse58 (select |v_#memory_int_36| |ULTIMATE.start_node_create_#res#1.base|))) (and (= |v_#memory_int_61| (store |v_#memory_int_59| .cse11 (store (select |v_#memory_int_59| .cse11) 4 (select .cse57 4)))) (= (store |v_#memory_int_61| .cse11 (store (store .cse57 0 1) 4 (select (select |v_#memory_int_60| .cse11) 4))) |v_#memory_int_60|) (= (store |v_#memory_int_60| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_int_60| |ULTIMATE.start_node_create_#res#1.base|) 4 (select .cse58 4))) |v_#memory_int_36|) (= 48 (select .cse59 0)) (= (select .cse59 1) 0) (= |#memory_int| (let ((.cse60 (store |v_#memory_int_36| |ULTIMATE.start_node_create_#res#1.base| (store .cse58 0 1)))) (store .cse60 |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select .cse60 |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 .cse24))))))) (= |v_ULTIMATE.start_sll_create_~len#1_30| 1) (exists ((|v_#valid_14| (Array Int Int))) (let ((.cse61 (store |v_#valid_14| .cse11 1))) (and (= (select |v_#valid_14| .cse11) 0) (= |#valid| (store .cse61 |ULTIMATE.start_node_create_#res#1.base| 1)) (= (select .cse61 |ULTIMATE.start_node_create_#res#1.base|) 0) (= (select |v_#valid_14| 0) 0) (= (select |v_#valid_14| 1) 1) (= (select |v_#valid_14| 2) 1)))) (exists ((|v_#memory_$Pointer$.base_51| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_28| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_49| (Array Int (Array Int Int)))) (let ((.cse62 (select |v_#memory_$Pointer$.base_51| .cse11))) (and (= (store |v_#memory_$Pointer$.base_49| .cse11 (store (store (select |v_#memory_$Pointer$.base_49| .cse11) 4 0) 0 (select .cse62 0))) |v_#memory_$Pointer$.base_51|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_28| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_28| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 .cse11))) (= |v_#memory_$Pointer$.base_28| (let ((.cse63 (store |v_#memory_$Pointer$.base_51| .cse11 (store .cse62 4 0)))) (store .cse63 |ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse63 |ULTIMATE.start_node_create_#res#1.base|) 4 0) 0 (select (select |v_#memory_$Pointer$.base_28| |ULTIMATE.start_node_create_#res#1.base|) 0)))))))) .cse16 .cse17 .cse18 .cse19 (exists ((|v_#length_12| (Array Int Int))) (and (= 2 (select |v_#length_12| 1)) (= (store (store |v_#length_12| .cse11 8) |ULTIMATE.start_node_create_#res#1.base| 8) |#length|) (= 19 (select |v_#length_12| 2)))) (exists ((|v_#memory_$Pointer$.offset_51| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_28| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_49| (Array Int (Array Int Int)))) (let ((.cse64 (select |v_#memory_$Pointer$.offset_51| .cse11))) (and (= (store |v_#memory_$Pointer$.offset_49| .cse11 (store (store (select |v_#memory_$Pointer$.offset_49| .cse11) 4 0) 0 (select .cse64 0))) |v_#memory_$Pointer$.offset_51|) (= (let ((.cse65 (store |v_#memory_$Pointer$.offset_51| .cse11 (store .cse64 4 0)))) (store .cse65 |ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse65 |ULTIMATE.start_node_create_#res#1.base|) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_node_create_#res#1.base|) 0)))) |v_#memory_$Pointer$.offset_28|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 0)))))) .cse25))) .cse1 (= |ULTIMATE.start_node_create_#res#1.offset| 0) .cse2 .cse3 (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) .cse4 .cse5 (exists ((|v_ULTIMATE.start_sll_create_~len#1_60| Int)) (or (and .cse8 .cse9 (exists ((|v_#memory_int_114| (Array Int (Array Int Int))) (|v_#memory_int_115| (Array Int (Array Int Int))) (|v_#memory_int_116| (Array Int (Array Int Int))) (|v_#memory_int_36| (Array Int (Array Int Int)))) (let ((.cse66 (select |v_#memory_int_116| .cse11)) (.cse67 (select |v_#memory_int_114| 1)) (.cse68 (select |v_#memory_int_36| |ULTIMATE.start_node_create_#res#1.base|))) (and (= (store |v_#memory_int_114| .cse11 (store (select |v_#memory_int_114| .cse11) 4 (select .cse66 4))) |v_#memory_int_116|) (= (store |v_#memory_int_116| .cse11 (store (store .cse66 0 1) 4 (select (select |v_#memory_int_115| .cse11) 4))) |v_#memory_int_115|) (= (select .cse67 1) 0) (= 48 (select .cse67 0)) (= (store |v_#memory_int_115| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_int_115| |ULTIMATE.start_node_create_#res#1.base|) 4 (select .cse68 4))) |v_#memory_int_36|) (= |#memory_int| (let ((.cse69 (store |v_#memory_int_36| |ULTIMATE.start_node_create_#res#1.base| (store .cse68 0 1)))) (store .cse69 |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select .cse69 |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 .cse24))))))) .cse16 (exists ((|v_#memory_$Pointer$.offset_104| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_106| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_28| (Array Int (Array Int Int)))) (let ((.cse71 (select |v_#memory_$Pointer$.offset_106| .cse11))) (and (= (let ((.cse70 (store |v_#memory_$Pointer$.offset_106| .cse11 (store .cse71 4 0)))) (store .cse70 |ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse70 |ULTIMATE.start_node_create_#res#1.base|) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_node_create_#res#1.base|) 0)))) |v_#memory_$Pointer$.offset_28|) (= (store |v_#memory_$Pointer$.offset_104| .cse11 (store (store (select |v_#memory_$Pointer$.offset_104| .cse11) 4 0) 0 (select .cse71 0))) |v_#memory_$Pointer$.offset_106|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 0)))))) (exists ((|v_#length_37| (Array Int Int))) (and (= 2 (select |v_#length_37| 1)) (= |#length| (store (store |v_#length_37| .cse11 8) |ULTIMATE.start_node_create_#res#1.base| 8)) (= 19 (select |v_#length_37| 2)))) .cse17 (exists ((|v_#memory_$Pointer$.base_106| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_28| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_104| (Array Int (Array Int Int)))) (let ((.cse72 (select |v_#memory_$Pointer$.base_106| .cse11))) (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_28| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_28| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 .cse11))) (= |v_#memory_$Pointer$.base_106| (store |v_#memory_$Pointer$.base_104| .cse11 (store (store (select |v_#memory_$Pointer$.base_104| .cse11) 4 0) 0 (select .cse72 0)))) (= (let ((.cse73 (store |v_#memory_$Pointer$.base_106| .cse11 (store .cse72 4 0)))) (store .cse73 |ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse73 |ULTIMATE.start_node_create_#res#1.base|) 4 0) 0 (select (select |v_#memory_$Pointer$.base_28| |ULTIMATE.start_node_create_#res#1.base|) 0)))) |v_#memory_$Pointer$.base_28|)))) .cse18 (= |v_ULTIMATE.start_sll_create_~len#1_60| 1) .cse19 (exists ((|v_#valid_39| (Array Int Int))) (let ((.cse74 (store |v_#valid_39| .cse11 1))) (and (= (select |v_#valid_39| 0) 0) (= (select |v_#valid_39| 2) 1) (= (select |v_#valid_39| 1) 1) (= |#valid| (store .cse74 |ULTIMATE.start_node_create_#res#1.base| 1)) (= (select |v_#valid_39| .cse11) 0) (= (select .cse74 |ULTIMATE.start_node_create_#res#1.base|) 0)))) .cse25) (and .cse9 (exists ((|v_#memory_int_114| (Array Int (Array Int Int))) (|v_#memory_int_36| (Array Int (Array Int Int)))) (let ((.cse75 (select |v_#memory_int_114| 1)) (.cse76 (select |v_#memory_int_36| |ULTIMATE.start_node_create_#res#1.base|))) (and (= (select .cse75 1) 0) (= |v_#memory_int_36| (store |v_#memory_int_114| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_int_114| |ULTIMATE.start_node_create_#res#1.base|) 4 (select .cse76 4)))) (= 48 (select .cse75 0)) (= |#memory_int| (let ((.cse77 (store |v_#memory_int_36| |ULTIMATE.start_node_create_#res#1.base| (store .cse76 0 1)))) (store .cse77 |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select .cse77 |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 .cse24))))))) (= 2 |v_ULTIMATE.start_sll_create_~len#1_60|) (exists ((|v_#valid_39| (Array Int Int))) (and (= (select |v_#valid_39| 0) 0) (= (select |v_#valid_39| 2) 1) (= (select |v_#valid_39| 1) 1) (= (select |v_#valid_39| |ULTIMATE.start_node_create_#res#1.base|) 0) (= (store |v_#valid_39| |ULTIMATE.start_node_create_#res#1.base| 1) |#valid|))) (exists ((|v_#memory_$Pointer$.offset_104| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_28| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_104| |ULTIMATE.start_node_create_#res#1.base| (store (store (select |v_#memory_$Pointer$.offset_104| |ULTIMATE.start_node_create_#res#1.base|) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_node_create_#res#1.base|) 0))) |v_#memory_$Pointer$.offset_28|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 0))))) .cse16 .cse17 .cse29 (exists ((|v_#length_37| (Array Int Int))) (and (= 2 (select |v_#length_37| 1)) (= |#length| (store |v_#length_37| |ULTIMATE.start_node_create_#res#1.base| 8)) (= 19 (select |v_#length_37| 2)))) .cse18 (exists ((|v_#memory_$Pointer$.base_28| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_104| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_28| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_28| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 0))) (= (store |v_#memory_$Pointer$.base_104| |ULTIMATE.start_node_create_#res#1.base| (store (store (select |v_#memory_$Pointer$.base_104| |ULTIMATE.start_node_create_#res#1.base|) 4 0) 0 (select (select |v_#memory_$Pointer$.base_28| |ULTIMATE.start_node_create_#res#1.base|) 0))) |v_#memory_$Pointer$.base_28|)))))) (exists ((|v_ULTIMATE.start_sll_create_~len#1_24| Int)) (or (and .cse8 .cse9 (exists ((|v_#memory_$Pointer$.offset_41| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_43| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_28| (Array Int (Array Int Int)))) (let ((.cse79 (select |v_#memory_$Pointer$.offset_43| .cse11))) (and (= (let ((.cse78 (store |v_#memory_$Pointer$.offset_43| .cse11 (store .cse79 4 0)))) (store .cse78 |ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse78 |ULTIMATE.start_node_create_#res#1.base|) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_node_create_#res#1.base|) 0)))) |v_#memory_$Pointer$.offset_28|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 0))) (= |v_#memory_$Pointer$.offset_43| (store |v_#memory_$Pointer$.offset_41| .cse11 (store (store (select |v_#memory_$Pointer$.offset_41| .cse11) 4 0) 0 (select .cse79 0))))))) (exists ((|v_#memory_$Pointer$.base_41| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_43| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_28| (Array Int (Array Int Int)))) (let ((.cse81 (select |v_#memory_$Pointer$.base_43| .cse11))) (and (= (let ((.cse80 (store |v_#memory_$Pointer$.base_43| .cse11 (store .cse81 4 0)))) (store .cse80 |ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse80 |ULTIMATE.start_node_create_#res#1.base|) 4 0) 0 (select (select |v_#memory_$Pointer$.base_28| |ULTIMATE.start_node_create_#res#1.base|) 0)))) |v_#memory_$Pointer$.base_28|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_28| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_28| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 .cse11))) (= (store |v_#memory_$Pointer$.base_41| .cse11 (store (store (select |v_#memory_$Pointer$.base_41| .cse11) 4 0) 0 (select .cse81 0))) |v_#memory_$Pointer$.base_43|)))) .cse16 .cse17 .cse18 (exists ((|v_#length_7| (Array Int Int))) (and (= (select |v_#length_7| 2) 19) (= 2 (select |v_#length_7| 1)) (= (store (store |v_#length_7| .cse11 8) |ULTIMATE.start_node_create_#res#1.base| 8) |#length|))) (= |v_ULTIMATE.start_sll_create_~len#1_24| 1) .cse19 (exists ((|v_#valid_9| (Array Int Int))) (let ((.cse82 (store |v_#valid_9| .cse11 1))) (and (= (select |v_#valid_9| 2) 1) (= (select |v_#valid_9| .cse11) 0) (= (select |v_#valid_9| 0) 0) (= (select |v_#valid_9| 1) 1) (= (select .cse82 |ULTIMATE.start_node_create_#res#1.base|) 0) (= (store .cse82 |ULTIMATE.start_node_create_#res#1.base| 1) |#valid|)))) .cse25 (exists ((|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_int_52| (Array Int (Array Int Int))) (|v_#memory_int_53| (Array Int (Array Int Int))) (|v_#memory_int_36| (Array Int (Array Int Int)))) (let ((.cse83 (select |v_#memory_int_53| .cse11)) (.cse85 (select |v_#memory_int_51| 1)) (.cse84 (select |v_#memory_int_36| |ULTIMATE.start_node_create_#res#1.base|))) (and (= |v_#memory_int_53| (store |v_#memory_int_51| .cse11 (store (select |v_#memory_int_51| .cse11) 4 (select .cse83 4)))) (= (store |v_#memory_int_53| .cse11 (store (store .cse83 0 1) 4 (select (select |v_#memory_int_52| .cse11) 4))) |v_#memory_int_52|) (= |v_#memory_int_36| (store |v_#memory_int_52| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_int_52| |ULTIMATE.start_node_create_#res#1.base|) 4 (select .cse84 4)))) (= (select .cse85 1) 0) (= (select .cse85 0) 48) (= |#memory_int| (let ((.cse86 (store |v_#memory_int_36| |ULTIMATE.start_node_create_#res#1.base| (store .cse84 0 1)))) (store .cse86 |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select .cse86 |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 .cse24)))))))) (and (exists ((|v_#valid_9| (Array Int Int))) (and (= (select |v_#valid_9| 2) 1) (= (store |v_#valid_9| |ULTIMATE.start_node_create_#res#1.base| 1) |#valid|) (= (select |v_#valid_9| |ULTIMATE.start_node_create_#res#1.base|) 0) (= (select |v_#valid_9| 0) 0) (= (select |v_#valid_9| 1) 1))) .cse9 (exists ((|v_#memory_$Pointer$.offset_41| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_28| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.offset_28| (store |v_#memory_$Pointer$.offset_41| |ULTIMATE.start_node_create_#res#1.base| (store (store (select |v_#memory_$Pointer$.offset_41| |ULTIMATE.start_node_create_#res#1.base|) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_node_create_#res#1.base|) 0)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 0))))) (exists ((|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_int_36| (Array Int (Array Int Int)))) (let ((.cse87 (select |v_#memory_int_51| 1)) (.cse88 (select |v_#memory_int_36| |ULTIMATE.start_node_create_#res#1.base|))) (and (= (select .cse87 1) 0) (= (select .cse87 0) 48) (= |v_#memory_int_36| (store |v_#memory_int_51| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_int_51| |ULTIMATE.start_node_create_#res#1.base|) 4 (select .cse88 4)))) (= |#memory_int| (let ((.cse89 (store |v_#memory_int_36| |ULTIMATE.start_node_create_#res#1.base| (store .cse88 0 1)))) (store .cse89 |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select .cse89 |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 .cse24))))))) (exists ((|v_#length_7| (Array Int Int))) (and (= |#length| (store |v_#length_7| |ULTIMATE.start_node_create_#res#1.base| 8)) (= (select |v_#length_7| 2) 19) (= 2 (select |v_#length_7| 1)))) (exists ((|v_#memory_$Pointer$.base_41| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_28| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_28| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_28| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 0))) (= (store |v_#memory_$Pointer$.base_41| |ULTIMATE.start_node_create_#res#1.base| (store (store (select |v_#memory_$Pointer$.base_41| |ULTIMATE.start_node_create_#res#1.base|) 4 0) 0 (select (select |v_#memory_$Pointer$.base_28| |ULTIMATE.start_node_create_#res#1.base|) 0))) |v_#memory_$Pointer$.base_28|))) .cse16 .cse17 .cse29 .cse18 (= 2 |v_ULTIMATE.start_sll_create_~len#1_24|)))) .cse7 (exists ((|v_ULTIMATE.start_sll_create_~len#1_78| Int)) (or (and .cse8 (exists ((|v_#memory_$Pointer$.offset_28| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_143| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_145| (Array Int (Array Int Int)))) (let ((.cse90 (select |v_#memory_$Pointer$.offset_145| .cse11))) (and (= (store |v_#memory_$Pointer$.offset_143| .cse11 (store (store (select |v_#memory_$Pointer$.offset_143| .cse11) 4 0) 0 (select .cse90 0))) |v_#memory_$Pointer$.offset_145|) (= (let ((.cse91 (store |v_#memory_$Pointer$.offset_145| .cse11 (store .cse90 4 0)))) (store .cse91 |ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse91 |ULTIMATE.start_node_create_#res#1.base|) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_node_create_#res#1.base|) 0)))) |v_#memory_$Pointer$.offset_28|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 0)))))) .cse9 (exists ((|v_#memory_$Pointer$.base_28| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_145| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_143| (Array Int (Array Int Int)))) (let ((.cse93 (select |v_#memory_$Pointer$.base_145| .cse11))) (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_28| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_28| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 .cse11))) (= (let ((.cse92 (store |v_#memory_$Pointer$.base_145| .cse11 (store .cse93 4 0)))) (store .cse92 |ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse92 |ULTIMATE.start_node_create_#res#1.base|) 4 0) 0 (select (select |v_#memory_$Pointer$.base_28| |ULTIMATE.start_node_create_#res#1.base|) 0)))) |v_#memory_$Pointer$.base_28|) (= (store |v_#memory_$Pointer$.base_143| .cse11 (store (store (select |v_#memory_$Pointer$.base_143| .cse11) 4 0) 0 (select .cse93 0))) |v_#memory_$Pointer$.base_145|)))) .cse16 (exists ((|v_#length_52| (Array Int Int))) (and (= 2 (select |v_#length_52| 1)) (= 19 (select |v_#length_52| 2)) (= |#length| (store (store |v_#length_52| .cse11 8) |ULTIMATE.start_node_create_#res#1.base| 8)))) .cse17 .cse18 .cse19 (exists ((|v_#memory_int_36| (Array Int (Array Int Int))) (|v_#memory_int_154| (Array Int (Array Int Int))) (|v_#memory_int_155| (Array Int (Array Int Int))) (|v_#memory_int_153| (Array Int (Array Int Int)))) (let ((.cse94 (select |v_#memory_int_155| .cse11)) (.cse95 (select |v_#memory_int_153| 1)) (.cse96 (select |v_#memory_int_36| |ULTIMATE.start_node_create_#res#1.base|))) (and (= (store |v_#memory_int_155| .cse11 (store (store .cse94 0 1) 4 (select (select |v_#memory_int_154| .cse11) 4))) |v_#memory_int_154|) (= |v_#memory_int_155| (store |v_#memory_int_153| .cse11 (store (select |v_#memory_int_153| .cse11) 4 (select .cse94 4)))) (= (select .cse95 1) 0) (= 48 (select .cse95 0)) (= |v_#memory_int_36| (store |v_#memory_int_154| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_int_154| |ULTIMATE.start_node_create_#res#1.base|) 4 (select .cse96 4)))) (= |#memory_int| (let ((.cse97 (store |v_#memory_int_36| |ULTIMATE.start_node_create_#res#1.base| (store .cse96 0 1)))) (store .cse97 |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select .cse97 |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 .cse24))))))) (= |v_ULTIMATE.start_sll_create_~len#1_78| 1) (exists ((|v_#valid_54| (Array Int Int))) (let ((.cse98 (store |v_#valid_54| .cse11 1))) (and (= (select |v_#valid_54| 1) 1) (= |#valid| (store .cse98 |ULTIMATE.start_node_create_#res#1.base| 1)) (= (select |v_#valid_54| 2) 1) (= 0 (select .cse98 |ULTIMATE.start_node_create_#res#1.base|)) (= (select |v_#valid_54| 0) 0) (= (select |v_#valid_54| .cse11) 0)))) .cse25) (and (exists ((|v_#memory_int_36| (Array Int (Array Int Int))) (|v_#memory_int_153| (Array Int (Array Int Int)))) (let ((.cse100 (select |v_#memory_int_153| 1)) (.cse99 (select |v_#memory_int_36| |ULTIMATE.start_node_create_#res#1.base|))) (and (= (store |v_#memory_int_153| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_int_153| |ULTIMATE.start_node_create_#res#1.base|) 4 (select .cse99 4))) |v_#memory_int_36|) (= (select .cse100 1) 0) (= 48 (select .cse100 0)) (= |#memory_int| (let ((.cse101 (store |v_#memory_int_36| |ULTIMATE.start_node_create_#res#1.base| (store .cse99 0 1)))) (store .cse101 |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select .cse101 |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 .cse24))))))) .cse9 (exists ((|v_#length_52| (Array Int Int))) (and (= 2 (select |v_#length_52| 1)) (= 19 (select |v_#length_52| 2)) (= |#length| (store |v_#length_52| |ULTIMATE.start_node_create_#res#1.base| 8)))) (= 2 |v_ULTIMATE.start_sll_create_~len#1_78|) (exists ((|v_#memory_$Pointer$.offset_28| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_143| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_143| |ULTIMATE.start_node_create_#res#1.base| (store (store (select |v_#memory_$Pointer$.offset_143| |ULTIMATE.start_node_create_#res#1.base|) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_node_create_#res#1.base|) 0))) |v_#memory_$Pointer$.offset_28|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 0))))) (exists ((|v_#memory_$Pointer$.base_28| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_143| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_28| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_28| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 0))) (= (store |v_#memory_$Pointer$.base_143| |ULTIMATE.start_node_create_#res#1.base| (store (store (select |v_#memory_$Pointer$.base_143| |ULTIMATE.start_node_create_#res#1.base|) 4 0) 0 (select (select |v_#memory_$Pointer$.base_28| |ULTIMATE.start_node_create_#res#1.base|) 0))) |v_#memory_$Pointer$.base_28|))) .cse16 .cse17 .cse29 .cse18 (exists ((|v_#valid_54| (Array Int Int))) (and (= (select |v_#valid_54| 1) 1) (= (select |v_#valid_54| |ULTIMATE.start_node_create_#res#1.base|) 0) (= (select |v_#valid_54| 2) 1) (= (store |v_#valid_54| |ULTIMATE.start_node_create_#res#1.base| 1) |#valid|) (= (select |v_#valid_54| 0) 0))))))))))) [2023-12-02 15:45:15,435 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 609) no Hoare annotation was computed. [2023-12-02 15:45:15,436 INFO L899 garLoopResultBuilder]: For program point L602(line 602) no Hoare annotation was computed. [2023-12-02 15:45:15,436 INFO L899 garLoopResultBuilder]: For program point L602-1(line 602) no Hoare annotation was computed. [2023-12-02 15:45:15,436 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 622) no Hoare annotation was computed. [2023-12-02 15:45:15,436 INFO L899 garLoopResultBuilder]: For program point L619(line 619) no Hoare annotation was computed. [2023-12-02 15:45:15,436 INFO L899 garLoopResultBuilder]: For program point L619-1(line 619) no Hoare annotation was computed. [2023-12-02 15:45:15,436 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-02 15:45:15,436 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 609) no Hoare annotation was computed. [2023-12-02 15:45:15,436 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 622) no Hoare annotation was computed. [2023-12-02 15:45:15,436 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 619) no Hoare annotation was computed. [2023-12-02 15:45:15,436 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 618) no Hoare annotation was computed. [2023-12-02 15:45:15,439 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:45:15,441 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 15:45:15,496 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[1] could not be translated [2023-12-02 15:45:15,497 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[1] could not be translated [2023-12-02 15:45:15,497 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[2] could not be translated [2023-12-02 15:45:15,497 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[0] could not be translated [2023-12-02 15:45:15,498 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[2] could not be translated [2023-12-02 15:45:15,498 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-12-02 15:45:15,498 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-12-02 15:45:15,499 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_sll_create_~len#1_66 : int :: ((((((((((((!(#memory_$Pointer$.base[~new_head~0!base][4] == 0) && #res!base + 1 <= #StackHeapBarrier) && (exists v_#valid_44 : [int]int :: ((((v_#valid_44[#memory_$Pointer$.base[~new_head~0!base][4] := 1][#res!base := 1] == #valid && v_#valid_44[2] == 1) && v_#valid_44[#memory_$Pointer$.base[~new_head~0!base][4]] == 0) && v_#valid_44[0] == 0) && v_#valid_44[1] == 1) && v_#valid_44[#memory_$Pointer$.base[~new_head~0!base][4] := 1][#res!base] == 0)) && (exists v_#memory_$Pointer$.base_119 : [int,int]int, v_#memory_$Pointer$.base_117 : [int,int]int, v_#memory_$Pointer$.base_28 : [int,int]int :: (#memory_$Pointer$.base == v_#memory_$Pointer$.base_28[~new_head~0!base := v_#memory_$Pointer$.base_28[~new_head~0!base][4 := #memory_$Pointer$.base[~new_head~0!base][4]]] && v_#memory_$Pointer$.base_117[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_117[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0][0 := v_#memory_$Pointer$.base_119[#memory_$Pointer$.base[~new_head~0!base][4]][0]]] == v_#memory_$Pointer$.base_119) && v_#memory_$Pointer$.base_119[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_119[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base := v_#memory_$Pointer$.base_119[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_119[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base][4 := 0][0 := v_#memory_$Pointer$.base_28[#res!base][0]]] == v_#memory_$Pointer$.base_28)) && (exists v_#length_42 : [int]int :: (19 == v_#length_42[2] && v_#length_42[1] == 2) && #length == v_#length_42[#memory_$Pointer$.base[~new_head~0!base][4] := 8][#res!base := 8])) && (exists v_#memory_$Pointer$.offset_117 : [int,int]int, v_#memory_$Pointer$.offset_119 : [int,int]int, v_#memory_$Pointer$.offset_28 : [int,int]int :: (v_#memory_$Pointer$.offset_117[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_117[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0][0 := v_#memory_$Pointer$.offset_119[#memory_$Pointer$.base[~new_head~0!base][4]][0]]] == v_#memory_$Pointer$.offset_119 && v_#memory_$Pointer$.offset_119[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_119[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base := v_#memory_$Pointer$.offset_119[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_119[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base][4 := 0][0 := v_#memory_$Pointer$.offset_28[#res!base][0]]] == v_#memory_$Pointer$.offset_28) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_28[~new_head~0!base := v_#memory_$Pointer$.offset_28[~new_head~0!base][4 := 0]])) && !(#res!base == 0)) && ~head~0!base == ~new_head~0!base) && #res!base == ~new_head~0!base) && ~len == 0) && (exists v_#memory_int_129 : [int,int]int, v_#memory_int_127 : [int,int]int, v_#memory_int_128 : [int,int]int, v_#memory_int_36 : [int,int]int :: ((((v_#memory_int_36 == v_#memory_int_128[#res!base := v_#memory_int_128[#res!base][4 := v_#memory_int_36[#res!base][4]]] && v_#memory_int_129[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_int_129[#memory_$Pointer$.base[~new_head~0!base][4]][0 := 1][4 := v_#memory_int_128[#memory_$Pointer$.base[~new_head~0!base][4]][4]]] == v_#memory_int_128) && v_#memory_int_127[1][1] == 0) && #memory_int == v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base := v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base][4 := #memory_int[~new_head~0!base][4]]]) && 48 == v_#memory_int_127[1][0]) && v_#memory_int_127[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_int_127[#memory_$Pointer$.base[~new_head~0!base][4]][4 := v_#memory_int_129[#memory_$Pointer$.base[~new_head~0!base][4]][4]]] == v_#memory_int_129)) && v_ULTIMATE.start_sll_create_~len#1_66 == 1) && #memory_$Pointer$.base[~new_head~0!base][4] + 1 <= #StackHeapBarrier) || ((((((((((#res!base + 1 <= #StackHeapBarrier && (exists v_#valid_44 : [int]int :: (((v_#valid_44[2] == 1 && v_#valid_44[0] == 0) && v_#valid_44[#res!base] == 0) && v_#valid_44[1] == 1) && v_#valid_44[#res!base := 1] == #valid)) && (exists v_#memory_int_127 : [int,int]int, v_#memory_int_36 : [int,int]int :: ((v_#memory_int_127[#res!base := v_#memory_int_127[#res!base][4 := v_#memory_int_36[#res!base][4]]] == v_#memory_int_36 && v_#memory_int_127[1][1] == 0) && #memory_int == v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base := v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base][4 := #memory_int[~new_head~0!base][4]]]) && 48 == v_#memory_int_127[1][0])) && (exists v_#memory_$Pointer$.offset_117 : [int,int]int, v_#memory_$Pointer$.offset_28 : [int,int]int :: v_#memory_$Pointer$.offset_28 == v_#memory_$Pointer$.offset_117[#res!base := v_#memory_$Pointer$.offset_117[#res!base][4 := 0][0 := v_#memory_$Pointer$.offset_28[#res!base][0]]] && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_28[~new_head~0!base := v_#memory_$Pointer$.offset_28[~new_head~0!base][4 := 0]])) && !(#res!base == 0)) && ~head~0!base == ~new_head~0!base) && ~len == 1) && #res!base == ~new_head~0!base) && 2 == v_ULTIMATE.start_sll_create_~len#1_66) && (exists v_#length_42 : [int]int :: (19 == v_#length_42[2] && v_#length_42[1] == 2) && v_#length_42[#res!base := 8] == #length)) && (exists v_#memory_$Pointer$.base_117 : [int,int]int, v_#memory_$Pointer$.base_28 : [int,int]int :: #memory_$Pointer$.base == v_#memory_$Pointer$.base_28[~new_head~0!base := v_#memory_$Pointer$.base_28[~new_head~0!base][4 := 0]] && v_#memory_$Pointer$.base_117[#res!base := v_#memory_$Pointer$.base_117[#res!base][4 := 0][0 := v_#memory_$Pointer$.base_28[#res!base][0]]] == v_#memory_$Pointer$.base_28))) could not be translated [2023-12-02 15:45:15,500 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_sll_create_~len#1_72 : int :: (((((((((((exists v_#valid_49 : [int]int :: (((v_#valid_49[1] == 1 && v_#valid_49[0] == 0) && v_#valid_49[#res!base] == 0) && v_#valid_49[#res!base := 1] == #valid) && v_#valid_49[2] == 1) && #res!base + 1 <= #StackHeapBarrier) && (exists v_#memory_$Pointer$.base_130 : [int,int]int, v_#memory_$Pointer$.base_28 : [int,int]int :: #memory_$Pointer$.base == v_#memory_$Pointer$.base_28[~new_head~0!base := v_#memory_$Pointer$.base_28[~new_head~0!base][4 := 0]] && v_#memory_$Pointer$.base_130[#res!base := v_#memory_$Pointer$.base_130[#res!base][4 := 0][0 := v_#memory_$Pointer$.base_28[#res!base][0]]] == v_#memory_$Pointer$.base_28)) && (exists v_#length_47 : [int]int :: (2 == v_#length_47[1] && 19 == v_#length_47[2]) && #length == v_#length_47[#res!base := 8])) && (exists v_#memory_int_36 : [int,int]int, v_#memory_int_140 : [int,int]int :: ((48 == v_#memory_int_140[1][0] && v_#memory_int_140[1][1] == 0) && #memory_int == v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base := v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base][4 := #memory_int[~new_head~0!base][4]]]) && v_#memory_int_36 == v_#memory_int_140[#res!base := v_#memory_int_140[#res!base][4 := v_#memory_int_36[#res!base][4]]])) && !(#res!base == 0)) && ~head~0!base == ~new_head~0!base) && 2 == v_ULTIMATE.start_sll_create_~len#1_72) && ~len == 1) && #res!base == ~new_head~0!base) && (exists v_#memory_$Pointer$.offset_130 : [int,int]int, v_#memory_$Pointer$.offset_28 : [int,int]int :: v_#memory_$Pointer$.offset_130[#res!base := v_#memory_$Pointer$.offset_130[#res!base][4 := 0][0 := v_#memory_$Pointer$.offset_28[#res!base][0]]] == v_#memory_$Pointer$.offset_28 && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_28[~new_head~0!base := v_#memory_$Pointer$.offset_28[~new_head~0!base][4 := 0]])) || ((((((((((((!(#memory_$Pointer$.base[~new_head~0!base][4] == 0) && (exists v_#valid_49 : [int]int :: ((((v_#valid_49[1] == 1 && #valid == v_#valid_49[#memory_$Pointer$.base[~new_head~0!base][4] := 1][#res!base := 1]) && v_#valid_49[0] == 0) && v_#valid_49[#memory_$Pointer$.base[~new_head~0!base][4] := 1][#res!base] == 0) && v_#valid_49[#memory_$Pointer$.base[~new_head~0!base][4]] == 0) && v_#valid_49[2] == 1)) && #res!base + 1 <= #StackHeapBarrier) && (exists v_#memory_int_36 : [int,int]int, v_#memory_int_140 : [int,int]int, v_#memory_int_141 : [int,int]int, v_#memory_int_142 : [int,int]int :: ((((v_#memory_int_36 == v_#memory_int_141[#res!base := v_#memory_int_141[#res!base][4 := v_#memory_int_36[#res!base][4]]] && 48 == v_#memory_int_140[1][0]) && v_#memory_int_140[1][1] == 0) && v_#memory_int_142[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_int_142[#memory_$Pointer$.base[~new_head~0!base][4]][0 := 1][4 := v_#memory_int_141[#memory_$Pointer$.base[~new_head~0!base][4]][4]]] == v_#memory_int_141) && v_#memory_int_140[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_int_140[#memory_$Pointer$.base[~new_head~0!base][4]][4 := v_#memory_int_142[#memory_$Pointer$.base[~new_head~0!base][4]][4]]] == v_#memory_int_142) && #memory_int == v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base := v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base][4 := #memory_int[~new_head~0!base][4]]])) && (exists v_#memory_$Pointer$.offset_130 : [int,int]int, v_#memory_$Pointer$.offset_28 : [int,int]int, v_#memory_$Pointer$.offset_132 : [int,int]int :: (v_#memory_$Pointer$.offset_132 == v_#memory_$Pointer$.offset_130[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_130[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0][0 := v_#memory_$Pointer$.offset_132[#memory_$Pointer$.base[~new_head~0!base][4]][0]]] && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_28[~new_head~0!base := v_#memory_$Pointer$.offset_28[~new_head~0!base][4 := 0]]) && v_#memory_$Pointer$.offset_132[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_132[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base := v_#memory_$Pointer$.offset_132[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_132[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base][4 := 0][0 := v_#memory_$Pointer$.offset_28[#res!base][0]]] == v_#memory_$Pointer$.offset_28)) && (exists v_#length_47 : [int]int :: (2 == v_#length_47[1] && 19 == v_#length_47[2]) && #length == v_#length_47[#memory_$Pointer$.base[~new_head~0!base][4] := 8][#res!base := 8])) && !(#res!base == 0)) && ~head~0!base == ~new_head~0!base) && #res!base == ~new_head~0!base) && (exists v_#memory_$Pointer$.base_130 : [int,int]int, v_#memory_$Pointer$.base_28 : [int,int]int, v_#memory_$Pointer$.base_132 : [int,int]int :: (v_#memory_$Pointer$.base_132 == v_#memory_$Pointer$.base_130[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_130[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0][0 := v_#memory_$Pointer$.base_132[#memory_$Pointer$.base[~new_head~0!base][4]][0]]] && #memory_$Pointer$.base == v_#memory_$Pointer$.base_28[~new_head~0!base := v_#memory_$Pointer$.base_28[~new_head~0!base][4 := #memory_$Pointer$.base[~new_head~0!base][4]]]) && v_#memory_$Pointer$.base_132[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_132[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base := v_#memory_$Pointer$.base_132[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_132[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base][4 := 0][0 := v_#memory_$Pointer$.base_28[#res!base][0]]] == v_#memory_$Pointer$.base_28)) && ~len == 0) && #memory_$Pointer$.base[~new_head~0!base][4] + 1 <= #StackHeapBarrier) && v_ULTIMATE.start_sll_create_~len#1_72 == 1)) could not be translated [2023-12-02 15:45:15,501 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_sll_create_~len#1_48 : int :: ((((((((((((!(#memory_$Pointer$.base[~new_head~0!base][4] == 0) && (exists v_#memory_int_36 : [int,int]int, v_#memory_int_90 : [int,int]int, v_#memory_int_91 : [int,int]int, v_#memory_int_92 : [int,int]int :: ((((v_#memory_int_91 == v_#memory_int_92[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_int_92[#memory_$Pointer$.base[~new_head~0!base][4]][0 := 1][4 := v_#memory_int_91[#memory_$Pointer$.base[~new_head~0!base][4]][4]]] && v_#memory_int_90[1][1] == 0) && 48 == v_#memory_int_90[1][0]) && v_#memory_int_90[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_int_90[#memory_$Pointer$.base[~new_head~0!base][4]][4 := v_#memory_int_92[#memory_$Pointer$.base[~new_head~0!base][4]][4]]] == v_#memory_int_92) && v_#memory_int_91[#res!base := v_#memory_int_91[#res!base][4 := v_#memory_int_36[#res!base][4]]] == v_#memory_int_36) && #memory_int == v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base := v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base][4 := #memory_int[~new_head~0!base][4]]])) && #res!base + 1 <= #StackHeapBarrier) && (exists v_#memory_$Pointer$.base_82 : [int,int]int, v_#memory_$Pointer$.base_28 : [int,int]int, v_#memory_$Pointer$.base_80 : [int,int]int :: (v_#memory_$Pointer$.base_80[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_80[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0][0 := v_#memory_$Pointer$.base_82[#memory_$Pointer$.base[~new_head~0!base][4]][0]]] == v_#memory_$Pointer$.base_82 && #memory_$Pointer$.base == v_#memory_$Pointer$.base_28[~new_head~0!base := v_#memory_$Pointer$.base_28[~new_head~0!base][4 := #memory_$Pointer$.base[~new_head~0!base][4]]]) && v_#memory_$Pointer$.base_28 == v_#memory_$Pointer$.base_82[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_82[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base := v_#memory_$Pointer$.base_82[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_82[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base][4 := 0][0 := v_#memory_$Pointer$.base_28[#res!base][0]]])) && (exists v_#length_27 : [int]int :: (v_#length_27[#memory_$Pointer$.base[~new_head~0!base][4] := 8][#res!base := 8] == #length && 19 == v_#length_27[2]) && v_#length_27[1] == 2)) && (exists v_#memory_$Pointer$.offset_28 : [int,int]int, v_#memory_$Pointer$.offset_80 : [int,int]int, v_#memory_$Pointer$.offset_82 : [int,int]int :: (v_#memory_$Pointer$.offset_82[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_82[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base := v_#memory_$Pointer$.offset_82[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_82[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base][4 := 0][0 := v_#memory_$Pointer$.offset_28[#res!base][0]]] == v_#memory_$Pointer$.offset_28 && v_#memory_$Pointer$.offset_80[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_80[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0][0 := v_#memory_$Pointer$.offset_82[#memory_$Pointer$.base[~new_head~0!base][4]][0]]] == v_#memory_$Pointer$.offset_82) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_28[~new_head~0!base := v_#memory_$Pointer$.offset_28[~new_head~0!base][4 := 0]])) && !(#res!base == 0)) && ~head~0!base == ~new_head~0!base) && #res!base == ~new_head~0!base) && (exists v_#valid_29 : [int]int :: ((((v_#valid_29[2] == 1 && v_#valid_29[#memory_$Pointer$.base[~new_head~0!base][4]] == 0) && v_#valid_29[1] == 1) && v_#valid_29[#memory_$Pointer$.base[~new_head~0!base][4] := 1][#res!base] == 0) && v_#valid_29[#memory_$Pointer$.base[~new_head~0!base][4] := 1][#res!base := 1] == #valid) && v_#valid_29[0] == 0)) && ~len == 0) && #memory_$Pointer$.base[~new_head~0!base][4] + 1 <= #StackHeapBarrier) && v_ULTIMATE.start_sll_create_~len#1_48 == 1) || ((((((((((#res!base + 1 <= #StackHeapBarrier && (exists v_#valid_29 : [int]int :: (((v_#valid_29[2] == 1 && v_#valid_29[1] == 1) && v_#valid_29[#res!base] == 0) && v_#valid_29[#res!base := 1] == #valid) && v_#valid_29[0] == 0)) && !(#res!base == 0)) && ~head~0!base == ~new_head~0!base) && 2 == v_ULTIMATE.start_sll_create_~len#1_48) && (exists v_#length_27 : [int]int :: (19 == v_#length_27[2] && v_#length_27[1] == 2) && #length == v_#length_27[#res!base := 8])) && ~len == 1) && #res!base == ~new_head~0!base) && (exists v_#memory_$Pointer$.base_28 : [int,int]int, v_#memory_$Pointer$.base_80 : [int,int]int :: #memory_$Pointer$.base == v_#memory_$Pointer$.base_28[~new_head~0!base := v_#memory_$Pointer$.base_28[~new_head~0!base][4 := 0]] && v_#memory_$Pointer$.base_80[#res!base := v_#memory_$Pointer$.base_80[#res!base][4 := 0][0 := v_#memory_$Pointer$.base_28[#res!base][0]]] == v_#memory_$Pointer$.base_28)) && (exists v_#memory_int_36 : [int,int]int, v_#memory_int_90 : [int,int]int :: ((v_#memory_int_90[1][1] == 0 && 48 == v_#memory_int_90[1][0]) && v_#memory_int_36 == v_#memory_int_90[#res!base := v_#memory_int_90[#res!base][4 := v_#memory_int_36[#res!base][4]]]) && #memory_int == v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base := v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base][4 := #memory_int[~new_head~0!base][4]]])) && (exists v_#memory_$Pointer$.offset_28 : [int,int]int, v_#memory_$Pointer$.offset_80 : [int,int]int :: v_#memory_$Pointer$.offset_80[#res!base := v_#memory_$Pointer$.offset_80[#res!base][4 := 0][0 := v_#memory_$Pointer$.offset_28[#res!base][0]]] == v_#memory_$Pointer$.offset_28 && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_28[~new_head~0!base := v_#memory_$Pointer$.offset_28[~new_head~0!base][4 := 0]]))) could not be translated [2023-12-02 15:45:15,502 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_sll_create_~len#1_30 : int :: ((((((((((#res!base + 1 <= #StackHeapBarrier && (exists v_#memory_int_36 : [int,int]int, v_#memory_int_59 : [int,int]int :: ((v_#memory_int_36 == v_#memory_int_59[#res!base := v_#memory_int_59[#res!base][4 := v_#memory_int_36[#res!base][4]]] && 48 == v_#memory_int_59[1][0]) && v_#memory_int_59[1][1] == 0) && #memory_int == v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base := v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base][4 := #memory_int[~new_head~0!base][4]]])) && (exists v_#valid_14 : [int]int :: (((v_#valid_14[#res!base := 1] == #valid && v_#valid_14[0] == 0) && v_#valid_14[1] == 1) && v_#valid_14[#res!base] == 0) && v_#valid_14[2] == 1)) && (exists v_#memory_$Pointer$.offset_28 : [int,int]int, v_#memory_$Pointer$.offset_49 : [int,int]int :: v_#memory_$Pointer$.offset_49[#res!base := v_#memory_$Pointer$.offset_49[#res!base][4 := 0][0 := v_#memory_$Pointer$.offset_28[#res!base][0]]] == v_#memory_$Pointer$.offset_28 && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_28[~new_head~0!base := v_#memory_$Pointer$.offset_28[~new_head~0!base][4 := 0]])) && 2 == v_ULTIMATE.start_sll_create_~len#1_30) && !(#res!base == 0)) && ~head~0!base == ~new_head~0!base) && ~len == 1) && #res!base == ~new_head~0!base) && (exists v_#memory_$Pointer$.base_28 : [int,int]int, v_#memory_$Pointer$.base_49 : [int,int]int :: #memory_$Pointer$.base == v_#memory_$Pointer$.base_28[~new_head~0!base := v_#memory_$Pointer$.base_28[~new_head~0!base][4 := 0]] && v_#memory_$Pointer$.base_28 == v_#memory_$Pointer$.base_49[#res!base := v_#memory_$Pointer$.base_49[#res!base][4 := 0][0 := v_#memory_$Pointer$.base_28[#res!base][0]]])) && (exists v_#length_12 : [int]int :: (2 == v_#length_12[1] && 19 == v_#length_12[2]) && #length == v_#length_12[#res!base := 8])) || ((((((((((((!(#memory_$Pointer$.base[~new_head~0!base][4] == 0) && #res!base + 1 <= #StackHeapBarrier) && (exists v_#memory_int_36 : [int,int]int, v_#memory_int_59 : [int,int]int, v_#memory_int_60 : [int,int]int, v_#memory_int_61 : [int,int]int :: ((((v_#memory_int_61 == v_#memory_int_59[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_int_59[#memory_$Pointer$.base[~new_head~0!base][4]][4 := v_#memory_int_61[#memory_$Pointer$.base[~new_head~0!base][4]][4]]] && v_#memory_int_61[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_int_61[#memory_$Pointer$.base[~new_head~0!base][4]][0 := 1][4 := v_#memory_int_60[#memory_$Pointer$.base[~new_head~0!base][4]][4]]] == v_#memory_int_60) && v_#memory_int_60[#res!base := v_#memory_int_60[#res!base][4 := v_#memory_int_36[#res!base][4]]] == v_#memory_int_36) && 48 == v_#memory_int_59[1][0]) && v_#memory_int_59[1][1] == 0) && #memory_int == v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base := v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base][4 := #memory_int[~new_head~0!base][4]]])) && v_ULTIMATE.start_sll_create_~len#1_30 == 1) && (exists v_#valid_14 : [int]int :: ((((v_#valid_14[#memory_$Pointer$.base[~new_head~0!base][4]] == 0 && #valid == v_#valid_14[#memory_$Pointer$.base[~new_head~0!base][4] := 1][#res!base := 1]) && v_#valid_14[#memory_$Pointer$.base[~new_head~0!base][4] := 1][#res!base] == 0) && v_#valid_14[0] == 0) && v_#valid_14[1] == 1) && v_#valid_14[2] == 1)) && (exists v_#memory_$Pointer$.base_51 : [int,int]int, v_#memory_$Pointer$.base_28 : [int,int]int, v_#memory_$Pointer$.base_49 : [int,int]int :: (v_#memory_$Pointer$.base_49[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_49[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0][0 := v_#memory_$Pointer$.base_51[#memory_$Pointer$.base[~new_head~0!base][4]][0]]] == v_#memory_$Pointer$.base_51 && #memory_$Pointer$.base == v_#memory_$Pointer$.base_28[~new_head~0!base := v_#memory_$Pointer$.base_28[~new_head~0!base][4 := #memory_$Pointer$.base[~new_head~0!base][4]]]) && v_#memory_$Pointer$.base_28 == v_#memory_$Pointer$.base_51[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_51[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base := v_#memory_$Pointer$.base_51[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_51[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base][4 := 0][0 := v_#memory_$Pointer$.base_28[#res!base][0]]])) && !(#res!base == 0)) && ~head~0!base == ~new_head~0!base) && #res!base == ~new_head~0!base) && ~len == 0) && (exists v_#length_12 : [int]int :: (2 == v_#length_12[1] && v_#length_12[#memory_$Pointer$.base[~new_head~0!base][4] := 8][#res!base := 8] == #length) && 19 == v_#length_12[2])) && (exists v_#memory_$Pointer$.offset_51 : [int,int]int, v_#memory_$Pointer$.offset_28 : [int,int]int, v_#memory_$Pointer$.offset_49 : [int,int]int :: (v_#memory_$Pointer$.offset_49[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_49[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0][0 := v_#memory_$Pointer$.offset_51[#memory_$Pointer$.base[~new_head~0!base][4]][0]]] == v_#memory_$Pointer$.offset_51 && v_#memory_$Pointer$.offset_51[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_51[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base := v_#memory_$Pointer$.offset_51[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_51[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base][4 := 0][0 := v_#memory_$Pointer$.offset_28[#res!base][0]]] == v_#memory_$Pointer$.offset_28) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_28[~new_head~0!base := v_#memory_$Pointer$.offset_28[~new_head~0!base][4 := 0]])) && #memory_$Pointer$.base[~new_head~0!base][4] + 1 <= #StackHeapBarrier)) could not be translated [2023-12-02 15:45:15,502 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:45:15,503 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_sll_create_~len#1_60 : int :: ((((((((((((!(#memory_$Pointer$.base[~new_head~0!base][4] == 0) && #res!base + 1 <= #StackHeapBarrier) && (exists v_#memory_int_114 : [int,int]int, v_#memory_int_115 : [int,int]int, v_#memory_int_116 : [int,int]int, v_#memory_int_36 : [int,int]int :: ((((v_#memory_int_114[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_int_114[#memory_$Pointer$.base[~new_head~0!base][4]][4 := v_#memory_int_116[#memory_$Pointer$.base[~new_head~0!base][4]][4]]] == v_#memory_int_116 && v_#memory_int_116[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_int_116[#memory_$Pointer$.base[~new_head~0!base][4]][0 := 1][4 := v_#memory_int_115[#memory_$Pointer$.base[~new_head~0!base][4]][4]]] == v_#memory_int_115) && v_#memory_int_114[1][1] == 0) && 48 == v_#memory_int_114[1][0]) && v_#memory_int_115[#res!base := v_#memory_int_115[#res!base][4 := v_#memory_int_36[#res!base][4]]] == v_#memory_int_36) && #memory_int == v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base := v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base][4 := #memory_int[~new_head~0!base][4]]])) && !(#res!base == 0)) && (exists v_#memory_$Pointer$.offset_104 : [int,int]int, v_#memory_$Pointer$.offset_106 : [int,int]int, v_#memory_$Pointer$.offset_28 : [int,int]int :: (v_#memory_$Pointer$.offset_106[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_106[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base := v_#memory_$Pointer$.offset_106[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_106[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base][4 := 0][0 := v_#memory_$Pointer$.offset_28[#res!base][0]]] == v_#memory_$Pointer$.offset_28 && v_#memory_$Pointer$.offset_104[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_104[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0][0 := v_#memory_$Pointer$.offset_106[#memory_$Pointer$.base[~new_head~0!base][4]][0]]] == v_#memory_$Pointer$.offset_106) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_28[~new_head~0!base := v_#memory_$Pointer$.offset_28[~new_head~0!base][4 := 0]])) && (exists v_#length_37 : [int]int :: (2 == v_#length_37[1] && #length == v_#length_37[#memory_$Pointer$.base[~new_head~0!base][4] := 8][#res!base := 8]) && 19 == v_#length_37[2])) && ~head~0!base == ~new_head~0!base) && (exists v_#memory_$Pointer$.base_106 : [int,int]int, v_#memory_$Pointer$.base_28 : [int,int]int, v_#memory_$Pointer$.base_104 : [int,int]int :: (#memory_$Pointer$.base == v_#memory_$Pointer$.base_28[~new_head~0!base := v_#memory_$Pointer$.base_28[~new_head~0!base][4 := #memory_$Pointer$.base[~new_head~0!base][4]]] && v_#memory_$Pointer$.base_106 == v_#memory_$Pointer$.base_104[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_104[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0][0 := v_#memory_$Pointer$.base_106[#memory_$Pointer$.base[~new_head~0!base][4]][0]]]) && v_#memory_$Pointer$.base_106[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_106[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base := v_#memory_$Pointer$.base_106[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_106[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base][4 := 0][0 := v_#memory_$Pointer$.base_28[#res!base][0]]] == v_#memory_$Pointer$.base_28)) && #res!base == ~new_head~0!base) && v_ULTIMATE.start_sll_create_~len#1_60 == 1) && ~len == 0) && (exists v_#valid_39 : [int]int :: ((((v_#valid_39[0] == 0 && v_#valid_39[2] == 1) && v_#valid_39[1] == 1) && #valid == v_#valid_39[#memory_$Pointer$.base[~new_head~0!base][4] := 1][#res!base := 1]) && v_#valid_39[#memory_$Pointer$.base[~new_head~0!base][4]] == 0) && v_#valid_39[#memory_$Pointer$.base[~new_head~0!base][4] := 1][#res!base] == 0)) && #memory_$Pointer$.base[~new_head~0!base][4] + 1 <= #StackHeapBarrier) || ((((((((((#res!base + 1 <= #StackHeapBarrier && (exists v_#memory_int_114 : [int,int]int, v_#memory_int_36 : [int,int]int :: ((v_#memory_int_114[1][1] == 0 && v_#memory_int_36 == v_#memory_int_114[#res!base := v_#memory_int_114[#res!base][4 := v_#memory_int_36[#res!base][4]]]) && 48 == v_#memory_int_114[1][0]) && #memory_int == v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base := v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base][4 := #memory_int[~new_head~0!base][4]]])) && 2 == v_ULTIMATE.start_sll_create_~len#1_60) && (exists v_#valid_39 : [int]int :: (((v_#valid_39[0] == 0 && v_#valid_39[2] == 1) && v_#valid_39[1] == 1) && v_#valid_39[#res!base] == 0) && v_#valid_39[#res!base := 1] == #valid)) && (exists v_#memory_$Pointer$.offset_104 : [int,int]int, v_#memory_$Pointer$.offset_28 : [int,int]int :: v_#memory_$Pointer$.offset_104[#res!base := v_#memory_$Pointer$.offset_104[#res!base][4 := 0][0 := v_#memory_$Pointer$.offset_28[#res!base][0]]] == v_#memory_$Pointer$.offset_28 && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_28[~new_head~0!base := v_#memory_$Pointer$.offset_28[~new_head~0!base][4 := 0]])) && !(#res!base == 0)) && ~head~0!base == ~new_head~0!base) && ~len == 1) && (exists v_#length_37 : [int]int :: (2 == v_#length_37[1] && #length == v_#length_37[#res!base := 8]) && 19 == v_#length_37[2])) && #res!base == ~new_head~0!base) && (exists v_#memory_$Pointer$.base_28 : [int,int]int, v_#memory_$Pointer$.base_104 : [int,int]int :: #memory_$Pointer$.base == v_#memory_$Pointer$.base_28[~new_head~0!base := v_#memory_$Pointer$.base_28[~new_head~0!base][4 := 0]] && v_#memory_$Pointer$.base_104[#res!base := v_#memory_$Pointer$.base_104[#res!base][4 := 0][0 := v_#memory_$Pointer$.base_28[#res!base][0]]] == v_#memory_$Pointer$.base_28))) could not be translated [2023-12-02 15:45:15,504 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_sll_create_~len#1_24 : int :: ((((((((((((!(#memory_$Pointer$.base[~new_head~0!base][4] == 0) && #res!base + 1 <= #StackHeapBarrier) && (exists v_#memory_$Pointer$.offset_41 : [int,int]int, v_#memory_$Pointer$.offset_43 : [int,int]int, v_#memory_$Pointer$.offset_28 : [int,int]int :: (v_#memory_$Pointer$.offset_43[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_43[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base := v_#memory_$Pointer$.offset_43[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_43[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base][4 := 0][0 := v_#memory_$Pointer$.offset_28[#res!base][0]]] == v_#memory_$Pointer$.offset_28 && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_28[~new_head~0!base := v_#memory_$Pointer$.offset_28[~new_head~0!base][4 := 0]]) && v_#memory_$Pointer$.offset_43 == v_#memory_$Pointer$.offset_41[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_41[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0][0 := v_#memory_$Pointer$.offset_43[#memory_$Pointer$.base[~new_head~0!base][4]][0]]])) && (exists v_#memory_$Pointer$.base_41 : [int,int]int, v_#memory_$Pointer$.base_43 : [int,int]int, v_#memory_$Pointer$.base_28 : [int,int]int :: (v_#memory_$Pointer$.base_43[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_43[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base := v_#memory_$Pointer$.base_43[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_43[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base][4 := 0][0 := v_#memory_$Pointer$.base_28[#res!base][0]]] == v_#memory_$Pointer$.base_28 && #memory_$Pointer$.base == v_#memory_$Pointer$.base_28[~new_head~0!base := v_#memory_$Pointer$.base_28[~new_head~0!base][4 := #memory_$Pointer$.base[~new_head~0!base][4]]]) && v_#memory_$Pointer$.base_41[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_41[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0][0 := v_#memory_$Pointer$.base_43[#memory_$Pointer$.base[~new_head~0!base][4]][0]]] == v_#memory_$Pointer$.base_43)) && !(#res!base == 0)) && ~head~0!base == ~new_head~0!base) && #res!base == ~new_head~0!base) && (exists v_#length_7 : [int]int :: (v_#length_7[2] == 19 && 2 == v_#length_7[1]) && v_#length_7[#memory_$Pointer$.base[~new_head~0!base][4] := 8][#res!base := 8] == #length)) && v_ULTIMATE.start_sll_create_~len#1_24 == 1) && ~len == 0) && (exists v_#valid_9 : [int]int :: ((((v_#valid_9[2] == 1 && v_#valid_9[#memory_$Pointer$.base[~new_head~0!base][4]] == 0) && v_#valid_9[0] == 0) && v_#valid_9[1] == 1) && v_#valid_9[#memory_$Pointer$.base[~new_head~0!base][4] := 1][#res!base] == 0) && v_#valid_9[#memory_$Pointer$.base[~new_head~0!base][4] := 1][#res!base := 1] == #valid)) && #memory_$Pointer$.base[~new_head~0!base][4] + 1 <= #StackHeapBarrier) && (exists v_#memory_int_51 : [int,int]int, v_#memory_int_52 : [int,int]int, v_#memory_int_53 : [int,int]int, v_#memory_int_36 : [int,int]int :: ((((v_#memory_int_53 == v_#memory_int_51[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_int_51[#memory_$Pointer$.base[~new_head~0!base][4]][4 := v_#memory_int_53[#memory_$Pointer$.base[~new_head~0!base][4]][4]]] && v_#memory_int_53[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_int_53[#memory_$Pointer$.base[~new_head~0!base][4]][0 := 1][4 := v_#memory_int_52[#memory_$Pointer$.base[~new_head~0!base][4]][4]]] == v_#memory_int_52) && v_#memory_int_36 == v_#memory_int_52[#res!base := v_#memory_int_52[#res!base][4 := v_#memory_int_36[#res!base][4]]]) && v_#memory_int_51[1][1] == 0) && v_#memory_int_51[1][0] == 48) && #memory_int == v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base := v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base][4 := #memory_int[~new_head~0!base][4]]])) || (((((((((((exists v_#valid_9 : [int]int :: (((v_#valid_9[2] == 1 && v_#valid_9[#res!base := 1] == #valid) && v_#valid_9[#res!base] == 0) && v_#valid_9[0] == 0) && v_#valid_9[1] == 1) && #res!base + 1 <= #StackHeapBarrier) && (exists v_#memory_$Pointer$.offset_41 : [int,int]int, v_#memory_$Pointer$.offset_28 : [int,int]int :: v_#memory_$Pointer$.offset_28 == v_#memory_$Pointer$.offset_41[#res!base := v_#memory_$Pointer$.offset_41[#res!base][4 := 0][0 := v_#memory_$Pointer$.offset_28[#res!base][0]]] && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_28[~new_head~0!base := v_#memory_$Pointer$.offset_28[~new_head~0!base][4 := 0]])) && (exists v_#memory_int_51 : [int,int]int, v_#memory_int_36 : [int,int]int :: ((v_#memory_int_51[1][1] == 0 && v_#memory_int_51[1][0] == 48) && v_#memory_int_36 == v_#memory_int_51[#res!base := v_#memory_int_51[#res!base][4 := v_#memory_int_36[#res!base][4]]]) && #memory_int == v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base := v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base][4 := #memory_int[~new_head~0!base][4]]])) && (exists v_#length_7 : [int]int :: (#length == v_#length_7[#res!base := 8] && v_#length_7[2] == 19) && 2 == v_#length_7[1])) && (exists v_#memory_$Pointer$.base_41 : [int,int]int, v_#memory_$Pointer$.base_28 : [int,int]int :: #memory_$Pointer$.base == v_#memory_$Pointer$.base_28[~new_head~0!base := v_#memory_$Pointer$.base_28[~new_head~0!base][4 := 0]] && v_#memory_$Pointer$.base_41[#res!base := v_#memory_$Pointer$.base_41[#res!base][4 := 0][0 := v_#memory_$Pointer$.base_28[#res!base][0]]] == v_#memory_$Pointer$.base_28)) && !(#res!base == 0)) && ~head~0!base == ~new_head~0!base) && ~len == 1) && #res!base == ~new_head~0!base) && 2 == v_ULTIMATE.start_sll_create_~len#1_24)) could not be translated [2023-12-02 15:45:15,505 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_sll_create_~len#1_78 : int :: ((((((((((((!(#memory_$Pointer$.base[~new_head~0!base][4] == 0) && (exists v_#memory_$Pointer$.offset_28 : [int,int]int, v_#memory_$Pointer$.offset_143 : [int,int]int, v_#memory_$Pointer$.offset_145 : [int,int]int :: (v_#memory_$Pointer$.offset_143[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_143[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0][0 := v_#memory_$Pointer$.offset_145[#memory_$Pointer$.base[~new_head~0!base][4]][0]]] == v_#memory_$Pointer$.offset_145 && v_#memory_$Pointer$.offset_145[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_145[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base := v_#memory_$Pointer$.offset_145[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_145[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base][4 := 0][0 := v_#memory_$Pointer$.offset_28[#res!base][0]]] == v_#memory_$Pointer$.offset_28) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_28[~new_head~0!base := v_#memory_$Pointer$.offset_28[~new_head~0!base][4 := 0]])) && #res!base + 1 <= #StackHeapBarrier) && (exists v_#memory_$Pointer$.base_28 : [int,int]int, v_#memory_$Pointer$.base_145 : [int,int]int, v_#memory_$Pointer$.base_143 : [int,int]int :: (#memory_$Pointer$.base == v_#memory_$Pointer$.base_28[~new_head~0!base := v_#memory_$Pointer$.base_28[~new_head~0!base][4 := #memory_$Pointer$.base[~new_head~0!base][4]]] && v_#memory_$Pointer$.base_145[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_145[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base := v_#memory_$Pointer$.base_145[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_145[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base][4 := 0][0 := v_#memory_$Pointer$.base_28[#res!base][0]]] == v_#memory_$Pointer$.base_28) && v_#memory_$Pointer$.base_143[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_143[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0][0 := v_#memory_$Pointer$.base_145[#memory_$Pointer$.base[~new_head~0!base][4]][0]]] == v_#memory_$Pointer$.base_145)) && !(#res!base == 0)) && (exists v_#length_52 : [int]int :: (2 == v_#length_52[1] && 19 == v_#length_52[2]) && #length == v_#length_52[#memory_$Pointer$.base[~new_head~0!base][4] := 8][#res!base := 8])) && ~head~0!base == ~new_head~0!base) && #res!base == ~new_head~0!base) && ~len == 0) && (exists v_#memory_int_36 : [int,int]int, v_#memory_int_154 : [int,int]int, v_#memory_int_155 : [int,int]int, v_#memory_int_153 : [int,int]int :: ((((v_#memory_int_155[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_int_155[#memory_$Pointer$.base[~new_head~0!base][4]][0 := 1][4 := v_#memory_int_154[#memory_$Pointer$.base[~new_head~0!base][4]][4]]] == v_#memory_int_154 && v_#memory_int_155 == v_#memory_int_153[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_int_153[#memory_$Pointer$.base[~new_head~0!base][4]][4 := v_#memory_int_155[#memory_$Pointer$.base[~new_head~0!base][4]][4]]]) && v_#memory_int_153[1][1] == 0) && 48 == v_#memory_int_153[1][0]) && v_#memory_int_36 == v_#memory_int_154[#res!base := v_#memory_int_154[#res!base][4 := v_#memory_int_36[#res!base][4]]]) && #memory_int == v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base := v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base][4 := #memory_int[~new_head~0!base][4]]])) && v_ULTIMATE.start_sll_create_~len#1_78 == 1) && (exists v_#valid_54 : [int]int :: ((((v_#valid_54[1] == 1 && #valid == v_#valid_54[#memory_$Pointer$.base[~new_head~0!base][4] := 1][#res!base := 1]) && v_#valid_54[2] == 1) && 0 == v_#valid_54[#memory_$Pointer$.base[~new_head~0!base][4] := 1][#res!base]) && v_#valid_54[0] == 0) && v_#valid_54[#memory_$Pointer$.base[~new_head~0!base][4]] == 0)) && #memory_$Pointer$.base[~new_head~0!base][4] + 1 <= #StackHeapBarrier) || (((((((((((exists v_#memory_int_36 : [int,int]int, v_#memory_int_153 : [int,int]int :: ((v_#memory_int_153[#res!base := v_#memory_int_153[#res!base][4 := v_#memory_int_36[#res!base][4]]] == v_#memory_int_36 && v_#memory_int_153[1][1] == 0) && 48 == v_#memory_int_153[1][0]) && #memory_int == v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base := v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base][4 := #memory_int[~new_head~0!base][4]]]) && #res!base + 1 <= #StackHeapBarrier) && (exists v_#length_52 : [int]int :: (2 == v_#length_52[1] && 19 == v_#length_52[2]) && #length == v_#length_52[#res!base := 8])) && 2 == v_ULTIMATE.start_sll_create_~len#1_78) && (exists v_#memory_$Pointer$.offset_28 : [int,int]int, v_#memory_$Pointer$.offset_143 : [int,int]int :: v_#memory_$Pointer$.offset_143[#res!base := v_#memory_$Pointer$.offset_143[#res!base][4 := 0][0 := v_#memory_$Pointer$.offset_28[#res!base][0]]] == v_#memory_$Pointer$.offset_28 && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_28[~new_head~0!base := v_#memory_$Pointer$.offset_28[~new_head~0!base][4 := 0]])) && (exists v_#memory_$Pointer$.base_28 : [int,int]int, v_#memory_$Pointer$.base_143 : [int,int]int :: #memory_$Pointer$.base == v_#memory_$Pointer$.base_28[~new_head~0!base := v_#memory_$Pointer$.base_28[~new_head~0!base][4 := 0]] && v_#memory_$Pointer$.base_143[#res!base := v_#memory_$Pointer$.base_143[#res!base][4 := 0][0 := v_#memory_$Pointer$.base_28[#res!base][0]]] == v_#memory_$Pointer$.base_28)) && !(#res!base == 0)) && ~head~0!base == ~new_head~0!base) && ~len == 1) && #res!base == ~new_head~0!base) && (exists v_#valid_54 : [int]int :: (((v_#valid_54[1] == 1 && v_#valid_54[#res!base] == 0) && v_#valid_54[2] == 1) && v_#valid_54[#res!base := 1] == #valid) && v_#valid_54[0] == 0))) could not be translated [2023-12-02 15:45:15,508 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:45:15,508 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~0#1_58 : int :: ((((~s~0!base == #res!base && 2 == ~i~0) && v_ULTIMATE.start_main_~i~0#1_58 == 1) && 3 == ~new_data~0) && (exists v_#memory_$Pointer$.base_97 : [int,int]int, v_#memory_$Pointer$.base_96 : [int,int]int, v_#memory_$Pointer$.offset_97 : [int,int]int, v_#memory_$Pointer$.offset_96 : [int,int]int, v_#memory_int_106 : [int,int]int :: (((v_#memory_$Pointer$.base_97 == v_#memory_$Pointer$.base_96[~s~0!base := v_#memory_$Pointer$.base_96[~s~0!base][0 := v_#memory_$Pointer$.base_97[~s~0!base][0]]] && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_97[v_#memory_$Pointer$.base_97[~s~0!base][4] := v_#memory_$Pointer$.offset_97[v_#memory_$Pointer$.base_97[~s~0!base][4]][v_#memory_$Pointer$.offset_97[~s~0!base][4] := #memory_$Pointer$.offset[v_#memory_$Pointer$.base_97[~s~0!base][4]][v_#memory_$Pointer$.offset_97[~s~0!base][4]]]]) && v_#memory_$Pointer$.offset_96[~s~0!base := v_#memory_$Pointer$.offset_96[~s~0!base][0 := v_#memory_$Pointer$.offset_97[~s~0!base][0]]] == v_#memory_$Pointer$.offset_97) && #memory_$Pointer$.base == v_#memory_$Pointer$.base_97[v_#memory_$Pointer$.base_97[~s~0!base][4] := v_#memory_$Pointer$.base_97[v_#memory_$Pointer$.base_97[~s~0!base][4]][v_#memory_$Pointer$.offset_97[~s~0!base][4] := #memory_$Pointer$.base[v_#memory_$Pointer$.base_97[~s~0!base][4]][v_#memory_$Pointer$.offset_97[~s~0!base][4]]]]) && #memory_int == v_#memory_int_106[~s~0!base := v_#memory_int_106[~s~0!base][0 := 2]][v_#memory_$Pointer$.base_97[~s~0!base][4] := v_#memory_int_106[~s~0!base := v_#memory_int_106[~s~0!base][0 := 2]][v_#memory_$Pointer$.base_97[~s~0!base][4]][v_#memory_$Pointer$.offset_97[~s~0!base][4] := 3]])) || ((((((~s~0!base == #res!base && v_ULTIMATE.start_main_~i~0#1_58 == 0) && (exists v_#memory_$Pointer$.base_96 : [int,int]int :: #memory_$Pointer$.base == v_#memory_$Pointer$.base_96[~s~0!base := v_#memory_$Pointer$.base_96[~s~0!base][0 := #memory_$Pointer$.base[~s~0!base][0]]])) && (exists v_#memory_int_106 : [int,int]int :: #memory_int == v_#memory_int_106[~s~0!base := v_#memory_int_106[~s~0!base][0 := 2]])) && ~i~0 == 1) && (exists v_#memory_$Pointer$.offset_96 : [int,int]int :: #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_96[~s~0!base := v_#memory_$Pointer$.offset_96[~s~0!base][0 := #memory_$Pointer$.offset[~s~0!base][0]]])) && 2 == ~new_data~0)) could not be translated [2023-12-02 15:45:15,509 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:45:15,509 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:45:15,510 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:45:15,510 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:45:15,510 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-12-02 15:45:15,510 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-12-02 15:45:15,511 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:45:15,511 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~data~0 [2023-12-02 15:45:15,511 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-12-02 15:45:15,511 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-12-02 15:45:15,511 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-12-02 15:45:15,513 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~new_data~0 [2023-12-02 15:45:15,513 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:45:15,513 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#in~head!base][4] could not be translated [2023-12-02 15:45:15,514 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#in~head!base][4] could not be translated [2023-12-02 15:45:15,514 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:45:15,514 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~new_data~0#1_48 : int :: ~i~0 == 1 && v_ULTIMATE.start_main_~new_data~0#1_48 == 2) could not be translated [2023-12-02 15:45:15,514 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:45:15,515 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-12-02 15:45:15,515 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-12-02 15:45:15,515 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~new_data~0 [2023-12-02 15:45:15,515 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-12-02 15:45:15,515 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~new_data~0 [2023-12-02 15:45:15,516 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:45:15,516 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:45:15,516 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:45:15,516 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-12-02 15:45:15,516 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:45:15,517 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-12-02 15:45:15,517 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~new_data~0 [2023-12-02 15:45:15,517 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-12-02 15:45:15,517 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:45:15,517 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~new_data~0#1_24 : int :: ((((~s~0!base == #res!base && (exists v_#memory_$Pointer$.base_96 : [int,int]int :: #memory_$Pointer$.base == v_#memory_$Pointer$.base_96[~s~0!base := v_#memory_$Pointer$.base_96[~s~0!base][0 := #memory_$Pointer$.base[~s~0!base][0]]])) && (exists v_#memory_int_106 : [int,int]int :: #memory_int == v_#memory_int_106[~s~0!base := v_#memory_int_106[~s~0!base][0 := 2]])) && (exists v_#memory_$Pointer$.offset_96 : [int,int]int :: #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_96[~s~0!base := v_#memory_$Pointer$.offset_96[~s~0!base][0 := #memory_$Pointer$.offset[~s~0!base][0]]])) || (~s~0!base == #res!base && ~i~0 == 0)) && ((~i~0 == 1 && v_ULTIMATE.start_main_~new_data~0#1_24 == 2) || ~i~0 == 0)) could not be translated [2023-12-02 15:45:15,517 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:45:15,518 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:45:15,518 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-12-02 15:45:15,518 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:45:15,518 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:45:15,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 03:45:15 BoogieIcfgContainer [2023-12-02 15:45:15,519 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 15:45:15,520 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 15:45:15,520 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 15:45:15,520 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 15:45:15,520 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:38:00" (3/4) ... [2023-12-02 15:45:15,522 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-12-02 15:45:15,531 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2023-12-02 15:45:15,532 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-12-02 15:45:15,532 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-12-02 15:45:15,533 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-12-02 15:45:15,560 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 == 2)) && (data == 1)) && (\old(data) == 1))) [2023-12-02 15:45:15,561 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((index + 1) == \old(index)) && (data == \old(data))) || ((index == \old(index)) && (data == \old(data)))) && (data == 1)) [2023-12-02 15:45:15,562 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((index <= 1) && (0 <= index)) && (0 <= \old(index))) && (\old(index) <= 1)) [2023-12-02 15:45:15,581 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 == 2)) && (data == 1)) && (\old(data) == 1))) [2023-12-02 15:45:15,584 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((index + 1) == \old(index)) && (data == \old(data))) || ((index == \old(index)) && (data == \old(data)))) && (data == 1)) [2023-12-02 15:45:15,584 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((index <= 1) && (0 <= index)) && (0 <= \old(index))) && (\old(index) <= 1)) [2023-12-02 15:45:15,629 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/witness.graphml [2023-12-02 15:45:15,629 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/witness.yml [2023-12-02 15:45:15,629 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 15:45:15,630 INFO L158 Benchmark]: Toolchain (without parser) took 436448.73ms. Allocated memory was 161.5MB in the beginning and 234.9MB in the end (delta: 73.4MB). Free memory was 128.4MB in the beginning and 158.4MB in the end (delta: -30.0MB). Peak memory consumption was 44.9MB. Max. memory is 16.1GB. [2023-12-02 15:45:15,630 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 109.1MB. Free memory is still 60.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 15:45:15,631 INFO L158 Benchmark]: CACSL2BoogieTranslator took 388.43ms. Allocated memory is still 161.5MB. Free memory was 128.4MB in the beginning and 110.9MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-12-02 15:45:15,631 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.56ms. Allocated memory is still 161.5MB. Free memory was 110.9MB in the beginning and 108.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 15:45:15,631 INFO L158 Benchmark]: Boogie Preprocessor took 34.30ms. Allocated memory is still 161.5MB. Free memory was 108.8MB in the beginning and 107.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 15:45:15,631 INFO L158 Benchmark]: RCFGBuilder took 414.66ms. Allocated memory is still 161.5MB. Free memory was 107.1MB in the beginning and 86.5MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-12-02 15:45:15,632 INFO L158 Benchmark]: TraceAbstraction took 435447.62ms. Allocated memory was 161.5MB in the beginning and 234.9MB in the end (delta: 73.4MB). Free memory was 85.7MB in the beginning and 164.7MB in the end (delta: -79.0MB). Peak memory consumption was 105.7MB. Max. memory is 16.1GB. [2023-12-02 15:45:15,632 INFO L158 Benchmark]: Witness Printer took 109.85ms. Allocated memory is still 234.9MB. Free memory was 164.7MB in the beginning and 158.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-12-02 15:45:15,634 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 109.1MB. Free memory is still 60.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 388.43ms. Allocated memory is still 161.5MB. Free memory was 128.4MB in the beginning and 110.9MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.56ms. Allocated memory is still 161.5MB. Free memory was 110.9MB in the beginning and 108.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.30ms. Allocated memory is still 161.5MB. Free memory was 108.8MB in the beginning and 107.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 414.66ms. Allocated memory is still 161.5MB. Free memory was 107.1MB in the beginning and 86.5MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 435447.62ms. Allocated memory was 161.5MB in the beginning and 234.9MB in the end (delta: 73.4MB). Free memory was 85.7MB in the beginning and 164.7MB in the end (delta: -79.0MB). Peak memory consumption was 105.7MB. Max. memory is 16.1GB. * Witness Printer took 109.85ms. Allocated memory is still 234.9MB. Free memory was 164.7MB in the beginning and 158.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #length[1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #length[2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[2] 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: QuantifierExpression (exists v_ULTIMATE.start_sll_create_~len#1_66 : int :: ((((((((((((!(#memory_$Pointer$.base[~new_head~0!base][4] == 0) && #res!base + 1 <= #StackHeapBarrier) && (exists v_#valid_44 : [int]int :: ((((v_#valid_44[#memory_$Pointer$.base[~new_head~0!base][4] := 1][#res!base := 1] == #valid && v_#valid_44[2] == 1) && v_#valid_44[#memory_$Pointer$.base[~new_head~0!base][4]] == 0) && v_#valid_44[0] == 0) && v_#valid_44[1] == 1) && v_#valid_44[#memory_$Pointer$.base[~new_head~0!base][4] := 1][#res!base] == 0)) && (exists v_#memory_$Pointer$.base_119 : [int,int]int, v_#memory_$Pointer$.base_117 : [int,int]int, v_#memory_$Pointer$.base_28 : [int,int]int :: (#memory_$Pointer$.base == v_#memory_$Pointer$.base_28[~new_head~0!base := v_#memory_$Pointer$.base_28[~new_head~0!base][4 := #memory_$Pointer$.base[~new_head~0!base][4]]] && v_#memory_$Pointer$.base_117[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_117[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0][0 := v_#memory_$Pointer$.base_119[#memory_$Pointer$.base[~new_head~0!base][4]][0]]] == v_#memory_$Pointer$.base_119) && v_#memory_$Pointer$.base_119[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_119[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base := v_#memory_$Pointer$.base_119[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_119[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base][4 := 0][0 := v_#memory_$Pointer$.base_28[#res!base][0]]] == v_#memory_$Pointer$.base_28)) && (exists v_#length_42 : [int]int :: (19 == v_#length_42[2] && v_#length_42[1] == 2) && #length == v_#length_42[#memory_$Pointer$.base[~new_head~0!base][4] := 8][#res!base := 8])) && (exists v_#memory_$Pointer$.offset_117 : [int,int]int, v_#memory_$Pointer$.offset_119 : [int,int]int, v_#memory_$Pointer$.offset_28 : [int,int]int :: (v_#memory_$Pointer$.offset_117[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_117[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0][0 := v_#memory_$Pointer$.offset_119[#memory_$Pointer$.base[~new_head~0!base][4]][0]]] == v_#memory_$Pointer$.offset_119 && v_#memory_$Pointer$.offset_119[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_119[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base := v_#memory_$Pointer$.offset_119[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_119[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base][4 := 0][0 := v_#memory_$Pointer$.offset_28[#res!base][0]]] == v_#memory_$Pointer$.offset_28) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_28[~new_head~0!base := v_#memory_$Pointer$.offset_28[~new_head~0!base][4 := 0]])) && !(#res!base == 0)) && ~head~0!base == ~new_head~0!base) && #res!base == ~new_head~0!base) && ~len == 0) && (exists v_#memory_int_129 : [int,int]int, v_#memory_int_127 : [int,int]int, v_#memory_int_128 : [int,int]int, v_#memory_int_36 : [int,int]int :: ((((v_#memory_int_36 == v_#memory_int_128[#res!base := v_#memory_int_128[#res!base][4 := v_#memory_int_36[#res!base][4]]] && v_#memory_int_129[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_int_129[#memory_$Pointer$.base[~new_head~0!base][4]][0 := 1][4 := v_#memory_int_128[#memory_$Pointer$.base[~new_head~0!base][4]][4]]] == v_#memory_int_128) && v_#memory_int_127[1][1] == 0) && #memory_int == v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base := v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base][4 := #memory_int[~new_head~0!base][4]]]) && 48 == v_#memory_int_127[1][0]) && v_#memory_int_127[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_int_127[#memory_$Pointer$.base[~new_head~0!base][4]][4 := v_#memory_int_129[#memory_$Pointer$.base[~new_head~0!base][4]][4]]] == v_#memory_int_129)) && v_ULTIMATE.start_sll_create_~len#1_66 == 1) && #memory_$Pointer$.base[~new_head~0!base][4] + 1 <= #StackHeapBarrier) || ((((((((((#res!base + 1 <= #StackHeapBarrier && (exists v_#valid_44 : [int]int :: (((v_#valid_44[2] == 1 && v_#valid_44[0] == 0) && v_#valid_44[#res!base] == 0) && v_#valid_44[1] == 1) && v_#valid_44[#res!base := 1] == #valid)) && (exists v_#memory_int_127 : [int,int]int, v_#memory_int_36 : [int,int]int :: ((v_#memory_int_127[#res!base := v_#memory_int_127[#res!base][4 := v_#memory_int_36[#res!base][4]]] == v_#memory_int_36 && v_#memory_int_127[1][1] == 0) && #memory_int == v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base := v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base][4 := #memory_int[~new_head~0!base][4]]]) && 48 == v_#memory_int_127[1][0])) && (exists v_#memory_$Pointer$.offset_117 : [int,int]int, v_#memory_$Pointer$.offset_28 : [int,int]int :: v_#memory_$Pointer$.offset_28 == v_#memory_$Pointer$.offset_117[#res!base := v_#memory_$Pointer$.offset_117[#res!base][4 := 0][0 := v_#memory_$Pointer$.offset_28[#res!base][0]]] && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_28[~new_head~0!base := v_#memory_$Pointer$.offset_28[~new_head~0!base][4 := 0]])) && !(#res!base == 0)) && ~head~0!base == ~new_head~0!base) && ~len == 1) && #res!base == ~new_head~0!base) && 2 == v_ULTIMATE.start_sll_create_~len#1_66) && (exists v_#length_42 : [int]int :: (19 == v_#length_42[2] && v_#length_42[1] == 2) && v_#length_42[#res!base := 8] == #length)) && (exists v_#memory_$Pointer$.base_117 : [int,int]int, v_#memory_$Pointer$.base_28 : [int,int]int :: #memory_$Pointer$.base == v_#memory_$Pointer$.base_28[~new_head~0!base := v_#memory_$Pointer$.base_28[~new_head~0!base][4 := 0]] && v_#memory_$Pointer$.base_117[#res!base := v_#memory_$Pointer$.base_117[#res!base][4 := 0][0 := v_#memory_$Pointer$.base_28[#res!base][0]]] == v_#memory_$Pointer$.base_28))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_sll_create_~len#1_72 : int :: (((((((((((exists v_#valid_49 : [int]int :: (((v_#valid_49[1] == 1 && v_#valid_49[0] == 0) && v_#valid_49[#res!base] == 0) && v_#valid_49[#res!base := 1] == #valid) && v_#valid_49[2] == 1) && #res!base + 1 <= #StackHeapBarrier) && (exists v_#memory_$Pointer$.base_130 : [int,int]int, v_#memory_$Pointer$.base_28 : [int,int]int :: #memory_$Pointer$.base == v_#memory_$Pointer$.base_28[~new_head~0!base := v_#memory_$Pointer$.base_28[~new_head~0!base][4 := 0]] && v_#memory_$Pointer$.base_130[#res!base := v_#memory_$Pointer$.base_130[#res!base][4 := 0][0 := v_#memory_$Pointer$.base_28[#res!base][0]]] == v_#memory_$Pointer$.base_28)) && (exists v_#length_47 : [int]int :: (2 == v_#length_47[1] && 19 == v_#length_47[2]) && #length == v_#length_47[#res!base := 8])) && (exists v_#memory_int_36 : [int,int]int, v_#memory_int_140 : [int,int]int :: ((48 == v_#memory_int_140[1][0] && v_#memory_int_140[1][1] == 0) && #memory_int == v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base := v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base][4 := #memory_int[~new_head~0!base][4]]]) && v_#memory_int_36 == v_#memory_int_140[#res!base := v_#memory_int_140[#res!base][4 := v_#memory_int_36[#res!base][4]]])) && !(#res!base == 0)) && ~head~0!base == ~new_head~0!base) && 2 == v_ULTIMATE.start_sll_create_~len#1_72) && ~len == 1) && #res!base == ~new_head~0!base) && (exists v_#memory_$Pointer$.offset_130 : [int,int]int, v_#memory_$Pointer$.offset_28 : [int,int]int :: v_#memory_$Pointer$.offset_130[#res!base := v_#memory_$Pointer$.offset_130[#res!base][4 := 0][0 := v_#memory_$Pointer$.offset_28[#res!base][0]]] == v_#memory_$Pointer$.offset_28 && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_28[~new_head~0!base := v_#memory_$Pointer$.offset_28[~new_head~0!base][4 := 0]])) || ((((((((((((!(#memory_$Pointer$.base[~new_head~0!base][4] == 0) && (exists v_#valid_49 : [int]int :: ((((v_#valid_49[1] == 1 && #valid == v_#valid_49[#memory_$Pointer$.base[~new_head~0!base][4] := 1][#res!base := 1]) && v_#valid_49[0] == 0) && v_#valid_49[#memory_$Pointer$.base[~new_head~0!base][4] := 1][#res!base] == 0) && v_#valid_49[#memory_$Pointer$.base[~new_head~0!base][4]] == 0) && v_#valid_49[2] == 1)) && #res!base + 1 <= #StackHeapBarrier) && (exists v_#memory_int_36 : [int,int]int, v_#memory_int_140 : [int,int]int, v_#memory_int_141 : [int,int]int, v_#memory_int_142 : [int,int]int :: ((((v_#memory_int_36 == v_#memory_int_141[#res!base := v_#memory_int_141[#res!base][4 := v_#memory_int_36[#res!base][4]]] && 48 == v_#memory_int_140[1][0]) && v_#memory_int_140[1][1] == 0) && v_#memory_int_142[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_int_142[#memory_$Pointer$.base[~new_head~0!base][4]][0 := 1][4 := v_#memory_int_141[#memory_$Pointer$.base[~new_head~0!base][4]][4]]] == v_#memory_int_141) && v_#memory_int_140[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_int_140[#memory_$Pointer$.base[~new_head~0!base][4]][4 := v_#memory_int_142[#memory_$Pointer$.base[~new_head~0!base][4]][4]]] == v_#memory_int_142) && #memory_int == v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base := v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base][4 := #memory_int[~new_head~0!base][4]]])) && (exists v_#memory_$Pointer$.offset_130 : [int,int]int, v_#memory_$Pointer$.offset_28 : [int,int]int, v_#memory_$Pointer$.offset_132 : [int,int]int :: (v_#memory_$Pointer$.offset_132 == v_#memory_$Pointer$.offset_130[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_130[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0][0 := v_#memory_$Pointer$.offset_132[#memory_$Pointer$.base[~new_head~0!base][4]][0]]] && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_28[~new_head~0!base := v_#memory_$Pointer$.offset_28[~new_head~0!base][4 := 0]]) && v_#memory_$Pointer$.offset_132[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_132[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base := v_#memory_$Pointer$.offset_132[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_132[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base][4 := 0][0 := v_#memory_$Pointer$.offset_28[#res!base][0]]] == v_#memory_$Pointer$.offset_28)) && (exists v_#length_47 : [int]int :: (2 == v_#length_47[1] && 19 == v_#length_47[2]) && #length == v_#length_47[#memory_$Pointer$.base[~new_head~0!base][4] := 8][#res!base := 8])) && !(#res!base == 0)) && ~head~0!base == ~new_head~0!base) && #res!base == ~new_head~0!base) && (exists v_#memory_$Pointer$.base_130 : [int,int]int, v_#memory_$Pointer$.base_28 : [int,int]int, v_#memory_$Pointer$.base_132 : [int,int]int :: (v_#memory_$Pointer$.base_132 == v_#memory_$Pointer$.base_130[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_130[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0][0 := v_#memory_$Pointer$.base_132[#memory_$Pointer$.base[~new_head~0!base][4]][0]]] && #memory_$Pointer$.base == v_#memory_$Pointer$.base_28[~new_head~0!base := v_#memory_$Pointer$.base_28[~new_head~0!base][4 := #memory_$Pointer$.base[~new_head~0!base][4]]]) && v_#memory_$Pointer$.base_132[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_132[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base := v_#memory_$Pointer$.base_132[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_132[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base][4 := 0][0 := v_#memory_$Pointer$.base_28[#res!base][0]]] == v_#memory_$Pointer$.base_28)) && ~len == 0) && #memory_$Pointer$.base[~new_head~0!base][4] + 1 <= #StackHeapBarrier) && v_ULTIMATE.start_sll_create_~len#1_72 == 1)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_sll_create_~len#1_48 : int :: ((((((((((((!(#memory_$Pointer$.base[~new_head~0!base][4] == 0) && (exists v_#memory_int_36 : [int,int]int, v_#memory_int_90 : [int,int]int, v_#memory_int_91 : [int,int]int, v_#memory_int_92 : [int,int]int :: ((((v_#memory_int_91 == v_#memory_int_92[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_int_92[#memory_$Pointer$.base[~new_head~0!base][4]][0 := 1][4 := v_#memory_int_91[#memory_$Pointer$.base[~new_head~0!base][4]][4]]] && v_#memory_int_90[1][1] == 0) && 48 == v_#memory_int_90[1][0]) && v_#memory_int_90[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_int_90[#memory_$Pointer$.base[~new_head~0!base][4]][4 := v_#memory_int_92[#memory_$Pointer$.base[~new_head~0!base][4]][4]]] == v_#memory_int_92) && v_#memory_int_91[#res!base := v_#memory_int_91[#res!base][4 := v_#memory_int_36[#res!base][4]]] == v_#memory_int_36) && #memory_int == v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base := v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base][4 := #memory_int[~new_head~0!base][4]]])) && #res!base + 1 <= #StackHeapBarrier) && (exists v_#memory_$Pointer$.base_82 : [int,int]int, v_#memory_$Pointer$.base_28 : [int,int]int, v_#memory_$Pointer$.base_80 : [int,int]int :: (v_#memory_$Pointer$.base_80[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_80[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0][0 := v_#memory_$Pointer$.base_82[#memory_$Pointer$.base[~new_head~0!base][4]][0]]] == v_#memory_$Pointer$.base_82 && #memory_$Pointer$.base == v_#memory_$Pointer$.base_28[~new_head~0!base := v_#memory_$Pointer$.base_28[~new_head~0!base][4 := #memory_$Pointer$.base[~new_head~0!base][4]]]) && v_#memory_$Pointer$.base_28 == v_#memory_$Pointer$.base_82[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_82[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base := v_#memory_$Pointer$.base_82[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_82[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base][4 := 0][0 := v_#memory_$Pointer$.base_28[#res!base][0]]])) && (exists v_#length_27 : [int]int :: (v_#length_27[#memory_$Pointer$.base[~new_head~0!base][4] := 8][#res!base := 8] == #length && 19 == v_#length_27[2]) && v_#length_27[1] == 2)) && (exists v_#memory_$Pointer$.offset_28 : [int,int]int, v_#memory_$Pointer$.offset_80 : [int,int]int, v_#memory_$Pointer$.offset_82 : [int,int]int :: (v_#memory_$Pointer$.offset_82[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_82[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base := v_#memory_$Pointer$.offset_82[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_82[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base][4 := 0][0 := v_#memory_$Pointer$.offset_28[#res!base][0]]] == v_#memory_$Pointer$.offset_28 && v_#memory_$Pointer$.offset_80[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_80[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0][0 := v_#memory_$Pointer$.offset_82[#memory_$Pointer$.base[~new_head~0!base][4]][0]]] == v_#memory_$Pointer$.offset_82) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_28[~new_head~0!base := v_#memory_$Pointer$.offset_28[~new_head~0!base][4 := 0]])) && !(#res!base == 0)) && ~head~0!base == ~new_head~0!base) && #res!base == ~new_head~0!base) && (exists v_#valid_29 : [int]int :: ((((v_#valid_29[2] == 1 && v_#valid_29[#memory_$Pointer$.base[~new_head~0!base][4]] == 0) && v_#valid_29[1] == 1) && v_#valid_29[#memory_$Pointer$.base[~new_head~0!base][4] := 1][#res!base] == 0) && v_#valid_29[#memory_$Pointer$.base[~new_head~0!base][4] := 1][#res!base := 1] == #valid) && v_#valid_29[0] == 0)) && ~len == 0) && #memory_$Pointer$.base[~new_head~0!base][4] + 1 <= #StackHeapBarrier) && v_ULTIMATE.start_sll_create_~len#1_48 == 1) || ((((((((((#res!base + 1 <= #StackHeapBarrier && (exists v_#valid_29 : [int]int :: (((v_#valid_29[2] == 1 && v_#valid_29[1] == 1) && v_#valid_29[#res!base] == 0) && v_#valid_29[#res!base := 1] == #valid) && v_#valid_29[0] == 0)) && !(#res!base == 0)) && ~head~0!base == ~new_head~0!base) && 2 == v_ULTIMATE.start_sll_create_~len#1_48) && (exists v_#length_27 : [int]int :: (19 == v_#length_27[2] && v_#length_27[1] == 2) && #length == v_#length_27[#res!base := 8])) && ~len == 1) && #res!base == ~new_head~0!base) && (exists v_#memory_$Pointer$.base_28 : [int,int]int, v_#memory_$Pointer$.base_80 : [int,int]int :: #memory_$Pointer$.base == v_#memory_$Pointer$.base_28[~new_head~0!base := v_#memory_$Pointer$.base_28[~new_head~0!base][4 := 0]] && v_#memory_$Pointer$.base_80[#res!base := v_#memory_$Pointer$.base_80[#res!base][4 := 0][0 := v_#memory_$Pointer$.base_28[#res!base][0]]] == v_#memory_$Pointer$.base_28)) && (exists v_#memory_int_36 : [int,int]int, v_#memory_int_90 : [int,int]int :: ((v_#memory_int_90[1][1] == 0 && 48 == v_#memory_int_90[1][0]) && v_#memory_int_36 == v_#memory_int_90[#res!base := v_#memory_int_90[#res!base][4 := v_#memory_int_36[#res!base][4]]]) && #memory_int == v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base := v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base][4 := #memory_int[~new_head~0!base][4]]])) && (exists v_#memory_$Pointer$.offset_28 : [int,int]int, v_#memory_$Pointer$.offset_80 : [int,int]int :: v_#memory_$Pointer$.offset_80[#res!base := v_#memory_$Pointer$.offset_80[#res!base][4 := 0][0 := v_#memory_$Pointer$.offset_28[#res!base][0]]] == v_#memory_$Pointer$.offset_28 && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_28[~new_head~0!base := v_#memory_$Pointer$.offset_28[~new_head~0!base][4 := 0]]))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_sll_create_~len#1_30 : int :: ((((((((((#res!base + 1 <= #StackHeapBarrier && (exists v_#memory_int_36 : [int,int]int, v_#memory_int_59 : [int,int]int :: ((v_#memory_int_36 == v_#memory_int_59[#res!base := v_#memory_int_59[#res!base][4 := v_#memory_int_36[#res!base][4]]] && 48 == v_#memory_int_59[1][0]) && v_#memory_int_59[1][1] == 0) && #memory_int == v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base := v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base][4 := #memory_int[~new_head~0!base][4]]])) && (exists v_#valid_14 : [int]int :: (((v_#valid_14[#res!base := 1] == #valid && v_#valid_14[0] == 0) && v_#valid_14[1] == 1) && v_#valid_14[#res!base] == 0) && v_#valid_14[2] == 1)) && (exists v_#memory_$Pointer$.offset_28 : [int,int]int, v_#memory_$Pointer$.offset_49 : [int,int]int :: v_#memory_$Pointer$.offset_49[#res!base := v_#memory_$Pointer$.offset_49[#res!base][4 := 0][0 := v_#memory_$Pointer$.offset_28[#res!base][0]]] == v_#memory_$Pointer$.offset_28 && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_28[~new_head~0!base := v_#memory_$Pointer$.offset_28[~new_head~0!base][4 := 0]])) && 2 == v_ULTIMATE.start_sll_create_~len#1_30) && !(#res!base == 0)) && ~head~0!base == ~new_head~0!base) && ~len == 1) && #res!base == ~new_head~0!base) && (exists v_#memory_$Pointer$.base_28 : [int,int]int, v_#memory_$Pointer$.base_49 : [int,int]int :: #memory_$Pointer$.base == v_#memory_$Pointer$.base_28[~new_head~0!base := v_#memory_$Pointer$.base_28[~new_head~0!base][4 := 0]] && v_#memory_$Pointer$.base_28 == v_#memory_$Pointer$.base_49[#res!base := v_#memory_$Pointer$.base_49[#res!base][4 := 0][0 := v_#memory_$Pointer$.base_28[#res!base][0]]])) && (exists v_#length_12 : [int]int :: (2 == v_#length_12[1] && 19 == v_#length_12[2]) && #length == v_#length_12[#res!base := 8])) || ((((((((((((!(#memory_$Pointer$.base[~new_head~0!base][4] == 0) && #res!base + 1 <= #StackHeapBarrier) && (exists v_#memory_int_36 : [int,int]int, v_#memory_int_59 : [int,int]int, v_#memory_int_60 : [int,int]int, v_#memory_int_61 : [int,int]int :: ((((v_#memory_int_61 == v_#memory_int_59[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_int_59[#memory_$Pointer$.base[~new_head~0!base][4]][4 := v_#memory_int_61[#memory_$Pointer$.base[~new_head~0!base][4]][4]]] && v_#memory_int_61[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_int_61[#memory_$Pointer$.base[~new_head~0!base][4]][0 := 1][4 := v_#memory_int_60[#memory_$Pointer$.base[~new_head~0!base][4]][4]]] == v_#memory_int_60) && v_#memory_int_60[#res!base := v_#memory_int_60[#res!base][4 := v_#memory_int_36[#res!base][4]]] == v_#memory_int_36) && 48 == v_#memory_int_59[1][0]) && v_#memory_int_59[1][1] == 0) && #memory_int == v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base := v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base][4 := #memory_int[~new_head~0!base][4]]])) && v_ULTIMATE.start_sll_create_~len#1_30 == 1) && (exists v_#valid_14 : [int]int :: ((((v_#valid_14[#memory_$Pointer$.base[~new_head~0!base][4]] == 0 && #valid == v_#valid_14[#memory_$Pointer$.base[~new_head~0!base][4] := 1][#res!base := 1]) && v_#valid_14[#memory_$Pointer$.base[~new_head~0!base][4] := 1][#res!base] == 0) && v_#valid_14[0] == 0) && v_#valid_14[1] == 1) && v_#valid_14[2] == 1)) && (exists v_#memory_$Pointer$.base_51 : [int,int]int, v_#memory_$Pointer$.base_28 : [int,int]int, v_#memory_$Pointer$.base_49 : [int,int]int :: (v_#memory_$Pointer$.base_49[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_49[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0][0 := v_#memory_$Pointer$.base_51[#memory_$Pointer$.base[~new_head~0!base][4]][0]]] == v_#memory_$Pointer$.base_51 && #memory_$Pointer$.base == v_#memory_$Pointer$.base_28[~new_head~0!base := v_#memory_$Pointer$.base_28[~new_head~0!base][4 := #memory_$Pointer$.base[~new_head~0!base][4]]]) && v_#memory_$Pointer$.base_28 == v_#memory_$Pointer$.base_51[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_51[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base := v_#memory_$Pointer$.base_51[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_51[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base][4 := 0][0 := v_#memory_$Pointer$.base_28[#res!base][0]]])) && !(#res!base == 0)) && ~head~0!base == ~new_head~0!base) && #res!base == ~new_head~0!base) && ~len == 0) && (exists v_#length_12 : [int]int :: (2 == v_#length_12[1] && v_#length_12[#memory_$Pointer$.base[~new_head~0!base][4] := 8][#res!base := 8] == #length) && 19 == v_#length_12[2])) && (exists v_#memory_$Pointer$.offset_51 : [int,int]int, v_#memory_$Pointer$.offset_28 : [int,int]int, v_#memory_$Pointer$.offset_49 : [int,int]int :: (v_#memory_$Pointer$.offset_49[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_49[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0][0 := v_#memory_$Pointer$.offset_51[#memory_$Pointer$.base[~new_head~0!base][4]][0]]] == v_#memory_$Pointer$.offset_51 && v_#memory_$Pointer$.offset_51[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_51[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base := v_#memory_$Pointer$.offset_51[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_51[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base][4 := 0][0 := v_#memory_$Pointer$.offset_28[#res!base][0]]] == v_#memory_$Pointer$.offset_28) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_28[~new_head~0!base := v_#memory_$Pointer$.offset_28[~new_head~0!base][4 := 0]])) && #memory_$Pointer$.base[~new_head~0!base][4] + 1 <= #StackHeapBarrier)) 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 v_ULTIMATE.start_sll_create_~len#1_60 : int :: ((((((((((((!(#memory_$Pointer$.base[~new_head~0!base][4] == 0) && #res!base + 1 <= #StackHeapBarrier) && (exists v_#memory_int_114 : [int,int]int, v_#memory_int_115 : [int,int]int, v_#memory_int_116 : [int,int]int, v_#memory_int_36 : [int,int]int :: ((((v_#memory_int_114[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_int_114[#memory_$Pointer$.base[~new_head~0!base][4]][4 := v_#memory_int_116[#memory_$Pointer$.base[~new_head~0!base][4]][4]]] == v_#memory_int_116 && v_#memory_int_116[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_int_116[#memory_$Pointer$.base[~new_head~0!base][4]][0 := 1][4 := v_#memory_int_115[#memory_$Pointer$.base[~new_head~0!base][4]][4]]] == v_#memory_int_115) && v_#memory_int_114[1][1] == 0) && 48 == v_#memory_int_114[1][0]) && v_#memory_int_115[#res!base := v_#memory_int_115[#res!base][4 := v_#memory_int_36[#res!base][4]]] == v_#memory_int_36) && #memory_int == v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base := v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base][4 := #memory_int[~new_head~0!base][4]]])) && !(#res!base == 0)) && (exists v_#memory_$Pointer$.offset_104 : [int,int]int, v_#memory_$Pointer$.offset_106 : [int,int]int, v_#memory_$Pointer$.offset_28 : [int,int]int :: (v_#memory_$Pointer$.offset_106[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_106[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base := v_#memory_$Pointer$.offset_106[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_106[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base][4 := 0][0 := v_#memory_$Pointer$.offset_28[#res!base][0]]] == v_#memory_$Pointer$.offset_28 && v_#memory_$Pointer$.offset_104[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_104[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0][0 := v_#memory_$Pointer$.offset_106[#memory_$Pointer$.base[~new_head~0!base][4]][0]]] == v_#memory_$Pointer$.offset_106) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_28[~new_head~0!base := v_#memory_$Pointer$.offset_28[~new_head~0!base][4 := 0]])) && (exists v_#length_37 : [int]int :: (2 == v_#length_37[1] && #length == v_#length_37[#memory_$Pointer$.base[~new_head~0!base][4] := 8][#res!base := 8]) && 19 == v_#length_37[2])) && ~head~0!base == ~new_head~0!base) && (exists v_#memory_$Pointer$.base_106 : [int,int]int, v_#memory_$Pointer$.base_28 : [int,int]int, v_#memory_$Pointer$.base_104 : [int,int]int :: (#memory_$Pointer$.base == v_#memory_$Pointer$.base_28[~new_head~0!base := v_#memory_$Pointer$.base_28[~new_head~0!base][4 := #memory_$Pointer$.base[~new_head~0!base][4]]] && v_#memory_$Pointer$.base_106 == v_#memory_$Pointer$.base_104[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_104[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0][0 := v_#memory_$Pointer$.base_106[#memory_$Pointer$.base[~new_head~0!base][4]][0]]]) && v_#memory_$Pointer$.base_106[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_106[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base := v_#memory_$Pointer$.base_106[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_106[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base][4 := 0][0 := v_#memory_$Pointer$.base_28[#res!base][0]]] == v_#memory_$Pointer$.base_28)) && #res!base == ~new_head~0!base) && v_ULTIMATE.start_sll_create_~len#1_60 == 1) && ~len == 0) && (exists v_#valid_39 : [int]int :: ((((v_#valid_39[0] == 0 && v_#valid_39[2] == 1) && v_#valid_39[1] == 1) && #valid == v_#valid_39[#memory_$Pointer$.base[~new_head~0!base][4] := 1][#res!base := 1]) && v_#valid_39[#memory_$Pointer$.base[~new_head~0!base][4]] == 0) && v_#valid_39[#memory_$Pointer$.base[~new_head~0!base][4] := 1][#res!base] == 0)) && #memory_$Pointer$.base[~new_head~0!base][4] + 1 <= #StackHeapBarrier) || ((((((((((#res!base + 1 <= #StackHeapBarrier && (exists v_#memory_int_114 : [int,int]int, v_#memory_int_36 : [int,int]int :: ((v_#memory_int_114[1][1] == 0 && v_#memory_int_36 == v_#memory_int_114[#res!base := v_#memory_int_114[#res!base][4 := v_#memory_int_36[#res!base][4]]]) && 48 == v_#memory_int_114[1][0]) && #memory_int == v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base := v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base][4 := #memory_int[~new_head~0!base][4]]])) && 2 == v_ULTIMATE.start_sll_create_~len#1_60) && (exists v_#valid_39 : [int]int :: (((v_#valid_39[0] == 0 && v_#valid_39[2] == 1) && v_#valid_39[1] == 1) && v_#valid_39[#res!base] == 0) && v_#valid_39[#res!base := 1] == #valid)) && (exists v_#memory_$Pointer$.offset_104 : [int,int]int, v_#memory_$Pointer$.offset_28 : [int,int]int :: v_#memory_$Pointer$.offset_104[#res!base := v_#memory_$Pointer$.offset_104[#res!base][4 := 0][0 := v_#memory_$Pointer$.offset_28[#res!base][0]]] == v_#memory_$Pointer$.offset_28 && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_28[~new_head~0!base := v_#memory_$Pointer$.offset_28[~new_head~0!base][4 := 0]])) && !(#res!base == 0)) && ~head~0!base == ~new_head~0!base) && ~len == 1) && (exists v_#length_37 : [int]int :: (2 == v_#length_37[1] && #length == v_#length_37[#res!base := 8]) && 19 == v_#length_37[2])) && #res!base == ~new_head~0!base) && (exists v_#memory_$Pointer$.base_28 : [int,int]int, v_#memory_$Pointer$.base_104 : [int,int]int :: #memory_$Pointer$.base == v_#memory_$Pointer$.base_28[~new_head~0!base := v_#memory_$Pointer$.base_28[~new_head~0!base][4 := 0]] && v_#memory_$Pointer$.base_104[#res!base := v_#memory_$Pointer$.base_104[#res!base][4 := 0][0 := v_#memory_$Pointer$.base_28[#res!base][0]]] == v_#memory_$Pointer$.base_28))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_sll_create_~len#1_24 : int :: ((((((((((((!(#memory_$Pointer$.base[~new_head~0!base][4] == 0) && #res!base + 1 <= #StackHeapBarrier) && (exists v_#memory_$Pointer$.offset_41 : [int,int]int, v_#memory_$Pointer$.offset_43 : [int,int]int, v_#memory_$Pointer$.offset_28 : [int,int]int :: (v_#memory_$Pointer$.offset_43[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_43[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base := v_#memory_$Pointer$.offset_43[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_43[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base][4 := 0][0 := v_#memory_$Pointer$.offset_28[#res!base][0]]] == v_#memory_$Pointer$.offset_28 && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_28[~new_head~0!base := v_#memory_$Pointer$.offset_28[~new_head~0!base][4 := 0]]) && v_#memory_$Pointer$.offset_43 == v_#memory_$Pointer$.offset_41[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_41[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0][0 := v_#memory_$Pointer$.offset_43[#memory_$Pointer$.base[~new_head~0!base][4]][0]]])) && (exists v_#memory_$Pointer$.base_41 : [int,int]int, v_#memory_$Pointer$.base_43 : [int,int]int, v_#memory_$Pointer$.base_28 : [int,int]int :: (v_#memory_$Pointer$.base_43[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_43[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base := v_#memory_$Pointer$.base_43[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_43[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base][4 := 0][0 := v_#memory_$Pointer$.base_28[#res!base][0]]] == v_#memory_$Pointer$.base_28 && #memory_$Pointer$.base == v_#memory_$Pointer$.base_28[~new_head~0!base := v_#memory_$Pointer$.base_28[~new_head~0!base][4 := #memory_$Pointer$.base[~new_head~0!base][4]]]) && v_#memory_$Pointer$.base_41[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_41[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0][0 := v_#memory_$Pointer$.base_43[#memory_$Pointer$.base[~new_head~0!base][4]][0]]] == v_#memory_$Pointer$.base_43)) && !(#res!base == 0)) && ~head~0!base == ~new_head~0!base) && #res!base == ~new_head~0!base) && (exists v_#length_7 : [int]int :: (v_#length_7[2] == 19 && 2 == v_#length_7[1]) && v_#length_7[#memory_$Pointer$.base[~new_head~0!base][4] := 8][#res!base := 8] == #length)) && v_ULTIMATE.start_sll_create_~len#1_24 == 1) && ~len == 0) && (exists v_#valid_9 : [int]int :: ((((v_#valid_9[2] == 1 && v_#valid_9[#memory_$Pointer$.base[~new_head~0!base][4]] == 0) && v_#valid_9[0] == 0) && v_#valid_9[1] == 1) && v_#valid_9[#memory_$Pointer$.base[~new_head~0!base][4] := 1][#res!base] == 0) && v_#valid_9[#memory_$Pointer$.base[~new_head~0!base][4] := 1][#res!base := 1] == #valid)) && #memory_$Pointer$.base[~new_head~0!base][4] + 1 <= #StackHeapBarrier) && (exists v_#memory_int_51 : [int,int]int, v_#memory_int_52 : [int,int]int, v_#memory_int_53 : [int,int]int, v_#memory_int_36 : [int,int]int :: ((((v_#memory_int_53 == v_#memory_int_51[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_int_51[#memory_$Pointer$.base[~new_head~0!base][4]][4 := v_#memory_int_53[#memory_$Pointer$.base[~new_head~0!base][4]][4]]] && v_#memory_int_53[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_int_53[#memory_$Pointer$.base[~new_head~0!base][4]][0 := 1][4 := v_#memory_int_52[#memory_$Pointer$.base[~new_head~0!base][4]][4]]] == v_#memory_int_52) && v_#memory_int_36 == v_#memory_int_52[#res!base := v_#memory_int_52[#res!base][4 := v_#memory_int_36[#res!base][4]]]) && v_#memory_int_51[1][1] == 0) && v_#memory_int_51[1][0] == 48) && #memory_int == v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base := v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base][4 := #memory_int[~new_head~0!base][4]]])) || (((((((((((exists v_#valid_9 : [int]int :: (((v_#valid_9[2] == 1 && v_#valid_9[#res!base := 1] == #valid) && v_#valid_9[#res!base] == 0) && v_#valid_9[0] == 0) && v_#valid_9[1] == 1) && #res!base + 1 <= #StackHeapBarrier) && (exists v_#memory_$Pointer$.offset_41 : [int,int]int, v_#memory_$Pointer$.offset_28 : [int,int]int :: v_#memory_$Pointer$.offset_28 == v_#memory_$Pointer$.offset_41[#res!base := v_#memory_$Pointer$.offset_41[#res!base][4 := 0][0 := v_#memory_$Pointer$.offset_28[#res!base][0]]] && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_28[~new_head~0!base := v_#memory_$Pointer$.offset_28[~new_head~0!base][4 := 0]])) && (exists v_#memory_int_51 : [int,int]int, v_#memory_int_36 : [int,int]int :: ((v_#memory_int_51[1][1] == 0 && v_#memory_int_51[1][0] == 48) && v_#memory_int_36 == v_#memory_int_51[#res!base := v_#memory_int_51[#res!base][4 := v_#memory_int_36[#res!base][4]]]) && #memory_int == v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base := v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base][4 := #memory_int[~new_head~0!base][4]]])) && (exists v_#length_7 : [int]int :: (#length == v_#length_7[#res!base := 8] && v_#length_7[2] == 19) && 2 == v_#length_7[1])) && (exists v_#memory_$Pointer$.base_41 : [int,int]int, v_#memory_$Pointer$.base_28 : [int,int]int :: #memory_$Pointer$.base == v_#memory_$Pointer$.base_28[~new_head~0!base := v_#memory_$Pointer$.base_28[~new_head~0!base][4 := 0]] && v_#memory_$Pointer$.base_41[#res!base := v_#memory_$Pointer$.base_41[#res!base][4 := 0][0 := v_#memory_$Pointer$.base_28[#res!base][0]]] == v_#memory_$Pointer$.base_28)) && !(#res!base == 0)) && ~head~0!base == ~new_head~0!base) && ~len == 1) && #res!base == ~new_head~0!base) && 2 == v_ULTIMATE.start_sll_create_~len#1_24)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_sll_create_~len#1_78 : int :: ((((((((((((!(#memory_$Pointer$.base[~new_head~0!base][4] == 0) && (exists v_#memory_$Pointer$.offset_28 : [int,int]int, v_#memory_$Pointer$.offset_143 : [int,int]int, v_#memory_$Pointer$.offset_145 : [int,int]int :: (v_#memory_$Pointer$.offset_143[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_143[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0][0 := v_#memory_$Pointer$.offset_145[#memory_$Pointer$.base[~new_head~0!base][4]][0]]] == v_#memory_$Pointer$.offset_145 && v_#memory_$Pointer$.offset_145[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_145[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base := v_#memory_$Pointer$.offset_145[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_145[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base][4 := 0][0 := v_#memory_$Pointer$.offset_28[#res!base][0]]] == v_#memory_$Pointer$.offset_28) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_28[~new_head~0!base := v_#memory_$Pointer$.offset_28[~new_head~0!base][4 := 0]])) && #res!base + 1 <= #StackHeapBarrier) && (exists v_#memory_$Pointer$.base_28 : [int,int]int, v_#memory_$Pointer$.base_145 : [int,int]int, v_#memory_$Pointer$.base_143 : [int,int]int :: (#memory_$Pointer$.base == v_#memory_$Pointer$.base_28[~new_head~0!base := v_#memory_$Pointer$.base_28[~new_head~0!base][4 := #memory_$Pointer$.base[~new_head~0!base][4]]] && v_#memory_$Pointer$.base_145[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_145[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base := v_#memory_$Pointer$.base_145[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_145[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base][4 := 0][0 := v_#memory_$Pointer$.base_28[#res!base][0]]] == v_#memory_$Pointer$.base_28) && v_#memory_$Pointer$.base_143[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_143[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0][0 := v_#memory_$Pointer$.base_145[#memory_$Pointer$.base[~new_head~0!base][4]][0]]] == v_#memory_$Pointer$.base_145)) && !(#res!base == 0)) && (exists v_#length_52 : [int]int :: (2 == v_#length_52[1] && 19 == v_#length_52[2]) && #length == v_#length_52[#memory_$Pointer$.base[~new_head~0!base][4] := 8][#res!base := 8])) && ~head~0!base == ~new_head~0!base) && #res!base == ~new_head~0!base) && ~len == 0) && (exists v_#memory_int_36 : [int,int]int, v_#memory_int_154 : [int,int]int, v_#memory_int_155 : [int,int]int, v_#memory_int_153 : [int,int]int :: ((((v_#memory_int_155[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_int_155[#memory_$Pointer$.base[~new_head~0!base][4]][0 := 1][4 := v_#memory_int_154[#memory_$Pointer$.base[~new_head~0!base][4]][4]]] == v_#memory_int_154 && v_#memory_int_155 == v_#memory_int_153[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_int_153[#memory_$Pointer$.base[~new_head~0!base][4]][4 := v_#memory_int_155[#memory_$Pointer$.base[~new_head~0!base][4]][4]]]) && v_#memory_int_153[1][1] == 0) && 48 == v_#memory_int_153[1][0]) && v_#memory_int_36 == v_#memory_int_154[#res!base := v_#memory_int_154[#res!base][4 := v_#memory_int_36[#res!base][4]]]) && #memory_int == v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base := v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base][4 := #memory_int[~new_head~0!base][4]]])) && v_ULTIMATE.start_sll_create_~len#1_78 == 1) && (exists v_#valid_54 : [int]int :: ((((v_#valid_54[1] == 1 && #valid == v_#valid_54[#memory_$Pointer$.base[~new_head~0!base][4] := 1][#res!base := 1]) && v_#valid_54[2] == 1) && 0 == v_#valid_54[#memory_$Pointer$.base[~new_head~0!base][4] := 1][#res!base]) && v_#valid_54[0] == 0) && v_#valid_54[#memory_$Pointer$.base[~new_head~0!base][4]] == 0)) && #memory_$Pointer$.base[~new_head~0!base][4] + 1 <= #StackHeapBarrier) || (((((((((((exists v_#memory_int_36 : [int,int]int, v_#memory_int_153 : [int,int]int :: ((v_#memory_int_153[#res!base := v_#memory_int_153[#res!base][4 := v_#memory_int_36[#res!base][4]]] == v_#memory_int_36 && v_#memory_int_153[1][1] == 0) && 48 == v_#memory_int_153[1][0]) && #memory_int == v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base := v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base][4 := #memory_int[~new_head~0!base][4]]]) && #res!base + 1 <= #StackHeapBarrier) && (exists v_#length_52 : [int]int :: (2 == v_#length_52[1] && 19 == v_#length_52[2]) && #length == v_#length_52[#res!base := 8])) && 2 == v_ULTIMATE.start_sll_create_~len#1_78) && (exists v_#memory_$Pointer$.offset_28 : [int,int]int, v_#memory_$Pointer$.offset_143 : [int,int]int :: v_#memory_$Pointer$.offset_143[#res!base := v_#memory_$Pointer$.offset_143[#res!base][4 := 0][0 := v_#memory_$Pointer$.offset_28[#res!base][0]]] == v_#memory_$Pointer$.offset_28 && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_28[~new_head~0!base := v_#memory_$Pointer$.offset_28[~new_head~0!base][4 := 0]])) && (exists v_#memory_$Pointer$.base_28 : [int,int]int, v_#memory_$Pointer$.base_143 : [int,int]int :: #memory_$Pointer$.base == v_#memory_$Pointer$.base_28[~new_head~0!base := v_#memory_$Pointer$.base_28[~new_head~0!base][4 := 0]] && v_#memory_$Pointer$.base_143[#res!base := v_#memory_$Pointer$.base_143[#res!base][4 := 0][0 := v_#memory_$Pointer$.base_28[#res!base][0]]] == v_#memory_$Pointer$.base_28)) && !(#res!base == 0)) && ~head~0!base == ~new_head~0!base) && ~len == 1) && #res!base == ~new_head~0!base) && (exists v_#valid_54 : [int]int :: (((v_#valid_54[1] == 1 && v_#valid_54[#res!base] == 0) && v_#valid_54[2] == 1) && v_#valid_54[#res!base := 1] == #valid) && v_#valid_54[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 v_ULTIMATE.start_main_~i~0#1_58 : int :: ((((~s~0!base == #res!base && 2 == ~i~0) && v_ULTIMATE.start_main_~i~0#1_58 == 1) && 3 == ~new_data~0) && (exists v_#memory_$Pointer$.base_97 : [int,int]int, v_#memory_$Pointer$.base_96 : [int,int]int, v_#memory_$Pointer$.offset_97 : [int,int]int, v_#memory_$Pointer$.offset_96 : [int,int]int, v_#memory_int_106 : [int,int]int :: (((v_#memory_$Pointer$.base_97 == v_#memory_$Pointer$.base_96[~s~0!base := v_#memory_$Pointer$.base_96[~s~0!base][0 := v_#memory_$Pointer$.base_97[~s~0!base][0]]] && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_97[v_#memory_$Pointer$.base_97[~s~0!base][4] := v_#memory_$Pointer$.offset_97[v_#memory_$Pointer$.base_97[~s~0!base][4]][v_#memory_$Pointer$.offset_97[~s~0!base][4] := #memory_$Pointer$.offset[v_#memory_$Pointer$.base_97[~s~0!base][4]][v_#memory_$Pointer$.offset_97[~s~0!base][4]]]]) && v_#memory_$Pointer$.offset_96[~s~0!base := v_#memory_$Pointer$.offset_96[~s~0!base][0 := v_#memory_$Pointer$.offset_97[~s~0!base][0]]] == v_#memory_$Pointer$.offset_97) && #memory_$Pointer$.base == v_#memory_$Pointer$.base_97[v_#memory_$Pointer$.base_97[~s~0!base][4] := v_#memory_$Pointer$.base_97[v_#memory_$Pointer$.base_97[~s~0!base][4]][v_#memory_$Pointer$.offset_97[~s~0!base][4] := #memory_$Pointer$.base[v_#memory_$Pointer$.base_97[~s~0!base][4]][v_#memory_$Pointer$.offset_97[~s~0!base][4]]]]) && #memory_int == v_#memory_int_106[~s~0!base := v_#memory_int_106[~s~0!base][0 := 2]][v_#memory_$Pointer$.base_97[~s~0!base][4] := v_#memory_int_106[~s~0!base := v_#memory_int_106[~s~0!base][0 := 2]][v_#memory_$Pointer$.base_97[~s~0!base][4]][v_#memory_$Pointer$.offset_97[~s~0!base][4] := 3]])) || ((((((~s~0!base == #res!base && v_ULTIMATE.start_main_~i~0#1_58 == 0) && (exists v_#memory_$Pointer$.base_96 : [int,int]int :: #memory_$Pointer$.base == v_#memory_$Pointer$.base_96[~s~0!base := v_#memory_$Pointer$.base_96[~s~0!base][0 := #memory_$Pointer$.base[~s~0!base][0]]])) && (exists v_#memory_int_106 : [int,int]int :: #memory_int == v_#memory_int_106[~s~0!base := v_#memory_int_106[~s~0!base][0 := 2]])) && ~i~0 == 1) && (exists v_#memory_$Pointer$.offset_96 : [int,int]int :: #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_96[~s~0!base := v_#memory_$Pointer$.offset_96[~s~0!base][0 := #memory_$Pointer$.offset[~s~0!base][0]]])) && 2 == ~new_data~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!base 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: Expression #in~head!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: unknown boogie variable ~expected~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~data~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~expected~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~new_data~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#in~head!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#in~head!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~new_data~0#1_48 : int :: ~i~0 == 1 && v_ULTIMATE.start_main_~new_data~0#1_48 == 2) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~new_data~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~new_data~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~new_data~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - 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_main_~new_data~0#1_24 : int :: ((((~s~0!base == #res!base && (exists v_#memory_$Pointer$.base_96 : [int,int]int :: #memory_$Pointer$.base == v_#memory_$Pointer$.base_96[~s~0!base := v_#memory_$Pointer$.base_96[~s~0!base][0 := #memory_$Pointer$.base[~s~0!base][0]]])) && (exists v_#memory_int_106 : [int,int]int :: #memory_int == v_#memory_int_106[~s~0!base := v_#memory_int_106[~s~0!base][0 := 2]])) && (exists v_#memory_$Pointer$.offset_96 : [int,int]int :: #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_96[~s~0!base := v_#memory_$Pointer$.offset_96[~s~0!base][0 := #memory_$Pointer$.offset[~s~0!base][0]]])) || (~s~0!base == #res!base && ~i~0 == 0)) && ((~i~0 == 1 && v_ULTIMATE.start_main_~new_data~0#1_24 == 2) || ~i~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: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - 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: 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 - PositiveResult [Line: 609]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 609]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 623]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 623]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 622]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 622]: 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 1 procedures, 40 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 435.3s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 54.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 203.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 116 SdHoareTripleChecker+Valid, 53.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 116 mSDsluCounter, 904 SdHoareTripleChecker+Invalid, 52.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 689 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1947 IncrementalHoareTripleChecker+Invalid, 2012 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 215 mSDtfsCounter, 1947 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 658 GetRequests, 430 SyntacticMatches, 71 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 934 ImplicationChecksByTransitivity, 123.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=11, InterpolantAutomatonStates: 123, 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, 73 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 20 NumberOfFragments, 4898 HoareAnnotationTreeSize, 6 FomulaSimplifications, 11310 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 6 FomulaSimplificationsInter, 5136 FormulaSimplificationTreeSizeReductionInter, 202.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 422 NumberOfCodeBlocks, 422 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 597 ConstructedInterpolants, 0 QuantifiedInterpolants, 905 SizeOfPredicates, 30 NumberOfNonLiveVariables, 1924 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 32 InterpolantComputations, 2 PerfectInterpolantSequences, 192/222 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: 50.4s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 10, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 184, DAG_INTERPRETER_EARLY_EXITS: 7, TOOLS_POST_APPLICATIONS: 503, TOOLS_POST_TIME: 9.3s, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 483, TOOLS_QUANTIFIERELIM_TIME: 9.1s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 829, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 77, DOMAIN_JOIN_TIME: 1.0s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 19, DOMAIN_WIDEN_TIME: 0.3s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 62, DOMAIN_ISSUBSETEQ_TIME: 38.1s, DOMAIN_ISBOTTOM_APPLICATIONS: 184, DOMAIN_ISBOTTOM_TIME: 1.5s, LOOP_SUMMARIZER_APPLICATIONS: 43, LOOP_SUMMARIZER_CACHE_MISSES: 43, LOOP_SUMMARIZER_OVERALL_TIME: 44.6s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 44.6s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 62, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, 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.1s, DAG_COMPRESSION_PROCESSED_NODES: 6242, DAG_COMPRESSION_RETAINED_NODES: 597, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 14 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 == 2)) && (data == 1)) && (\old(data) == 1))) - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: ((data == 1) && (len == 2)) - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: ((((index <= 1) && (0 <= index)) && (0 <= \old(index))) && (\old(index) <= 1)) - InvariantResult [Line: 607]: Loop Invariant Derived loop invariant: (((((index + 1) == \old(index)) && (data == \old(data))) || ((index == \old(index)) && (data == \old(data)))) && (data == 1)) - InvariantResult [Line: 622]: Loop Invariant Derived loop invariant: ((((i <= 2) && (0 <= i)) && (data == 1)) && (len == 2)) RESULT: Ultimate proved your program to be correct! [2023-12-02 15:45:15,764 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f033110a-e349-4c27-ad77-f0a6c6aea767/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE