./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b 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_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 20:56:58,621 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 20:56:58,702 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-06 20:56:58,708 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 20:56:58,709 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 20:56:58,762 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 20:56:58,763 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 20:56:58,764 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 20:56:58,765 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 20:56:58,766 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 20:56:58,766 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-06 20:56:58,767 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-06 20:56:58,768 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-06 20:56:58,768 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-06 20:56:58,769 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-06 20:56:58,770 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-06 20:56:58,770 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-06 20:56:58,771 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-06 20:56:58,771 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-06 20:56:58,772 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-06 20:56:58,773 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-06 20:56:58,777 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-06 20:56:58,778 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 20:56:58,779 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 20:56:58,779 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 20:56:58,780 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 20:56:58,780 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 20:56:58,781 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 20:56:58,781 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 20:56:58,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 20:56:58,783 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 20:56:58,783 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 20:56:58,783 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 20:56:58,784 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 20:56:58,784 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 20:56:58,784 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 20:56:58,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 20:56:58,785 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 20:56:58,785 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 20:56:58,795 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 20:56:58,795 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-06 20:56:58,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 20:56:58,797 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 20:56:58,797 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-06 20:56:58,798 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 20:56:58,798 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_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/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_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 [2023-11-06 20:56:59,137 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 20:56:59,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 20:56:59,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 20:56:59,172 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 20:56:59,173 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 20:56:59,175 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2023-11-06 20:57:02,262 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 20:57:02,638 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 20:57:02,638 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2023-11-06 20:57:02,667 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/data/b9bc7bc65/35a4ae2bde49494b96e5a664e92f8d54/FLAG60d7f929c [2023-11-06 20:57:02,687 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/data/b9bc7bc65/35a4ae2bde49494b96e5a664e92f8d54 [2023-11-06 20:57:02,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 20:57:02,699 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 20:57:02,703 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 20:57:02,704 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 20:57:02,710 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 20:57:02,711 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:57:02" (1/1) ... [2023-11-06 20:57:02,713 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74228714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:57:02, skipping insertion in model container [2023-11-06 20:57:02,713 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:57:02" (1/1) ... [2023-11-06 20:57:02,760 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 20:57:03,184 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2023-11-06 20:57:03,188 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 20:57:03,199 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 20:57:03,238 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2023-11-06 20:57:03,239 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 20:57:03,275 INFO L206 MainTranslator]: Completed translation [2023-11-06 20:57:03,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:57:03 WrapperNode [2023-11-06 20:57:03,276 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 20:57:03,277 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 20:57:03,278 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 20:57:03,278 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 20:57:03,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:57:03" (1/1) ... [2023-11-06 20:57:03,300 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:57:03" (1/1) ... [2023-11-06 20:57:03,336 INFO L138 Inliner]: procedures = 126, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2023-11-06 20:57:03,336 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 20:57:03,337 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 20:57:03,337 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 20:57:03,338 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 20:57:03,348 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:57:03" (1/1) ... [2023-11-06 20:57:03,349 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:57:03" (1/1) ... [2023-11-06 20:57:03,360 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:57:03" (1/1) ... [2023-11-06 20:57:03,360 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:57:03" (1/1) ... [2023-11-06 20:57:03,380 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:57:03" (1/1) ... [2023-11-06 20:57:03,384 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:57:03" (1/1) ... [2023-11-06 20:57:03,386 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:57:03" (1/1) ... [2023-11-06 20:57:03,388 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:57:03" (1/1) ... [2023-11-06 20:57:03,391 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 20:57:03,392 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 20:57:03,392 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 20:57:03,392 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 20:57:03,393 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:57:03" (1/1) ... [2023-11-06 20:57:03,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 20:57:03,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:57:03,440 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 20:57:03,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 20:57:03,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 20:57:03,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 20:57:03,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 20:57:03,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 20:57:03,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 20:57:03,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 20:57:03,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 20:57:03,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 20:57:03,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 20:57:03,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 20:57:03,700 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 20:57:03,702 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 20:57:03,979 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 20:57:04,083 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 20:57:04,083 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-06 20:57:04,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:57:04 BoogieIcfgContainer [2023-11-06 20:57:04,086 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 20:57:04,090 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 20:57:04,091 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 20:57:04,095 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 20:57:04,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 08:57:02" (1/3) ... [2023-11-06 20:57:04,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7303920 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:57:04, skipping insertion in model container [2023-11-06 20:57:04,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:57:03" (2/3) ... [2023-11-06 20:57:04,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7303920 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:57:04, skipping insertion in model container [2023-11-06 20:57:04,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:57:04" (3/3) ... [2023-11-06 20:57:04,101 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2023-11-06 20:57:04,123 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 20:57:04,123 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 20:57:04,184 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 20:57:04,192 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=LoopsAndPotentialCycles, 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;@3db0fc7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-06 20:57:04,193 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 20:57:04,197 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 13 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-11-06 20:57:04,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-06 20:57:04,204 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:57:04,205 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:57:04,206 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:57:04,213 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:57:04,213 INFO L85 PathProgramCache]: Analyzing trace with hash 188652621, now seen corresponding path program 1 times [2023-11-06 20:57:04,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:57:04,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076728437] [2023-11-06 20:57:04,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:57:04,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:57:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:57:04,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 20:57:04,571 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:57:04,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076728437] [2023-11-06 20:57:04,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076728437] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:57:04,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:57:04,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 20:57:04,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227455548] [2023-11-06 20:57:04,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:57:04,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 20:57:04,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:57:04,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 20:57:04,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:57:04,627 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 13 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) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-11-06 20:57:04,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:57:04,712 INFO L93 Difference]: Finished difference Result 27 states and 41 transitions. [2023-11-06 20:57:04,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 20:57:04,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2023-11-06 20:57:04,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:57:04,724 INFO L225 Difference]: With dead ends: 27 [2023-11-06 20:57:04,724 INFO L226 Difference]: Without dead ends: 12 [2023-11-06 20:57:04,727 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-11-06 20:57:04,731 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:57:04,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 16 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:57:04,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-11-06 20:57:04,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2023-11-06 20:57:04,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 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-11-06 20:57:04,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2023-11-06 20:57:04,770 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 15 transitions. Word has length 7 [2023-11-06 20:57:04,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:57:04,771 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 15 transitions. [2023-11-06 20:57:04,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-11-06 20:57:04,772 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2023-11-06 20:57:04,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-06 20:57:04,773 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:57:04,773 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:57:04,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 20:57:04,774 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:57:04,775 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:57:04,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1236248315, now seen corresponding path program 1 times [2023-11-06 20:57:04,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:57:04,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885729062] [2023-11-06 20:57:04,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:57:04,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:57:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:57:04,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 20:57:04,914 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:57:04,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885729062] [2023-11-06 20:57:04,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885729062] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:57:04,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:57:04,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 20:57:04,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474485111] [2023-11-06 20:57:04,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:57:04,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 20:57:04,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:57:04,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 20:57:04,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 20:57:04,919 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-11-06 20:57:04,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:57:04,975 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2023-11-06 20:57:04,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 20:57:04,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2023-11-06 20:57:04,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:57:04,976 INFO L225 Difference]: With dead ends: 23 [2023-11-06 20:57:04,977 INFO L226 Difference]: Without dead ends: 18 [2023-11-06 20:57:04,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 20:57:04,979 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 27 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 20:57:04,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 10 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 20:57:04,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-11-06 20:57:04,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 12. [2023-11-06 20:57:04,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 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-11-06 20:57:04,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2023-11-06 20:57:04,986 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 9 [2023-11-06 20:57:04,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:57:04,987 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2023-11-06 20:57:04,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-11-06 20:57:04,988 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2023-11-06 20:57:04,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-06 20:57:04,988 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:57:04,988 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:57:04,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 20:57:04,989 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:57:04,990 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:57:04,990 INFO L85 PathProgramCache]: Analyzing trace with hash -660348294, now seen corresponding path program 1 times [2023-11-06 20:57:04,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:57:04,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228321928] [2023-11-06 20:57:04,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:57:04,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:57:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:57:05,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 20:57:05,308 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:57:05,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228321928] [2023-11-06 20:57:05,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228321928] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:57:05,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479789008] [2023-11-06 20:57:05,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:57:05,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:57:05,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:57:05,314 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 20:57:05,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 20:57:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:57:05,486 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 20:57:05,492 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 20:57:05,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 20:57:05,545 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 20:57:05,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 20:57:05,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479789008] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 20:57:05,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1847769315] [2023-11-06 20:57:05,602 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-11-06 20:57:05,603 INFO L166 IcfgInterpreter]: Building call graph [2023-11-06 20:57:05,608 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-06 20:57:05,615 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-06 20:57:05,616 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-06 20:57:06,822 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-06 20:57:07,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1847769315] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:57:07,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-11-06 20:57:07,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3, 3, 3] total 8 [2023-11-06 20:57:07,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157850264] [2023-11-06 20:57:07,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:57:07,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 20:57:07,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:57:07,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 20:57:07,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-06 20:57:07,166 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-11-06 20:57:07,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:57:07,296 INFO L93 Difference]: Finished difference Result 21 states and 30 transitions. [2023-11-06 20:57:07,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 20:57:07,297 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-11-06 20:57:07,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:57:07,297 INFO L225 Difference]: With dead ends: 21 [2023-11-06 20:57:07,298 INFO L226 Difference]: Without dead ends: 14 [2023-11-06 20:57:07,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-06 20:57:07,299 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:57:07,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 17 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:57:07,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-11-06 20:57:07,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2023-11-06 20:57:07,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 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-11-06 20:57:07,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2023-11-06 20:57:07,308 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 11 [2023-11-06 20:57:07,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:57:07,308 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2023-11-06 20:57:07,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-11-06 20:57:07,309 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2023-11-06 20:57:07,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-06 20:57:07,309 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:57:07,310 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:57:07,324 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 20:57:07,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:57:07,517 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:57:07,517 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:57:07,517 INFO L85 PathProgramCache]: Analyzing trace with hash 384828029, now seen corresponding path program 1 times [2023-11-06 20:57:07,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:57:07,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073255849] [2023-11-06 20:57:07,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:57:07,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:57:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:57:07,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 20:57:07,604 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:57:07,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073255849] [2023-11-06 20:57:07,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073255849] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:57:07,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851759564] [2023-11-06 20:57:07,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:57:07,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:57:07,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:57:07,607 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 20:57:07,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 20:57:07,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:57:07,725 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 20:57:07,727 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 20:57:07,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 20:57:07,748 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 20:57:07,765 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 20:57:07,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851759564] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 20:57:07,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1555265502] [2023-11-06 20:57:07,768 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-11-06 20:57:07,768 INFO L166 IcfgInterpreter]: Building call graph [2023-11-06 20:57:07,769 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-06 20:57:07,769 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-06 20:57:07,769 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-06 20:57:09,482 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-06 20:57:10,362 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '354#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~expected~0#1| 1) (exists ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int) (|v_#memory_int_69| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_59| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_update_at_~head#1.base_30| Int) (|v_#memory_$Pointer$.base_59| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_59| |v_ULTIMATE.start_sll_update_at_~head#1.base_30| (store (select |v_#memory_$Pointer$.base_59| |v_ULTIMATE.start_sll_update_at_~head#1.base_30|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_update_at_~head#1.base_30|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|))) |#memory_$Pointer$.base|) (= |#memory_int| (store |v_#memory_int_69| |v_ULTIMATE.start_sll_update_at_~head#1.base_30| (store (select |v_#memory_int_69| |v_ULTIMATE.start_sll_update_at_~head#1.base_30|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| (select (select |#memory_int| |v_ULTIMATE.start_sll_update_at_~head#1.base_30|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|)))) (<= 1 (select (select |#memory_int| |v_ULTIMATE.start_sll_update_at_~head#1.base_30|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|)) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_59| |v_ULTIMATE.start_sll_update_at_~head#1.base_30| (store (select |v_#memory_$Pointer$.offset_59| |v_ULTIMATE.start_sll_update_at_~head#1.base_30|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_update_at_~head#1.base_30|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|)))))) (not (= |ULTIMATE.start_sll_get_data_at_#res#1| 1)) (= |ULTIMATE.start_main_~len~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_sll_get_data_at_#res#1|) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2023-11-06 20:57:10,362 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-06 20:57:10,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 20:57:10,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 6 [2023-11-06 20:57:10,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107558740] [2023-11-06 20:57:10,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 20:57:10,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 20:57:10,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:57:10,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 20:57:10,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=168, Unknown=1, NotChecked=0, Total=210 [2023-11-06 20:57:10,366 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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-11-06 20:57:10,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:57:10,513 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2023-11-06 20:57:10,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 20:57:10,514 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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 12 [2023-11-06 20:57:10,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:57:10,515 INFO L225 Difference]: With dead ends: 32 [2023-11-06 20:57:10,515 INFO L226 Difference]: Without dead ends: 23 [2023-11-06 20:57:10,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=62, Invalid=279, Unknown=1, NotChecked=0, Total=342 [2023-11-06 20:57:10,517 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 35 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:57:10,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 16 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:57:10,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-06 20:57:10,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. [2023-11-06 20:57:10,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 16 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-11-06 20:57:10,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2023-11-06 20:57:10,527 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 12 [2023-11-06 20:57:10,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:57:10,528 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2023-11-06 20:57:10,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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-11-06 20:57:10,528 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2023-11-06 20:57:10,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-06 20:57:10,529 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:57:10,529 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:57:10,541 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 20:57:10,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:57:10,736 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:57:10,736 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:57:10,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1904764146, now seen corresponding path program 2 times [2023-11-06 20:57:10,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:57:10,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484186754] [2023-11-06 20:57:10,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:57:10,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:57:10,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:57:10,967 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-06 20:57:10,968 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:57:10,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484186754] [2023-11-06 20:57:10,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484186754] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:57:10,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:57:10,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 20:57:10,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310695404] [2023-11-06 20:57:10,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:57:10,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 20:57:10,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:57:10,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 20:57:10,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 20:57:10,971 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-11-06 20:57:11,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:57:11,035 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2023-11-06 20:57:11,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 20:57:11,035 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 16 [2023-11-06 20:57:11,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:57:11,036 INFO L225 Difference]: With dead ends: 28 [2023-11-06 20:57:11,036 INFO L226 Difference]: Without dead ends: 23 [2023-11-06 20:57:11,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 20:57:11,038 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 22 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 20:57:11,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 13 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 20:57:11,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-06 20:57:11,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2023-11-06 20:57:11,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-11-06 20:57:11,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2023-11-06 20:57:11,048 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 16 [2023-11-06 20:57:11,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:57:11,049 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2023-11-06 20:57:11,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-11-06 20:57:11,049 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2023-11-06 20:57:11,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-06 20:57:11,050 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:57:11,050 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:57:11,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 20:57:11,051 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:57:11,051 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:57:11,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1080201052, now seen corresponding path program 1 times [2023-11-06 20:57:11,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:57:11,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63024546] [2023-11-06 20:57:11,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:57:11,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:57:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:57:12,967 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 20:57:12,968 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:57:12,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63024546] [2023-11-06 20:57:12,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63024546] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:57:12,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081580071] [2023-11-06 20:57:12,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:57:12,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:57:12,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:57:12,977 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 20:57:12,985 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 20:57:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:57:13,135 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 91 conjunts are in the unsatisfiable core [2023-11-06 20:57:13,140 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 20:57:13,184 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 20:57:13,270 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 20:57:13,270 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-06 20:57:13,314 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-06 20:57:13,323 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-06 20:57:13,573 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-06 20:57:13,573 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 73 [2023-11-06 20:57:13,584 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2023-11-06 20:57:13,591 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 23 [2023-11-06 20:57:13,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:57:13,741 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 27 [2023-11-06 20:57:13,751 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2023-11-06 20:57:13,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:57:13,759 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2023-11-06 20:57:13,908 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2023-11-06 20:57:13,926 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-06 20:57:14,003 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 20:57:14,004 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 20:57:14,177 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_267 (Array Int Int)) (v_ArrVal_269 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (or (not (= v_ArrVal_269 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_269 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (not (= v_ArrVal_267 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_267 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_268) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_269) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_267) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) 1)))) is different from false [2023-11-06 20:57:14,220 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int) (v_ArrVal_268 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (= (+ (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_268) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_DerPreprocessor_1) .cse0)) (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_DerPreprocessor_2) .cse0))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)))) is different from false [2023-11-06 20:57:14,241 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 20:57:14,242 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 47 [2023-11-06 20:57:14,258 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 20:57:14,258 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 101 [2023-11-06 20:57:14,274 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 23 [2023-11-06 20:57:14,351 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (= (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (forall ((v_ArrVal_266 (Array Int Int)) (v_DerPreprocessor_2 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_266) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_DerPreprocessor_2) .cse0) |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (forall ((v_ArrVal_264 (Array Int Int)) (v_DerPreprocessor_1 Int)) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_DerPreprocessor_1) .cse0))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (forall ((v_ArrVal_264 (Array Int Int)) (v_DerPreprocessor_1 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_DerPreprocessor_1) .cse0) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|))))) is different from false [2023-11-06 20:57:14,438 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (= (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (forall ((v_ArrVal_266 (Array Int Int)) (v_DerPreprocessor_2 Int)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse0) (select (store (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_266) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_DerPreprocessor_2) .cse2))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (forall ((v_ArrVal_264 (Array Int Int)) (v_DerPreprocessor_1 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_264) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_DerPreprocessor_1) .cse2)))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (forall ((v_ArrVal_264 (Array Int Int)) (v_DerPreprocessor_1 Int)) (= .cse1 (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_264) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_DerPreprocessor_1) .cse2)))))))) is different from false [2023-11-06 20:57:14,494 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (forall ((v_ArrVal_266 (Array Int Int)) (v_DerPreprocessor_2 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_266) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_DerPreprocessor_2) .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))) (= |c_ULTIMATE.start_main_~len~0#1| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (forall ((v_ArrVal_264 (Array Int Int)) (v_DerPreprocessor_1 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_264) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_DerPreprocessor_1) .cse1) |c_ULTIMATE.start_main_~s~0#1.base|))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (forall ((v_ArrVal_264 (Array Int Int)) (v_DerPreprocessor_1 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_264) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_DerPreprocessor_1) .cse1) .cse0)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|)))))) is different from false [2023-11-06 20:57:14,545 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (forall ((v_ArrVal_264 (Array Int Int)) (v_DerPreprocessor_1 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_264) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_DerPreprocessor_1) .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (forall ((v_ArrVal_264 (Array Int Int)) (v_DerPreprocessor_1 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_264) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_DerPreprocessor_1) .cse1) .cse0)))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (forall ((v_ArrVal_266 (Array Int Int)) (v_DerPreprocessor_2 Int)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_266) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_DerPreprocessor_2) .cse1)))))))) is different from false [2023-11-06 20:57:14,585 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 20:57:14,585 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-11-06 20:57:14,590 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2023-11-06 20:57:14,593 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 20:57:14,596 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-06 20:57:14,600 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 20:57:14,602 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-11-06 20:57:14,612 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-06 20:57:14,612 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 1 [2023-11-06 20:57:14,620 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-06 20:57:14,620 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2023-11-06 20:57:14,733 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-11-06 20:57:14,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081580071] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 20:57:14,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [412771397] [2023-11-06 20:57:14,737 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-11-06 20:57:14,737 INFO L166 IcfgInterpreter]: Building call graph [2023-11-06 20:57:14,737 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-06 20:57:14,738 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-06 20:57:14,738 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-06 20:57:15,476 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-06 20:57:16,902 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '689#(and (exists ((|v_#memory_int_88| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_update_at_~head#1.base_43| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (|v_#memory_$Pointer$.offset_79| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_79| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_update_at_~head#1.base_43| (store (select |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_update_at_~head#1.base_43|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_update_at_~head#1.base_43|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|)))) (= |#memory_int| (store |v_#memory_int_88| |v_ULTIMATE.start_sll_update_at_~head#1.base_43| (store (select |v_#memory_int_88| |v_ULTIMATE.start_sll_update_at_~head#1.base_43|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| (select (select |#memory_int| |v_ULTIMATE.start_sll_update_at_~head#1.base_43|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|)))) (<= (select (select |#memory_int| |v_ULTIMATE.start_sll_update_at_~head#1.base_43|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|) 3) (= (store |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_update_at_~head#1.base_43| (store (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_update_at_~head#1.base_43|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_update_at_~head#1.base_43|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|))) |#memory_$Pointer$.base|))) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 1) (= 3 |ULTIMATE.start_main_~expected~0#1|) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (not (= 3 |ULTIMATE.start_sll_get_data_at_#res#1|)) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) |ULTIMATE.start_sll_get_data_at_#res#1|) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2023-11-06 20:57:16,902 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-06 20:57:16,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 20:57:16,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 42 [2023-11-06 20:57:16,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585675760] [2023-11-06 20:57:16,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 20:57:16,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-06 20:57:16,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:57:16,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-06 20:57:16,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1760, Unknown=7, NotChecked=534, Total=2450 [2023-11-06 20:57:16,907 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 42 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 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-11-06 20:57:18,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:57:18,470 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2023-11-06 20:57:18,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 20:57:18,477 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 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-11-06 20:57:18,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:57:18,479 INFO L225 Difference]: With dead ends: 40 [2023-11-06 20:57:18,479 INFO L226 Difference]: Without dead ends: 38 [2023-11-06 20:57:18,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=298, Invalid=2911, Unknown=7, NotChecked=690, Total=3906 [2023-11-06 20:57:18,483 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 91 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 269 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 20:57:18,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 71 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 457 Invalid, 0 Unknown, 269 Unchecked, 0.5s Time] [2023-11-06 20:57:18,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-06 20:57:18,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2023-11-06 20:57:18,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 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-11-06 20:57:18,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2023-11-06 20:57:18,498 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 17 [2023-11-06 20:57:18,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:57:18,498 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2023-11-06 20:57:18,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 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-11-06 20:57:18,499 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2023-11-06 20:57:18,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-06 20:57:18,499 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:57:18,500 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:57:18,507 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 20:57:18,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:57:18,707 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:57:18,707 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:57:18,708 INFO L85 PathProgramCache]: Analyzing trace with hash -875158322, now seen corresponding path program 2 times [2023-11-06 20:57:18,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:57:18,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734592672] [2023-11-06 20:57:18,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:57:18,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:57:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:57:18,884 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-06 20:57:18,884 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:57:18,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734592672] [2023-11-06 20:57:18,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734592672] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:57:18,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:57:18,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 20:57:18,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429099508] [2023-11-06 20:57:18,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:57:18,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 20:57:18,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:57:18,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 20:57:18,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 20:57:18,888 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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-11-06 20:57:18,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:57:18,961 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2023-11-06 20:57:18,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 20:57:18,961 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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 18 [2023-11-06 20:57:18,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:57:18,963 INFO L225 Difference]: With dead ends: 33 [2023-11-06 20:57:18,964 INFO L226 Difference]: Without dead ends: 28 [2023-11-06 20:57:18,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-11-06 20:57:18,967 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 20:57:18,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 9 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 20:57:18,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-06 20:57:18,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-11-06 20:57:18,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 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-11-06 20:57:18,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2023-11-06 20:57:18,994 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 18 [2023-11-06 20:57:18,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:57:18,994 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2023-11-06 20:57:18,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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-11-06 20:57:18,995 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2023-11-06 20:57:18,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-06 20:57:18,996 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:57:18,997 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:57:18,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 20:57:18,997 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:57:18,997 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:57:18,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1455356257, now seen corresponding path program 3 times [2023-11-06 20:57:18,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:57:18,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195545847] [2023-11-06 20:57:18,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:57:18,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:57:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:57:19,128 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 20:57:19,129 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:57:19,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195545847] [2023-11-06 20:57:19,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195545847] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:57:19,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:57:19,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 20:57:19,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187926511] [2023-11-06 20:57:19,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:57:19,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 20:57:19,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:57:19,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 20:57:19,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 20:57:19,132 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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-11-06 20:57:19,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:57:19,221 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2023-11-06 20:57:19,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 20:57:19,222 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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 18 [2023-11-06 20:57:19,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:57:19,222 INFO L225 Difference]: With dead ends: 42 [2023-11-06 20:57:19,222 INFO L226 Difference]: Without dead ends: 32 [2023-11-06 20:57:19,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-11-06 20:57:19,224 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 21 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 20:57:19,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 17 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 20:57:19,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-06 20:57:19,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2023-11-06 20:57:19,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 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-11-06 20:57:19,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2023-11-06 20:57:19,240 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 18 [2023-11-06 20:57:19,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:57:19,241 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2023-11-06 20:57:19,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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-11-06 20:57:19,241 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2023-11-06 20:57:19,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-06 20:57:19,242 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:57:19,242 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:57:19,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 20:57:19,243 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:57:19,243 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:57:19,243 INFO L85 PathProgramCache]: Analyzing trace with hash -461139389, now seen corresponding path program 4 times [2023-11-06 20:57:19,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:57:19,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150596071] [2023-11-06 20:57:19,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:57:19,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:57:19,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:57:19,357 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 20:57:19,357 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:57:19,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150596071] [2023-11-06 20:57:19,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150596071] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:57:19,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961083484] [2023-11-06 20:57:19,358 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-06 20:57:19,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:57:19,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:57:19,359 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 20:57:19,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 20:57:19,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:57:19,527 INFO L262 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 20:57:19,529 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 20:57:19,549 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 20:57:19,550 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 20:57:19,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961083484] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:57:19,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 20:57:19,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-11-06 20:57:19,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022096702] [2023-11-06 20:57:19,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:57:19,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 20:57:19,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:57:19,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 20:57:19,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 20:57:19,552 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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-11-06 20:57:19,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:57:19,618 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2023-11-06 20:57:19,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 20:57:19,619 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 18 [2023-11-06 20:57:19,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:57:19,619 INFO L225 Difference]: With dead ends: 34 [2023-11-06 20:57:19,619 INFO L226 Difference]: Without dead ends: 22 [2023-11-06 20:57:19,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-11-06 20:57:19,620 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 19 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 20:57:19,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 13 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 20:57:19,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-06 20:57:19,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-11-06 20:57:19,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 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-11-06 20:57:19,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2023-11-06 20:57:19,631 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 18 [2023-11-06 20:57:19,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:57:19,632 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2023-11-06 20:57:19,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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-11-06 20:57:19,632 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2023-11-06 20:57:19,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-06 20:57:19,633 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:57:19,633 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:57:19,643 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 20:57:19,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:57:19,843 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:57:19,844 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:57:19,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1893796027, now seen corresponding path program 1 times [2023-11-06 20:57:19,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:57:19,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528253584] [2023-11-06 20:57:19,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:57:19,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:57:19,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:57:20,298 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 20:57:20,298 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:57:20,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528253584] [2023-11-06 20:57:20,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528253584] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:57:20,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566684015] [2023-11-06 20:57:20,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:57:20,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:57:20,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:57:20,300 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 20:57:20,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 20:57:20,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:57:20,478 INFO L262 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-06 20:57:20,483 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 20:57:20,615 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 20:57:20,778 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 20:57:20,778 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 20:57:20,811 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2023-11-06 20:57:20,912 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 20:57:20,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566684015] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 20:57:20,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1122328469] [2023-11-06 20:57:20,915 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-11-06 20:57:20,916 INFO L166 IcfgInterpreter]: Building call graph [2023-11-06 20:57:20,916 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-06 20:57:20,917 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-06 20:57:20,917 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-06 20:57:22,913 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-06 20:57:23,613 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1413#(and (not (= |ULTIMATE.start_sll_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (exists ((|v_ULTIMATE.start_sll_get_data_at_~head#1.base_32| Int) (|v_ULTIMATE.start_sll_get_data_at_~head#1.offset_32| Int)) (= |ULTIMATE.start_sll_get_data_at_#res#1| (select (select |#memory_int| |v_ULTIMATE.start_sll_get_data_at_~head#1.base_32|) |v_ULTIMATE.start_sll_get_data_at_~head#1.offset_32|))) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2023-11-06 20:57:23,613 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-06 20:57:23,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 20:57:23,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2023-11-06 20:57:23,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155084937] [2023-11-06 20:57:23,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 20:57:23,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-06 20:57:23,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:57:23,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-06 20:57:23,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=824, Unknown=2, NotChecked=0, Total=930 [2023-11-06 20:57:23,616 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 23 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-11-06 20:57:23,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:57:23,924 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2023-11-06 20:57:23,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 20:57:23,925 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 23 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) Word has length 20 [2023-11-06 20:57:23,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:57:23,926 INFO L225 Difference]: With dead ends: 27 [2023-11-06 20:57:23,926 INFO L226 Difference]: Without dead ends: 25 [2023-11-06 20:57:23,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=171, Invalid=1087, Unknown=2, NotChecked=0, Total=1260 [2023-11-06 20:57:23,928 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 36 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 20:57:23,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 46 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 20:57:23,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-06 20:57:23,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2023-11-06 20:57:23,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 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-11-06 20:57:23,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2023-11-06 20:57:23,947 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 20 [2023-11-06 20:57:23,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:57:23,947 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2023-11-06 20:57:23,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 23 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-11-06 20:57:23,947 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2023-11-06 20:57:23,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-06 20:57:23,949 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:57:23,949 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:57:23,961 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 20:57:24,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-06 20:57:24,162 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:57:24,162 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:57:24,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1420212741, now seen corresponding path program 2 times [2023-11-06 20:57:24,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:57:24,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386831165] [2023-11-06 20:57:24,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:57:24,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:57:24,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:57:24,278 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 20:57:24,278 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:57:24,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386831165] [2023-11-06 20:57:24,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386831165] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:57:24,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934641480] [2023-11-06 20:57:24,279 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 20:57:24,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:57:24,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:57:24,280 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 20:57:24,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 20:57:24,452 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-06 20:57:24,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 20:57:24,453 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 20:57:24,456 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 20:57:24,484 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 20:57:24,484 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 20:57:24,519 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 20:57:24,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934641480] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 20:57:24,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [458538552] [2023-11-06 20:57:24,522 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-11-06 20:57:24,522 INFO L166 IcfgInterpreter]: Building call graph [2023-11-06 20:57:24,523 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-06 20:57:24,523 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-06 20:57:24,523 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-06 20:57:25,434 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-06 20:57:26,211 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1645#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_node_create_#res#1.offset| 0) (<= |ULTIMATE.start_main_~expected~0#1| 3) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_main_#t~ret15#1_36| Int)) (and (<= 0 (+ |v_ULTIMATE.start_main_#t~ret15#1_36| 2147483648)) (not (= |v_ULTIMATE.start_main_#t~ret15#1_36| |ULTIMATE.start_main_~expected~0#1|)) (or (and (exists ((|v_#memory_$Pointer$.offset_115| (Array Int (Array Int Int))) (|v_#memory_int_125| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_64| Int) (|v_#memory_$Pointer$.base_115| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_update_at_~head#1.base_64| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_sll_update_at_~head#1.base_64|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_64|) 3) (= |#memory_int| (store |v_#memory_int_125| |v_ULTIMATE.start_sll_update_at_~head#1.base_64| (store (select |v_#memory_int_125| |v_ULTIMATE.start_sll_update_at_~head#1.base_64|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_64| (select (select |#memory_int| |v_ULTIMATE.start_sll_update_at_~head#1.base_64|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_64|)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_115| |v_ULTIMATE.start_sll_update_at_~head#1.base_64| (store (select |v_#memory_$Pointer$.offset_115| |v_ULTIMATE.start_sll_update_at_~head#1.base_64|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_64| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_update_at_~head#1.base_64|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_64|)))) (= (store |v_#memory_$Pointer$.base_115| |v_ULTIMATE.start_sll_update_at_~head#1.base_64| (store (select |v_#memory_$Pointer$.base_115| |v_ULTIMATE.start_sll_update_at_~head#1.base_64|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_64| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_update_at_~head#1.base_64|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_64|))) |#memory_$Pointer$.base|))) (= |ULTIMATE.start_main_~i~0#1| 0) (= 2 |ULTIMATE.start_main_~expected~0#1|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) 3) (= |v_ULTIMATE.start_main_#t~ret15#1_36| |ULTIMATE.start_sll_get_data_at_#res#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 0) |ULTIMATE.start_sll_get_data_at_#res#1|)) (and (exists ((|v_#memory_$Pointer$.offset_115| (Array Int (Array Int Int))) (|v_#memory_int_125| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_64| Int) (|v_#memory_$Pointer$.base_115| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_update_at_~head#1.base_64| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_sll_update_at_~head#1.base_64|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_64|) 3) (= |#memory_int| (store |v_#memory_int_125| |v_ULTIMATE.start_sll_update_at_~head#1.base_64| (store (select |v_#memory_int_125| |v_ULTIMATE.start_sll_update_at_~head#1.base_64|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_64| (select (select |#memory_int| |v_ULTIMATE.start_sll_update_at_~head#1.base_64|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_64|)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_115| |v_ULTIMATE.start_sll_update_at_~head#1.base_64| (store (select |v_#memory_$Pointer$.offset_115| |v_ULTIMATE.start_sll_update_at_~head#1.base_64|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_64| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_update_at_~head#1.base_64|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_64|)))) (= (store |v_#memory_$Pointer$.base_115| |v_ULTIMATE.start_sll_update_at_~head#1.base_64| (store (select |v_#memory_$Pointer$.base_115| |v_ULTIMATE.start_sll_update_at_~head#1.base_64|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_64| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_update_at_~head#1.base_64|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_64|))) |#memory_$Pointer$.base|))) (= |ULTIMATE.start_main_~i~0#1| 1) (= 3 |ULTIMATE.start_main_~expected~0#1|) (= |v_ULTIMATE.start_main_#t~ret15#1_36| |ULTIMATE.start_sll_get_data_at_#res#1|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) |ULTIMATE.start_sll_get_data_at_#res#1|))) (<= |v_ULTIMATE.start_main_#t~ret15#1_36| 2147483647))) (= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (<= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2023-11-06 20:57:26,211 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-06 20:57:26,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 20:57:26,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2023-11-06 20:57:26,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369067617] [2023-11-06 20:57:26,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 20:57:26,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 20:57:26,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:57:26,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 20:57:26,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=138, Unknown=1, NotChecked=0, Total=182 [2023-11-06 20:57:26,213 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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-11-06 20:57:26,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:57:26,339 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2023-11-06 20:57:26,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 20:57:26,339 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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 21 [2023-11-06 20:57:26,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:57:26,340 INFO L225 Difference]: With dead ends: 26 [2023-11-06 20:57:26,340 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 20:57:26,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=67, Invalid=203, Unknown=2, NotChecked=0, Total=272 [2023-11-06 20:57:26,341 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 10 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:57:26,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 8 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:57:26,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 20:57:26,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 20:57:26,342 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-11-06 20:57:26,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 20:57:26,343 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2023-11-06 20:57:26,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:57:26,343 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 20:57:26,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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-11-06 20:57:26,343 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 20:57:26,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 20:57:26,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 20:57:26,357 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-06 20:57:26,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-06 20:57:26,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 20:57:27,468 INFO L902 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2023-11-06 20:57:27,468 INFO L895 garLoopResultBuilder]: At program point L622-3(lines 622 627) the Hoare annotation is: (let ((.cse1 (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (= |ULTIMATE.start_main_~len~0#1| 2))) (or (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (and (not (= |ULTIMATE.start_main_~s~0#1.base| .cse0)) (= |ULTIMATE.start_main_~i~0#1| 1) (= (select .cse1 0) 2) (= (select (select |#memory_int| .cse0) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) 3) .cse2 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (and (= (select .cse1 |ULTIMATE.start_main_~s~0#1.offset|) 2) (<= |ULTIMATE.start_main_~i~0#1| 0) .cse2))) [2023-11-06 20:57:27,468 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 613 632) the Hoare annotation is: true [2023-11-06 20:57:27,469 INFO L895 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse1 (= 3 |ULTIMATE.start_sll_update_at_~data#1|)) (.cse2 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse3 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) (.cse6 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_update_at_~head#1.base|) 4)) (.cse7 (= |ULTIMATE.start_sll_update_at_~head#1.offset| 0)) (.cse4 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (= |ULTIMATE.start_sll_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse5 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and (= |ULTIMATE.start_sll_update_at_~head#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) (not .cse0) .cse1 .cse2 (<= |ULTIMATE.start_sll_update_at_~index#1| 0) (= |ULTIMATE.start_sll_update_at_~head#1.base| .cse3) .cse4 .cse5) (and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_sll_update_at_~index#1| 1) .cse1 .cse2 (= |ULTIMATE.start_node_create_#res#1.offset| 0) (not (= .cse6 |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_sll_update_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= 3 |ULTIMATE.start_main_~new_data~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_update_at_#in~head#1.offset| 0) .cse7 .cse4 (= |ULTIMATE.start_sll_update_at_#in~index#1| 1) .cse0 (= 3 |ULTIMATE.start_sll_update_at_#in~data#1|) .cse5) (and (= |ULTIMATE.start_main_~i~0#1| 0) (not (= |ULTIMATE.start_main_~s~0#1.base| .cse3)) (= (select (select |#memory_int| .cse6) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_update_at_~head#1.base|) 4)) 3) (= 2 |ULTIMATE.start_sll_update_at_~data#1|) .cse7 .cse4 (= |ULTIMATE.start_sll_update_at_~index#1| 0) .cse0 .cse5))) [2023-11-06 20:57:27,469 INFO L899 garLoopResultBuilder]: For program point L624(lines 624 626) no Hoare annotation was computed. [2023-11-06 20:57:27,469 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 20:57:27,470 INFO L895 garLoopResultBuilder]: At program point L600-2(lines 600 603) the Hoare annotation is: (let ((.cse9 (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|)) (.cse11 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (let ((.cse8 (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0)) (.cse0 (not (= |ULTIMATE.start_main_~s~0#1.base| .cse11))) (.cse2 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse3 (= 3 |ULTIMATE.start_main_~expected~0#1|)) (.cse4 (= (select .cse9 0) 2)) (.cse5 (= (select (select |#memory_int| .cse11) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) 3)) (.cse10 (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse7 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_get_data_at_~head#1.base|) 4))) (and .cse0 (not (= |ULTIMATE.start_sll_get_data_at_~head#1.base| .cse1)) .cse2 (= (select (select |#memory_int| .cse1) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_get_data_at_~head#1.base|) 4)) 3) .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_sll_get_data_at_~head#1.offset| 0) (= |ULTIMATE.start_sll_get_data_at_~index#1| 1) .cse7)) (and .cse8 (= (select .cse9 |ULTIMATE.start_main_~s~0#1.offset|) 2) (= |ULTIMATE.start_main_~i~0#1| 0) (= 2 |ULTIMATE.start_main_~expected~0#1|) (= .cse10 2) .cse6) (and .cse8 .cse0 .cse2 .cse3 .cse4 .cse5 (= .cse10 3) .cse6 .cse7)))) [2023-11-06 20:57:27,470 INFO L895 garLoopResultBuilder]: At program point L576(lines 576 578) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_node_create_~data#1| |ULTIMATE.start_node_create_#in~data#1|)) (.cse10 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse11 (<= (+ |ULTIMATE.start_node_create_~temp~0#1.base| 1) |#StackHeapBarrier|)) (.cse12 (exists ((|v_#length_10| (Array Int Int))) (= (store |v_#length_10| |ULTIMATE.start_node_create_~temp~0#1.base| 8) |#length|))) (.cse13 (exists ((|v_#valid_12| (Array Int Int))) (and (= (store |v_#valid_12| |ULTIMATE.start_node_create_~temp~0#1.base| 1) |#valid|) (= (select |v_#valid_12| |ULTIMATE.start_node_create_~temp~0#1.base|) 0)))) (.cse14 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (= 2 |ULTIMATE.start_sll_create_~len#1|)) (.cse9 (<= 1 |#StackHeapBarrier|)) (.cse3 (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (.cse2 (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse4 (= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse5 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse8 (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0)) (.cse6 (= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse7 (= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse15 (= |ULTIMATE.start_sll_create_~data#1| |ULTIMATE.start_node_create_#in~data#1|)) (.cse16 (not (= |ULTIMATE.start_node_create_~temp~0#1.base| 0)))) (or (and .cse0 (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (exists ((|v_ULTIMATE.start_node_create_#res#1.offset_14| Int)) (and (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= |v_ULTIMATE.start_node_create_#res#1.offset_14| 0) .cse2 .cse4 .cse5 .cse8 .cse6 .cse7)) .cse9 (<= |ULTIMATE.start_sll_create_~len#1| 2))) .cse10 (<= 1 |ULTIMATE.start_sll_create_~len#1|) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse10 .cse11 .cse12 .cse13 .cse14 (exists ((|v_ULTIMATE.start_node_create_#res#1.offset_14| Int)) (and .cse1 .cse9 (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= |v_ULTIMATE.start_node_create_#res#1.offset_14| 0) .cse2 .cse4 .cse5 .cse8 .cse6 .cse7)))) .cse15 .cse16))) [2023-11-06 20:57:27,471 INFO L902 garLoopResultBuilder]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2023-11-06 20:57:27,471 INFO L895 garLoopResultBuilder]: At program point L618-3(lines 618 621) the Hoare annotation is: (let ((.cse4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (let ((.cse0 (not (= |ULTIMATE.start_main_~s~0#1.base| .cse4))) (.cse3 (= (select (select |#memory_int| .cse4) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) 3)) (.cse1 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse2 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) .cse0 (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_node_create_#res#1.offset| 0) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) .cse1 .cse2) (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 .cse3 .cse1 .cse2) (and .cse0 (<= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 0) 2) .cse3 .cse1 .cse2)))) [2023-11-06 20:57:27,471 INFO L895 garLoopResultBuilder]: At program point L585-3(lines 585 589) the Hoare annotation is: (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse1 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)) (.cse2 (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse3 (= |ULTIMATE.start_node_create_#res#1.offset| 0)) (.cse4 (= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse5 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse6 (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0)) (.cse7 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse8 (= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse9 (= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse10 (<= |ULTIMATE.start_sll_create_~len#1| 2))) (or (and .cse0 .cse1 (<= 1 |ULTIMATE.start_sll_create_~len#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= 2 |ULTIMATE.start_sll_create_~len#1|) .cse0 (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9) (and .cse2 (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) .cse4 .cse5 .cse8 .cse9)) .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) |ULTIMATE.start_sll_create_~head~0#1.base|)) .cse10))) [2023-11-06 20:57:27,472 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2023-11-06 20:57:27,472 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 20:57:27,472 INFO L895 garLoopResultBuilder]: At program point main_ERROR#1(lines 613 632) the Hoare annotation is: false [2023-11-06 20:57:27,476 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1] [2023-11-06 20:57:27,479 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 20:57:27,505 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 20:57:27,506 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 20:57:27,506 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 20:57:27,507 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 20:57:27,507 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 20:57:27,507 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 20:57:27,508 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 20:57:27,508 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 20:57:27,509 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 20:57:27,509 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 20:57:27,509 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 20:57:27,509 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 20:57:27,514 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_node_create_#res#1.offset_14 : int :: ((((((((2 == ~len && ~head~0!offset == 0) && ~head~0!base == 0) && 2 == #in~len) && ~data~0 == 1) && ~data == 1) && #in~data == 1) || ((((((v_ULTIMATE.start_node_create_#res#1.offset_14 == 0 && ~head~0!offset == 0) && 2 == #in~len) && ~data~0 == 1) && ~new_head~0!offset == 0) && ~data == 1) && #in~data == 1)) && 1 <= #StackHeapBarrier) && ~len <= 2) could not be translated [2023-11-06 20:57:27,515 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_10 : [int]int :: v_#length_10[~temp~0!base := 8] == #length) could not be translated [2023-11-06 20:57:27,515 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_12 : [int]int :: v_#valid_12[~temp~0!base := 1] == #valid && v_#valid_12[~temp~0!base] == 0) could not be translated [2023-11-06 20:57:27,515 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_10 : [int]int :: v_#length_10[~temp~0!base := 8] == #length) could not be translated [2023-11-06 20:57:27,516 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_12 : [int]int :: v_#valid_12[~temp~0!base := 1] == #valid && v_#valid_12[~temp~0!base] == 0) could not be translated [2023-11-06 20:57:27,516 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_node_create_#res#1.offset_14 : int :: (2 == ~len && 1 <= #StackHeapBarrier) && ((((((~head~0!offset == 0 && ~head~0!base == 0) && 2 == #in~len) && ~data~0 == 1) && ~data == 1) && #in~data == 1) || ((((((v_ULTIMATE.start_node_create_#res#1.offset_14 == 0 && ~head~0!offset == 0) && 2 == #in~len) && ~data~0 == 1) && ~new_head~0!offset == 0) && ~data == 1) && #in~data == 1))) could not be translated [2023-11-06 20:57:27,518 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_node_create_#res#1.offset_14 : int :: ((((((((2 == ~len && ~head~0!offset == 0) && ~head~0!base == 0) && 2 == #in~len) && ~data~0 == 1) && ~data == 1) && #in~data == 1) || ((((((v_ULTIMATE.start_node_create_#res#1.offset_14 == 0 && ~head~0!offset == 0) && 2 == #in~len) && ~data~0 == 1) && ~new_head~0!offset == 0) && ~data == 1) && #in~data == 1)) && 1 <= #StackHeapBarrier) && ~len <= 2) could not be translated [2023-11-06 20:57:27,519 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_10 : [int]int :: v_#length_10[~temp~0!base := 8] == #length) could not be translated [2023-11-06 20:57:27,519 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_12 : [int]int :: v_#valid_12[~temp~0!base := 1] == #valid && v_#valid_12[~temp~0!base] == 0) could not be translated [2023-11-06 20:57:27,519 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_10 : [int]int :: v_#length_10[~temp~0!base := 8] == #length) could not be translated [2023-11-06 20:57:27,520 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_12 : [int]int :: v_#valid_12[~temp~0!base := 1] == #valid && v_#valid_12[~temp~0!base] == 0) could not be translated [2023-11-06 20:57:27,520 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_node_create_#res#1.offset_14 : int :: (2 == ~len && 1 <= #StackHeapBarrier) && ((((((~head~0!offset == 0 && ~head~0!base == 0) && 2 == #in~len) && ~data~0 == 1) && ~data == 1) && #in~data == 1) || ((((((v_ULTIMATE.start_node_create_#res#1.offset_14 == 0 && ~head~0!offset == 0) && 2 == #in~len) && ~data~0 == 1) && ~new_head~0!offset == 0) && ~data == 1) && #in~data == 1))) could not be translated [2023-11-06 20:57:27,522 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,523 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,523 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,524 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base] could not be translated [2023-11-06 20:57:27,524 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated [2023-11-06 20:57:27,526 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,526 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,527 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,527 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base] could not be translated [2023-11-06 20:57:27,528 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated [2023-11-06 20:57:27,530 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 20:57:27,530 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 20:57:27,530 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,530 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,531 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 20:57:27,531 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 20:57:27,531 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 20:57:27,532 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 20:57:27,532 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 20:57:27,532 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 20:57:27,532 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 20:57:27,533 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 20:57:27,533 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 20:57:27,533 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 20:57:27,535 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 20:57:27,535 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 20:57:27,536 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,536 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,536 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 20:57:27,536 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 20:57:27,537 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 20:57:27,537 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 20:57:27,537 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 20:57:27,537 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 20:57:27,538 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 20:57:27,538 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 20:57:27,538 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 20:57:27,538 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 20:57:27,541 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 20:57:27,541 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 20:57:27,541 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base] could not be translated [2023-11-06 20:57:27,542 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][4] could not be translated [2023-11-06 20:57:27,542 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][4]] could not be translated [2023-11-06 20:57:27,542 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][4]][#memory_$Pointer$.offset[~head!base][4]] could not be translated [2023-11-06 20:57:27,542 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 20:57:27,543 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 20:57:27,543 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 20:57:27,543 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 20:57:27,543 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,544 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 20:57:27,544 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 20:57:27,544 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 20:57:27,545 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 20:57:27,545 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 20:57:27,545 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 20:57:27,547 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 20:57:27,547 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 20:57:27,548 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base] could not be translated [2023-11-06 20:57:27,548 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][4] could not be translated [2023-11-06 20:57:27,548 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][4]] could not be translated [2023-11-06 20:57:27,548 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][4]][#memory_$Pointer$.offset[~head!base][4]] could not be translated [2023-11-06 20:57:27,549 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 20:57:27,549 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 20:57:27,549 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 20:57:27,549 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 20:57:27,550 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,550 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 20:57:27,550 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 20:57:27,551 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 20:57:27,551 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 20:57:27,551 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 20:57:27,551 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 20:57:27,553 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,554 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base] could not be translated [2023-11-06 20:57:27,554 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][4] could not be translated [2023-11-06 20:57:27,554 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 20:57:27,555 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 20:57:27,555 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,555 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base] could not be translated [2023-11-06 20:57:27,556 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][4] could not be translated [2023-11-06 20:57:27,556 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,556 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,557 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,557 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 20:57:27,557 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 20:57:27,558 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][4]] could not be translated [2023-11-06 20:57:27,558 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][4]][#memory_$Pointer$.offset[~head!base][4]] could not be translated [2023-11-06 20:57:27,558 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,560 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,560 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base] could not be translated [2023-11-06 20:57:27,560 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][4] could not be translated [2023-11-06 20:57:27,561 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 20:57:27,561 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 20:57:27,561 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,562 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base] could not be translated [2023-11-06 20:57:27,562 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][4] could not be translated [2023-11-06 20:57:27,562 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,563 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,563 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,563 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 20:57:27,564 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 20:57:27,564 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][4]] could not be translated [2023-11-06 20:57:27,564 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][4]][#memory_$Pointer$.offset[~head!base][4]] could not be translated [2023-11-06 20:57:27,564 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 08:57:27 BoogieIcfgContainer [2023-11-06 20:57:27,565 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 20:57:27,566 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 20:57:27,566 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 20:57:27,567 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 20:57:27,567 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:57:04" (3/4) ... [2023-11-06 20:57:27,570 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 20:57:27,580 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2023-11-06 20:57:27,581 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-11-06 20:57:27,581 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 20:57:27,582 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 20:57:27,615 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((\valid(head) == 1) && (1 <= len)) && (2 == \old(len))) && (data == 1)) && (len == 2)) && (data == 1)) && (\old(data) == 1)) && (len <= 2)) || (((2 == len) && (((((2 == \old(len)) && (data == 1)) && (data == 1)) && (\old(data) == 1)) || (((((head == 0) && (2 == \old(len))) && (data == 1)) && (data == 1)) && (\old(data) == 1)))) && (len == 2))) || (((((((\valid(head) == 1) && (2 == \old(len))) && (data == 1)) && (len == 2)) && (data == 1)) && (\old(data) == 1)) && (len <= 2))) [2023-11-06 20:57:27,615 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((data == \old(data)) && !((temp == head))) && (\valid(head) == 1)) && (1 <= len)) && (len == 2)) && (data == \old(data))) && !((temp == 0))) || ((((data == \old(data)) && (len == 2)) && (data == \old(data))) && !((temp == 0)))) [2023-11-06 20:57:27,616 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((s == \result) && (i == 1)) && (data == 1)) && (len == 2)) || ((i == 0) && (len == 2))) || ((i <= 0) && (len == 2))) [2023-11-06 20:57:27,616 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!((head == s)) && (3 == data)) && (i == 1)) && (index <= 0)) && (len == 2)) || (((((((((((s == \result) && (index == 1)) && (3 == data)) && (i == 1)) && (head == s)) && (3 == new_data)) && (data == 1)) && (len == 2)) && (\old(index) == 1)) && (head == s)) && (3 == \old(data)))) || (((((i == 0) && (2 == data)) && (len == 2)) && (index == 0)) && (head == s))) [2023-11-06 20:57:27,642 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((\valid(head) == 1) && (1 <= len)) && (2 == \old(len))) && (data == 1)) && (len == 2)) && (data == 1)) && (\old(data) == 1)) && (len <= 2)) || (((2 == len) && (((((2 == \old(len)) && (data == 1)) && (data == 1)) && (\old(data) == 1)) || (((((head == 0) && (2 == \old(len))) && (data == 1)) && (data == 1)) && (\old(data) == 1)))) && (len == 2))) || (((((((\valid(head) == 1) && (2 == \old(len))) && (data == 1)) && (len == 2)) && (data == 1)) && (\old(data) == 1)) && (len <= 2))) [2023-11-06 20:57:27,642 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((data == \old(data)) && !((temp == head))) && (\valid(head) == 1)) && (1 <= len)) && (len == 2)) && (data == \old(data))) && !((temp == 0))) || ((((data == \old(data)) && (len == 2)) && (data == \old(data))) && !((temp == 0)))) [2023-11-06 20:57:27,643 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((s == \result) && (i == 1)) && (data == 1)) && (len == 2)) || ((i == 0) && (len == 2))) || ((i <= 0) && (len == 2))) [2023-11-06 20:57:27,646 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!((head == s)) && (3 == data)) && (i == 1)) && (index <= 0)) && (len == 2)) || (((((((((((s == \result) && (index == 1)) && (3 == data)) && (i == 1)) && (head == s)) && (3 == new_data)) && (data == 1)) && (len == 2)) && (\old(index) == 1)) && (head == s)) && (3 == \old(data)))) || (((((i == 0) && (2 == data)) && (len == 2)) && (index == 0)) && (head == s))) [2023-11-06 20:57:27,662 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/witness.graphml.graphml [2023-11-06 20:57:27,662 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/witness.graphml.yaml [2023-11-06 20:57:27,662 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 20:57:27,663 INFO L158 Benchmark]: Toolchain (without parser) took 24964.61ms. Allocated memory was 163.6MB in the beginning and 413.1MB in the end (delta: 249.6MB). Free memory was 132.7MB in the beginning and 224.7MB in the end (delta: -92.0MB). Peak memory consumption was 158.6MB. Max. memory is 16.1GB. [2023-11-06 20:57:27,664 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 125.8MB. Free memory is still 97.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 20:57:27,664 INFO L158 Benchmark]: CACSL2BoogieTranslator took 573.07ms. Allocated memory is still 163.6MB. Free memory was 132.0MB in the beginning and 115.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-06 20:57:27,665 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.23ms. Allocated memory is still 163.6MB. Free memory was 115.2MB in the beginning and 113.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 20:57:27,665 INFO L158 Benchmark]: Boogie Preprocessor took 54.10ms. Allocated memory is still 163.6MB. Free memory was 113.1MB in the beginning and 111.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 20:57:27,666 INFO L158 Benchmark]: RCFGBuilder took 694.80ms. Allocated memory is still 163.6MB. Free memory was 111.0MB in the beginning and 116.2MB in the end (delta: -5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-06 20:57:27,666 INFO L158 Benchmark]: TraceAbstraction took 23474.98ms. Allocated memory was 163.6MB in the beginning and 413.1MB in the end (delta: 249.6MB). Free memory was 115.4MB in the beginning and 230.0MB in the end (delta: -114.6MB). Peak memory consumption was 135.8MB. Max. memory is 16.1GB. [2023-11-06 20:57:27,666 INFO L158 Benchmark]: Witness Printer took 96.59ms. Allocated memory is still 413.1MB. Free memory was 230.0MB in the beginning and 224.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-06 20:57:27,675 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 125.8MB. Free memory is still 97.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 573.07ms. Allocated memory is still 163.6MB. Free memory was 132.0MB in the beginning and 115.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.23ms. Allocated memory is still 163.6MB. Free memory was 115.2MB in the beginning and 113.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.10ms. Allocated memory is still 163.6MB. Free memory was 113.1MB in the beginning and 111.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 694.80ms. Allocated memory is still 163.6MB. Free memory was 111.0MB in the beginning and 116.2MB in the end (delta: -5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 23474.98ms. Allocated memory was 163.6MB in the beginning and 413.1MB in the end (delta: 249.6MB). Free memory was 115.4MB in the beginning and 230.0MB in the end (delta: -114.6MB). Peak memory consumption was 135.8MB. Max. memory is 16.1GB. * Witness Printer took 96.59ms. Allocated memory is still 413.1MB. Free memory was 230.0MB in the beginning and 224.7MB in the end (delta: 5.2MB). 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 #memory_$Pointer$.base[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_node_create_#res#1.offset_14 : int :: ((((((((2 == ~len && ~head~0!offset == 0) && ~head~0!base == 0) && 2 == #in~len) && ~data~0 == 1) && ~data == 1) && #in~data == 1) || ((((((v_ULTIMATE.start_node_create_#res#1.offset_14 == 0 && ~head~0!offset == 0) && 2 == #in~len) && ~data~0 == 1) && ~new_head~0!offset == 0) && ~data == 1) && #in~data == 1)) && 1 <= #StackHeapBarrier) && ~len <= 2) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#length_10 : [int]int :: v_#length_10[~temp~0!base := 8] == #length) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#valid_12 : [int]int :: v_#valid_12[~temp~0!base := 1] == #valid && v_#valid_12[~temp~0!base] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#length_10 : [int]int :: v_#length_10[~temp~0!base := 8] == #length) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#valid_12 : [int]int :: v_#valid_12[~temp~0!base := 1] == #valid && v_#valid_12[~temp~0!base] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_node_create_#res#1.offset_14 : int :: (2 == ~len && 1 <= #StackHeapBarrier) && ((((((~head~0!offset == 0 && ~head~0!base == 0) && 2 == #in~len) && ~data~0 == 1) && ~data == 1) && #in~data == 1) || ((((((v_ULTIMATE.start_node_create_#res#1.offset_14 == 0 && ~head~0!offset == 0) && 2 == #in~len) && ~data~0 == 1) && ~new_head~0!offset == 0) && ~data == 1) && #in~data == 1))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_node_create_#res#1.offset_14 : int :: ((((((((2 == ~len && ~head~0!offset == 0) && ~head~0!base == 0) && 2 == #in~len) && ~data~0 == 1) && ~data == 1) && #in~data == 1) || ((((((v_ULTIMATE.start_node_create_#res#1.offset_14 == 0 && ~head~0!offset == 0) && 2 == #in~len) && ~data~0 == 1) && ~new_head~0!offset == 0) && ~data == 1) && #in~data == 1)) && 1 <= #StackHeapBarrier) && ~len <= 2) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#length_10 : [int]int :: v_#length_10[~temp~0!base := 8] == #length) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#valid_12 : [int]int :: v_#valid_12[~temp~0!base := 1] == #valid && v_#valid_12[~temp~0!base] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#length_10 : [int]int :: v_#length_10[~temp~0!base := 8] == #length) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#valid_12 : [int]int :: v_#valid_12[~temp~0!base := 1] == #valid && v_#valid_12[~temp~0!base] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_node_create_#res#1.offset_14 : int :: (2 == ~len && 1 <= #StackHeapBarrier) && ((((((~head~0!offset == 0 && ~head~0!base == 0) && 2 == #in~len) && ~data~0 == 1) && ~data == 1) && #in~data == 1) || ((((((v_ULTIMATE.start_node_create_#res#1.offset_14 == 0 && ~head~0!offset == 0) && 2 == #in~len) && ~data~0 == 1) && ~new_head~0!offset == 0) && ~data == 1) && #in~data == 1))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][4]][#memory_$Pointer$.offset[~head!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!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: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][4]][#memory_$Pointer$.offset[~head!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!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: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!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: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] 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: ArrayAccessExpression #memory_$Pointer$.base[~head!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][4] 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: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][4]][#memory_$Pointer$.offset[~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: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] 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: ArrayAccessExpression #memory_$Pointer$.base[~head!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][4] 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: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][4]][#memory_$Pointer$.offset[~head!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!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: 630]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.3s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 282 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 282 mSDsluCounter, 236 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 269 IncrementalHoareTripleChecker+Unchecked, 183 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 914 IncrementalHoareTripleChecker+Invalid, 1214 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 53 mSDtfsCounter, 914 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 351 GetRequests, 177 SyntacticMatches, 9 SemanticMatches, 165 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=7, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 36 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 27 NumberOfFragments, 795 HoareAnnotationTreeSize, 10 FomulaSimplifications, 1213 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 10 FomulaSimplificationsInter, 256 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 266 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 325 ConstructedInterpolants, 6 QuantifiedInterpolants, 2053 SizeOfPredicates, 52 NumberOfNonLiveVariables, 1414 ConjunctsInSsa, 164 ConjunctsInUnsatCore, 22 InterpolantComputations, 6 PerfectInterpolantSequences, 148/213 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: 1.2s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 1, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 6, DAG_INTERPRETER_EARLY_EXITS: 2, TOOLS_POST_APPLICATIONS: 14, TOOLS_POST_TIME: 0.9s, 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: 13, TOOLS_QUANTIFIERELIM_TIME: 0.9s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.3s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 30, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 0, DOMAIN_JOIN_TIME: 0.0s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 2, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 4, DOMAIN_ISSUBSETEQ_TIME: 0.1s, DOMAIN_ISBOTTOM_APPLICATIONS: 6, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 2, LOOP_SUMMARIZER_CACHE_MISSES: 2, LOOP_SUMMARIZER_OVERALL_TIME: 1.1s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 1.1s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 4, 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.0s, DAG_COMPRESSION_PROCESSED_NODES: 120, DAG_COMPRESSION_RETAINED_NODES: 32, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 622]: Loop Invariant [2023-11-06 20:57:27,720 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 20:57:27,721 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 20:57:27,721 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 20:57:27,722 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 20:57:27,722 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 20:57:27,722 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 20:57:27,723 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 20:57:27,724 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 20:57:27,724 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 20:57:27,725 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 20:57:27,725 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 20:57:27,726 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated Derived loop invariant: (((i == 1) && (len == 2)) || (((*s == 2) && (i <= 0)) && (len == 2))) - InvariantResult [Line: 576]: Loop Invariant [2023-11-06 20:57:27,729 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_node_create_#res#1.offset_14 : int :: ((((((((2 == ~len && ~head~0!offset == 0) && ~head~0!base == 0) && 2 == #in~len) && ~data~0 == 1) && ~data == 1) && #in~data == 1) || ((((((v_ULTIMATE.start_node_create_#res#1.offset_14 == 0 && ~head~0!offset == 0) && 2 == #in~len) && ~data~0 == 1) && ~new_head~0!offset == 0) && ~data == 1) && #in~data == 1)) && 1 <= #StackHeapBarrier) && ~len <= 2) could not be translated [2023-11-06 20:57:27,729 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_10 : [int]int :: v_#length_10[~temp~0!base := 8] == #length) could not be translated [2023-11-06 20:57:27,729 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_12 : [int]int :: v_#valid_12[~temp~0!base := 1] == #valid && v_#valid_12[~temp~0!base] == 0) could not be translated [2023-11-06 20:57:27,736 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_10 : [int]int :: v_#length_10[~temp~0!base := 8] == #length) could not be translated [2023-11-06 20:57:27,736 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_12 : [int]int :: v_#valid_12[~temp~0!base := 1] == #valid && v_#valid_12[~temp~0!base] == 0) could not be translated [2023-11-06 20:57:27,737 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_node_create_#res#1.offset_14 : int :: (2 == ~len && 1 <= #StackHeapBarrier) && ((((((~head~0!offset == 0 && ~head~0!base == 0) && 2 == #in~len) && ~data~0 == 1) && ~data == 1) && #in~data == 1) || ((((((v_ULTIMATE.start_node_create_#res#1.offset_14 == 0 && ~head~0!offset == 0) && 2 == #in~len) && ~data~0 == 1) && ~new_head~0!offset == 0) && ~data == 1) && #in~data == 1))) could not be translated [2023-11-06 20:57:27,738 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_node_create_#res#1.offset_14 : int :: ((((((((2 == ~len && ~head~0!offset == 0) && ~head~0!base == 0) && 2 == #in~len) && ~data~0 == 1) && ~data == 1) && #in~data == 1) || ((((((v_ULTIMATE.start_node_create_#res#1.offset_14 == 0 && ~head~0!offset == 0) && 2 == #in~len) && ~data~0 == 1) && ~new_head~0!offset == 0) && ~data == 1) && #in~data == 1)) && 1 <= #StackHeapBarrier) && ~len <= 2) could not be translated [2023-11-06 20:57:27,741 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_10 : [int]int :: v_#length_10[~temp~0!base := 8] == #length) could not be translated [2023-11-06 20:57:27,741 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_12 : [int]int :: v_#valid_12[~temp~0!base := 1] == #valid && v_#valid_12[~temp~0!base] == 0) could not be translated [2023-11-06 20:57:27,741 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_10 : [int]int :: v_#length_10[~temp~0!base := 8] == #length) could not be translated [2023-11-06 20:57:27,741 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_12 : [int]int :: v_#valid_12[~temp~0!base := 1] == #valid && v_#valid_12[~temp~0!base] == 0) could not be translated [2023-11-06 20:57:27,742 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_node_create_#res#1.offset_14 : int :: (2 == ~len && 1 <= #StackHeapBarrier) && ((((((~head~0!offset == 0 && ~head~0!base == 0) && 2 == #in~len) && ~data~0 == 1) && ~data == 1) && #in~data == 1) || ((((((v_ULTIMATE.start_node_create_#res#1.offset_14 == 0 && ~head~0!offset == 0) && 2 == #in~len) && ~data~0 == 1) && ~new_head~0!offset == 0) && ~data == 1) && #in~data == 1))) could not be translated Derived loop invariant: ((((((((data == \old(data)) && !((temp == head))) && (\valid(head) == 1)) && (1 <= len)) && (len == 2)) && (data == \old(data))) && !((temp == 0))) || ((((data == \old(data)) && (len == 2)) && (data == \old(data))) && !((temp == 0)))) - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 585]: Loop Invariant [2023-11-06 20:57:27,743 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,748 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,749 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,749 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base] could not be translated [2023-11-06 20:57:27,749 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated [2023-11-06 20:57:27,750 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,750 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,751 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,751 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base] could not be translated [2023-11-06 20:57:27,751 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated Derived loop invariant: ((((((((((\valid(head) == 1) && (1 <= len)) && (2 == \old(len))) && (data == 1)) && (len == 2)) && (data == 1)) && (\old(data) == 1)) && (len <= 2)) || (((2 == len) && (((((2 == \old(len)) && (data == 1)) && (data == 1)) && (\old(data) == 1)) || (((((head == 0) && (2 == \old(len))) && (data == 1)) && (data == 1)) && (\old(data) == 1)))) && (len == 2))) || (((((((\valid(head) == 1) && (2 == \old(len))) && (data == 1)) && (len == 2)) && (data == 1)) && (\old(data) == 1)) && (len <= 2))) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 618]: Loop Invariant [2023-11-06 20:57:27,752 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 20:57:27,753 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 20:57:27,753 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,756 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,756 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 20:57:27,757 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 20:57:27,757 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 20:57:27,757 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 20:57:27,757 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 20:57:27,758 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 20:57:27,758 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 20:57:27,758 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 20:57:27,758 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 20:57:27,758 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 20:57:27,759 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 20:57:27,759 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 20:57:27,760 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,762 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,762 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 20:57:27,762 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 20:57:27,763 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 20:57:27,763 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 20:57:27,763 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 20:57:27,763 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 20:57:27,763 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 20:57:27,764 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 20:57:27,764 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 20:57:27,764 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated Derived loop invariant: ((((((s == \result) && (i == 1)) && (data == 1)) && (len == 2)) || ((i == 0) && (len == 2))) || ((i <= 0) && (len == 2))) - InvariantResult [Line: 600]: Loop Invariant [2023-11-06 20:57:27,765 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 20:57:27,767 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 20:57:27,767 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base] could not be translated [2023-11-06 20:57:27,767 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][4] could not be translated [2023-11-06 20:57:27,768 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][4]] could not be translated [2023-11-06 20:57:27,770 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][4]][#memory_$Pointer$.offset[~head!base][4]] could not be translated [2023-11-06 20:57:27,771 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 20:57:27,771 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 20:57:27,771 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 20:57:27,771 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 20:57:27,772 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,772 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 20:57:27,772 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 20:57:27,773 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 20:57:27,773 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 20:57:27,773 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 20:57:27,773 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 20:57:27,774 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 20:57:27,777 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 20:57:27,777 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base] could not be translated [2023-11-06 20:57:27,777 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][4] could not be translated [2023-11-06 20:57:27,778 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][4]] could not be translated [2023-11-06 20:57:27,778 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][4]][#memory_$Pointer$.offset[~head!base][4]] could not be translated [2023-11-06 20:57:27,778 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 20:57:27,778 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 20:57:27,778 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 20:57:27,779 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 20:57:27,780 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,780 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 20:57:27,780 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 20:57:27,780 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 20:57:27,781 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 20:57:27,781 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 20:57:27,781 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated Derived loop invariant: ((((((i == 1) && (3 == expected)) && (len == 2)) && (index == 1)) || ((((((index <= 0) && (*s == 2)) && (i == 0)) && (2 == expected)) && (*head == 2)) && (len == 2))) || (((((index <= 0) && (i == 1)) && (3 == expected)) && (*head == 3)) && (len == 2))) - InvariantResult [Line: 607]: Loop Invariant [2023-11-06 20:57:27,782 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,782 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base] could not be translated [2023-11-06 20:57:27,782 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][4] could not be translated [2023-11-06 20:57:27,783 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 20:57:27,783 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 20:57:27,784 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,784 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base] could not be translated [2023-11-06 20:57:27,784 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][4] could not be translated [2023-11-06 20:57:27,784 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,785 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,786 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,786 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 20:57:27,787 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 20:57:27,787 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][4]] could not be translated [2023-11-06 20:57:27,787 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][4]][#memory_$Pointer$.offset[~head!base][4]] could not be translated [2023-11-06 20:57:27,787 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,788 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,789 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base] could not be translated [2023-11-06 20:57:27,789 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][4] could not be translated [2023-11-06 20:57:27,789 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 20:57:27,790 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 20:57:27,790 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,790 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base] could not be translated [2023-11-06 20:57:27,790 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][4] could not be translated [2023-11-06 20:57:27,791 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,791 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,791 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 20:57:27,791 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 20:57:27,792 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 20:57:27,792 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][4]] could not be translated [2023-11-06 20:57:27,792 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][4]][#memory_$Pointer$.offset[~head!base][4]] could not be translated [2023-11-06 20:57:27,792 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression Derived loop invariant: ((((((!((head == s)) && (3 == data)) && (i == 1)) && (index <= 0)) && (len == 2)) || (((((((((((s == \result) && (index == 1)) && (3 == data)) && (i == 1)) && (head == s)) && (3 == new_data)) && (data == 1)) && (len == 2)) && (\old(index) == 1)) && (head == s)) && (3 == \old(data)))) || (((((i == 0) && (2 == data)) && (len == 2)) && (index == 0)) && (head == s))) RESULT: Ultimate proved your program to be correct! [2023-11-06 20:57:27,812 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22313f64-5e73-4d90-8bf3-63300ba6821c/bin/utaipan-verify-FOvIYxoinp/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE