./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2n_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a 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_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_update_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur --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 c46cc56772f2c3f0b073640343b328fb3b128ed13803ffe5a04f6290fe624494 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-26 00:06:38,025 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:06:38,039 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:06:38,072 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:06:38,073 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:06:38,077 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:06:38,081 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:06:38,086 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:06:38,089 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:06:38,095 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:06:38,097 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:06:38,100 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:06:38,100 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:06:38,107 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:06:38,108 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:06:38,110 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:06:38,112 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:06:38,113 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:06:38,115 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:06:38,123 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:06:38,125 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:06:38,128 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:06:38,129 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:06:38,130 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:06:38,140 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:06:38,140 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:06:38,141 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:06:38,143 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:06:38,144 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:06:38,146 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:06:38,147 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:06:38,148 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:06:38,150 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:06:38,152 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:06:38,154 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:06:38,154 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:06:38,155 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:06:38,155 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:06:38,156 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:06:38,158 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:06:38,159 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:06:38,160 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-26 00:06:38,210 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:06:38,212 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:06:38,212 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:06:38,213 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:06:38,214 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:06:38,214 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:06:38,214 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:06:38,215 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:06:38,215 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:06:38,215 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 00:06:38,216 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:06:38,216 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:06:38,217 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 00:06:38,217 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 00:06:38,217 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:06:38,217 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 00:06:38,218 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 00:06:38,218 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 00:06:38,219 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:06:38,219 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:06:38,219 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:06:38,220 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:06:38,220 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:06:38,220 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 00:06:38,220 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:06:38,221 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 00:06:38,221 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:06:38,221 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 00:06:38,221 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:06:38,222 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 00:06:38,222 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:06:38,222 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:06:38,223 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:06:38,223 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:06:38,223 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 00:06:38,223 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:06:38,224 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 00:06:38,224 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 00:06:38,224 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 00:06:38,224 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 00:06:38,225 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:06:38,225 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/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_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur 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 -> c46cc56772f2c3f0b073640343b328fb3b128ed13803ffe5a04f6290fe624494 [2022-11-26 00:06:38,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:06:38,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:06:38,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:06:38,676 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:06:38,677 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:06:38,678 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/list-simple/dll2n_update_all.i [2022-11-26 00:06:41,908 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:06:42,217 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:06:42,217 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/sv-benchmarks/c/list-simple/dll2n_update_all.i [2022-11-26 00:06:42,242 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/data/a8f70f8c7/58ceb3e7d06c444698e06caf77ca98e6/FLAG813485ba7 [2022-11-26 00:06:42,260 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/data/a8f70f8c7/58ceb3e7d06c444698e06caf77ca98e6 [2022-11-26 00:06:42,270 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:06:42,274 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:06:42,278 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:06:42,279 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:06:42,283 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:06:42,284 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:06:42" (1/1) ... [2022-11-26 00:06:42,285 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12fd88d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:06:42, skipping insertion in model container [2022-11-26 00:06:42,287 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:06:42" (1/1) ... [2022-11-26 00:06:42,295 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:06:42,351 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:06:42,662 WARN L237 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_41056f57-1eb1-41f1-92b1-9c826cb683da/sv-benchmarks/c/list-simple/dll2n_update_all.i[24455,24468] [2022-11-26 00:06:42,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:06:42,682 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:06:42,754 WARN L237 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_41056f57-1eb1-41f1-92b1-9c826cb683da/sv-benchmarks/c/list-simple/dll2n_update_all.i[24455,24468] [2022-11-26 00:06:42,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:06:42,793 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:06:42,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:06:42 WrapperNode [2022-11-26 00:06:42,794 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:06:42,795 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:06:42,796 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:06:42,796 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:06:42,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:06:42" (1/1) ... [2022-11-26 00:06:42,819 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:06:42" (1/1) ... [2022-11-26 00:06:42,841 INFO L138 Inliner]: procedures = 126, calls = 27, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 111 [2022-11-26 00:06:42,842 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:06:42,842 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:06:42,843 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:06:42,843 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:06:42,853 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:06:42" (1/1) ... [2022-11-26 00:06:42,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:06:42" (1/1) ... [2022-11-26 00:06:42,857 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:06:42" (1/1) ... [2022-11-26 00:06:42,858 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:06:42" (1/1) ... [2022-11-26 00:06:42,864 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:06:42" (1/1) ... [2022-11-26 00:06:42,869 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:06:42" (1/1) ... [2022-11-26 00:06:42,871 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:06:42" (1/1) ... [2022-11-26 00:06:42,872 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:06:42" (1/1) ... [2022-11-26 00:06:42,875 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:06:42,876 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:06:42,876 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:06:42,876 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:06:42,877 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:06:42" (1/1) ... [2022-11-26 00:06:42,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:06:42,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:06:42,913 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:06:42,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:06:42,980 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-26 00:06:42,980 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-26 00:06:42,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-26 00:06:42,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-26 00:06:42,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-26 00:06:42,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 00:06:42,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-26 00:06:42,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-26 00:06:42,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-26 00:06:42,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-26 00:06:42,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:06:42,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:06:43,101 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:06:43,103 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:06:43,145 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-26 00:06:43,399 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:06:43,459 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:06:43,459 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-26 00:06:43,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:06:43 BoogieIcfgContainer [2022-11-26 00:06:43,463 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:06:43,465 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:06:43,465 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:06:43,469 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:06:43,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:06:42" (1/3) ... [2022-11-26 00:06:43,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bdb7cb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:06:43, skipping insertion in model container [2022-11-26 00:06:43,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:06:42" (2/3) ... [2022-11-26 00:06:43,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bdb7cb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:06:43, skipping insertion in model container [2022-11-26 00:06:43,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:06:43" (3/3) ... [2022-11-26 00:06:43,472 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_update_all.i [2022-11-26 00:06:43,494 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:06:43,494 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-26 00:06:43,556 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:06:43,563 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;@79fafa31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:06:43,564 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-26 00:06:43,568 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:06:43,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-26 00:06:43,577 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:06:43,577 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:06:43,578 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:06:43,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:06:43,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1570243634, now seen corresponding path program 1 times [2022-11-26 00:06:43,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:06:43,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591225152] [2022-11-26 00:06:43,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:06:43,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:06:43,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:06:43,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:06:43,947 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:06:43,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591225152] [2022-11-26 00:06:43,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591225152] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:06:43,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:06:43,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:06:43,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080986736] [2022-11-26 00:06:43,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:06:43,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:06:43,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:06:44,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:06:44,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:06:44,042 INFO L87 Difference]: Start difference. First operand has 17 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 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) [2022-11-26 00:06:44,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:06:44,154 INFO L93 Difference]: Finished difference Result 31 states and 45 transitions. [2022-11-26 00:06:44,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:06:44,158 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 [2022-11-26 00:06:44,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:06:44,169 INFO L225 Difference]: With dead ends: 31 [2022-11-26 00:06:44,170 INFO L226 Difference]: Without dead ends: 14 [2022-11-26 00:06:44,174 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 [2022-11-26 00:06:44,185 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 3 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:06:44,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 24 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:06:44,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-11-26 00:06:44,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2022-11-26 00:06:44,246 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) [2022-11-26 00:06:44,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2022-11-26 00:06:44,257 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 7 [2022-11-26 00:06:44,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:06:44,258 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-11-26 00:06:44,258 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) [2022-11-26 00:06:44,259 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2022-11-26 00:06:44,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-26 00:06:44,260 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:06:44,260 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:06:44,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 00:06:44,260 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:06:44,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:06:44,262 INFO L85 PathProgramCache]: Analyzing trace with hash 299858783, now seen corresponding path program 1 times [2022-11-26 00:06:44,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:06:44,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184376877] [2022-11-26 00:06:44,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:06:44,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:06:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:06:44,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:06:44,539 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:06:44,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184376877] [2022-11-26 00:06:44,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184376877] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:06:44,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262011073] [2022-11-26 00:06:44,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:06:44,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:06:44,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:06:44,547 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:06:44,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-26 00:06:44,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:06:44,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-26 00:06:44,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:06:44,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:06:44,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:06:44,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:06:44,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262011073] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:06:44,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1815414973] [2022-11-26 00:06:44,770 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-26 00:06:44,770 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:06:44,774 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:06:44,781 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:06:44,782 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:06:44,960 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-26 00:06:44,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-26 00:06:45,042 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-26 00:06:45,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-26 00:06:45,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:45,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:45,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-26 00:06:45,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:45,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:45,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2022-11-26 00:06:45,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:45,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:45,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-26 00:06:45,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:45,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:45,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-26 00:06:45,575 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-26 00:06:45,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2022-11-26 00:06:45,624 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-26 00:06:45,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2022-11-26 00:06:46,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:46,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:46,504 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-26 00:06:46,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 315 treesize of output 293 [2022-11-26 00:06:46,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:46,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:46,634 INFO L321 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-11-26 00:06:46,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 319 treesize of output 296 [2022-11-26 00:06:46,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:46,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:46,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 308 treesize of output 299 [2022-11-26 00:06:46,771 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:06:46,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:46,776 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:06:46,777 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:06:46,778 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:06:46,862 INFO L321 Elim1Store]: treesize reduction 66, result has 32.0 percent of original size [2022-11-26 00:06:46,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 455 treesize of output 483 [2022-11-26 00:06:46,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:46,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:46,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 326 treesize of output 317 [2022-11-26 00:06:46,955 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:06:46,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:46,964 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:06:46,965 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:06:47,039 INFO L321 Elim1Store]: treesize reduction 74, result has 34.5 percent of original size [2022-11-26 00:06:47,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 448 treesize of output 472 [2022-11-26 00:06:47,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 78 [2022-11-26 00:06:47,493 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:06:47,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 17 [2022-11-26 00:06:47,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 31 [2022-11-26 00:06:47,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:47,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:47,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 757 treesize of output 704 [2022-11-26 00:06:47,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:47,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 684 treesize of output 670 [2022-11-26 00:06:47,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-26 00:06:48,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:48,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:48,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:48,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:48,022 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-26 00:06:48,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 720 treesize of output 667 [2022-11-26 00:06:48,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-26 00:06:48,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:06:48,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:48,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:48,279 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:06:48,285 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:06:48,331 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-26 00:06:48,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 180 [2022-11-26 00:06:48,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:48,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:48,378 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:06:48,425 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-26 00:06:48,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 164 [2022-11-26 00:06:48,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:48,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-26 00:06:48,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:48,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-26 00:06:48,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:48,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 11 [2022-11-26 00:06:48,613 INFO L321 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2022-11-26 00:06:48,614 INFO L350 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 2 case distinctions, treesize of input 61 treesize of output 30 [2022-11-26 00:06:48,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:48,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:48,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-11-26 00:06:48,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 65 [2022-11-26 00:06:48,724 INFO L350 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 25 treesize of output 3 [2022-11-26 00:06:48,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:48,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:48,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 30 [2022-11-26 00:06:48,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-26 00:06:48,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:06:48,895 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:06:49,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1815414973] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:06:49,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:06:49,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3, 3, 3] total 7 [2022-11-26 00:06:49,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434771401] [2022-11-26 00:06:49,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:06:49,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:06:49,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:06:49,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:06:49,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-26 00:06:49,211 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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) [2022-11-26 00:06:49,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:06:49,292 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2022-11-26 00:06:49,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:06:49,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2022-11-26 00:06:49,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:06:49,294 INFO L225 Difference]: With dead ends: 19 [2022-11-26 00:06:49,294 INFO L226 Difference]: Without dead ends: 14 [2022-11-26 00:06:49,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-26 00:06:49,295 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 13 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:06:49,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 12 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:06:49,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-11-26 00:06:49,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2022-11-26 00:06:49,302 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) [2022-11-26 00:06:49,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2022-11-26 00:06:49,303 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 10 [2022-11-26 00:06:49,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:06:49,303 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-11-26 00:06:49,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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) [2022-11-26 00:06:49,304 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2022-11-26 00:06:49,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-26 00:06:49,305 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:06:49,305 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:06:49,314 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-26 00:06:49,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:06:49,511 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:06:49,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:06:49,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1448453533, now seen corresponding path program 1 times [2022-11-26 00:06:49,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:06:49,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9945632] [2022-11-26 00:06:49,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:06:49,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:06:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:06:49,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:06:49,621 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:06:49,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9945632] [2022-11-26 00:06:49,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9945632] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:06:49,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273732575] [2022-11-26 00:06:49,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:06:49,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:06:49,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:06:49,623 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:06:49,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-26 00:06:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:06:49,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-26 00:06:49,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:06:49,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:06:49,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:06:49,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:06:49,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273732575] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:06:49,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1381008349] [2022-11-26 00:06:49,814 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-26 00:06:49,814 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:06:49,814 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:06:49,815 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:06:49,815 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:06:49,876 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-26 00:06:49,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-26 00:06:49,926 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-26 00:06:49,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-26 00:06:49,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:49,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:49,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-26 00:06:49,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:49,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:50,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2022-11-26 00:06:50,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:50,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:50,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-26 00:06:50,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:50,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:50,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-26 00:06:50,207 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-26 00:06:50,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2022-11-26 00:06:50,252 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-26 00:06:50,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2022-11-26 00:06:50,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:50,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:50,656 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-26 00:06:50,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 235 treesize of output 221 [2022-11-26 00:06:50,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:50,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:50,740 INFO L321 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-11-26 00:06:50,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 239 treesize of output 224 [2022-11-26 00:06:50,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:50,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:50,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 219 [2022-11-26 00:06:50,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:50,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:50,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 219 [2022-11-26 00:06:50,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:50,862 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:06:50,863 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:06:50,865 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:06:50,950 INFO L321 Elim1Store]: treesize reduction 66, result has 32.0 percent of original size [2022-11-26 00:06:50,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 375 treesize of output 403 [2022-11-26 00:06:50,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:50,978 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:06:50,980 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:06:50,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 440 treesize of output 470 [2022-11-26 00:06:51,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:51,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:51,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:51,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:51,070 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-26 00:06:51,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 367 treesize of output 322 [2022-11-26 00:06:51,209 INFO L321 Elim1Store]: treesize reduction 35, result has 2.8 percent of original size [2022-11-26 00:06:51,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 190 treesize of output 125 [2022-11-26 00:06:51,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 64 [2022-11-26 00:06:51,249 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:06:51,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:51,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 11 [2022-11-26 00:06:51,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:51,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 566 treesize of output 513 [2022-11-26 00:06:51,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-26 00:06:51,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:51,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 493 treesize of output 479 [2022-11-26 00:06:51,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-26 00:06:51,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:06:51,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:51,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:51,732 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:06:51,733 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:06:51,775 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-26 00:06:51,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 185 [2022-11-26 00:06:51,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:51,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:51,812 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:06:51,850 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-26 00:06:51,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 164 [2022-11-26 00:06:51,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:51,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-26 00:06:51,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:51,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-26 00:06:51,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:51,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 11 [2022-11-26 00:06:52,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 67 [2022-11-26 00:06:52,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:52,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:52,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 45 [2022-11-26 00:06:52,039 INFO L350 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 13 treesize of output 3 [2022-11-26 00:06:52,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 53 [2022-11-26 00:06:52,068 INFO L350 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 13 treesize of output 3 [2022-11-26 00:06:52,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:52,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:52,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 30 [2022-11-26 00:06:52,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-26 00:06:52,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:06:52,294 INFO L350 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 [2022-11-26 00:06:52,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:06:52,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:06:52,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:06:52,409 INFO L350 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 [2022-11-26 00:06:52,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:06:52,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:06:52,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:06:52,505 INFO L350 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 [2022-11-26 00:06:52,594 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:06:53,678 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '278#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= 1 |ULTIMATE.start_dll_create_~data#1|) (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_dll_get_data_at_#in~index#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 |ULTIMATE.start_dll_create_#in~len#1|) (<= |ULTIMATE.start_dll_create_#res#1.offset| 0) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_dll_get_data_at_~head#1.base|) |ULTIMATE.start_dll_get_data_at_~head#1.offset|) |ULTIMATE.start_dll_get_data_at_#res#1|) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.base| |ULTIMATE.start_dll_get_data_at_~head#1.base|) (<= 0 (+ |ULTIMATE.start_dll_get_data_at_#res#1| 2147483648)) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.offset| |ULTIMATE.start_dll_get_data_at_~head#1.offset|) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_dll_get_data_at_#res#1| 2147483647) (<= |ULTIMATE.start_dll_create_~data#1| 1) (= |ULTIMATE.start_dll_get_data_at_~index#1| |ULTIMATE.start_dll_get_data_at_#in~index#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_dll_create_#in~len#1| 2) (<= |ULTIMATE.start_dll_create_~len#1| 0) (<= 1 |ULTIMATE.start_dll_create_#in~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= |ULTIMATE.start_dll_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_create_#res#1.offset|) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (not (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_get_data_at_#res#1|)) (= |#NULL.base| 0))' at error location [2022-11-26 00:06:53,678 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:06:53,678 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:06:53,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-11-26 00:06:53,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814997410] [2022-11-26 00:06:53,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:06:53,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:06:53,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:06:53,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:06:53,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-11-26 00:06:53,680 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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) [2022-11-26 00:06:53,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:06:53,749 INFO L93 Difference]: Finished difference Result 24 states and 32 transitions. [2022-11-26 00:06:53,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:06:53,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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 12 [2022-11-26 00:06:53,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:06:53,751 INFO L225 Difference]: With dead ends: 24 [2022-11-26 00:06:53,751 INFO L226 Difference]: Without dead ends: 16 [2022-11-26 00:06:53,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-11-26 00:06:53,752 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:06:53,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 20 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:06:53,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-11-26 00:06:53,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-11-26 00:06:53,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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) [2022-11-26 00:06:53,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2022-11-26 00:06:53,759 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 12 [2022-11-26 00:06:53,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:06:53,760 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2022-11-26 00:06:53,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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) [2022-11-26 00:06:53,760 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2022-11-26 00:06:53,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-26 00:06:53,761 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:06:53,761 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:06:53,774 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-26 00:06:53,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:06:53,968 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:06:53,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:06:53,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1813339504, now seen corresponding path program 2 times [2022-11-26 00:06:53,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:06:53,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039277208] [2022-11-26 00:06:53,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:06:53,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:06:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:06:54,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:06:54,262 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:06:54,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039277208] [2022-11-26 00:06:54,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039277208] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:06:54,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290468558] [2022-11-26 00:06:54,263 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:06:54,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:06:54,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:06:54,265 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:06:54,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-26 00:06:54,413 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-26 00:06:54,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:06:54,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-26 00:06:54,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:06:54,468 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-26 00:06:54,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:06:54,507 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-26 00:06:54,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290468558] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:06:54,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [691791848] [2022-11-26 00:06:54,513 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-26 00:06:54,513 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:06:54,513 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:06:54,514 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:06:54,514 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:06:54,567 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-26 00:06:54,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-26 00:06:54,615 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-26 00:06:54,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-26 00:06:54,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:54,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:54,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2022-11-26 00:06:54,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:54,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:54,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-26 00:06:54,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:54,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:54,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-26 00:06:54,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:54,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:54,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-26 00:06:54,851 INFO L321 Elim1Store]: treesize reduction 54, result has 27.0 percent of original size [2022-11-26 00:06:54,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 227 treesize of output 235 [2022-11-26 00:06:54,940 INFO L321 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2022-11-26 00:06:54,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 230 treesize of output 245 [2022-11-26 00:06:55,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:55,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:55,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:55,507 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-26 00:06:55,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 235 treesize of output 221 [2022-11-26 00:06:55,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:55,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:55,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:55,606 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-26 00:06:55,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 239 treesize of output 224 [2022-11-26 00:06:55,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:55,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:55,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 219 [2022-11-26 00:06:55,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:55,688 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:06:55,689 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:06:55,690 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:06:55,843 INFO L321 Elim1Store]: treesize reduction 66, result has 32.0 percent of original size [2022-11-26 00:06:55,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 375 treesize of output 398 [2022-11-26 00:06:55,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:55,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 306 treesize of output 297 [2022-11-26 00:06:55,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:55,925 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:06:55,926 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:06:55,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 440 treesize of output 475 [2022-11-26 00:06:56,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 65 [2022-11-26 00:06:56,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:56,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-26 00:06:56,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-11-26 00:06:56,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:56,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:56,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:56,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:56,322 INFO L321 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2022-11-26 00:06:56,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 565 treesize of output 520 [2022-11-26 00:06:56,432 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-26 00:06:56,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 657 treesize of output 572 [2022-11-26 00:06:56,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 554 treesize of output 430 [2022-11-26 00:06:56,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 516 treesize of output 512 [2022-11-26 00:06:56,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:06:56,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-26 00:06:56,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:56,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:56,655 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:06:56,656 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:06:56,712 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-26 00:06:56,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 180 [2022-11-26 00:06:56,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:56,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:56,754 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:06:56,815 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-26 00:06:56,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 164 [2022-11-26 00:06:56,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:56,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-26 00:06:56,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:56,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-26 00:06:56,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:56,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 11 [2022-11-26 00:06:56,944 INFO L321 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2022-11-26 00:06:56,945 INFO L350 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 2 case distinctions, treesize of input 61 treesize of output 30 [2022-11-26 00:06:56,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:56,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:56,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-11-26 00:06:57,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 65 [2022-11-26 00:06:57,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:57,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:57,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 30 [2022-11-26 00:06:57,046 INFO L350 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 25 treesize of output 3 [2022-11-26 00:06:57,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:06:57,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-26 00:06:57,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:06:57,189 INFO L350 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 [2022-11-26 00:06:57,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:06:57,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:06:57,256 INFO L350 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 [2022-11-26 00:06:57,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:06:57,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:06:57,322 INFO L350 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 [2022-11-26 00:06:57,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:06:57,401 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:06:58,316 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '443#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= 1 |ULTIMATE.start_dll_create_~data#1|) (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_dll_get_data_at_#in~index#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 |ULTIMATE.start_dll_create_#in~len#1|) (<= |ULTIMATE.start_dll_create_#res#1.offset| 0) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_dll_get_data_at_~head#1.base|) |ULTIMATE.start_dll_get_data_at_~head#1.offset|) |ULTIMATE.start_dll_get_data_at_#res#1|) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.base| |ULTIMATE.start_dll_get_data_at_~head#1.base|) (<= 0 (+ |ULTIMATE.start_dll_get_data_at_#res#1| 2147483648)) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.offset| |ULTIMATE.start_dll_get_data_at_~head#1.offset|) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_dll_get_data_at_#res#1| 2147483647) (<= |ULTIMATE.start_dll_create_~data#1| 1) (= |ULTIMATE.start_dll_get_data_at_~index#1| |ULTIMATE.start_dll_get_data_at_#in~index#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_dll_create_#in~len#1| 2) (<= |ULTIMATE.start_dll_create_~len#1| 0) (<= 1 |ULTIMATE.start_dll_create_#in~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= |ULTIMATE.start_dll_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_create_#res#1.offset|) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (not (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_get_data_at_#res#1|)) (= |#NULL.base| 0))' at error location [2022-11-26 00:06:58,317 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:06:58,317 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:06:58,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-11-26 00:06:58,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835196865] [2022-11-26 00:06:58,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:06:58,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-26 00:06:58,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:06:58,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-26 00:06:58,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2022-11-26 00:06:58,320 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 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) [2022-11-26 00:06:58,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:06:58,461 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-11-26 00:06:58,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-26 00:06:58,463 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 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 15 [2022-11-26 00:06:58,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:06:58,464 INFO L225 Difference]: With dead ends: 34 [2022-11-26 00:06:58,464 INFO L226 Difference]: Without dead ends: 29 [2022-11-26 00:06:58,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2022-11-26 00:06:58,466 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 50 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 21 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 [2022-11-26 00:06:58,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 21 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:06:58,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-26 00:06:58,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2022-11-26 00:06:58,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 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) [2022-11-26 00:06:58,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2022-11-26 00:06:58,474 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 15 [2022-11-26 00:06:58,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:06:58,474 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2022-11-26 00:06:58,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 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) [2022-11-26 00:06:58,475 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-11-26 00:06:58,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-26 00:06:58,475 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:06:58,475 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:06:58,483 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-26 00:06:58,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:06:58,682 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:06:58,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:06:58,682 INFO L85 PathProgramCache]: Analyzing trace with hash -2110536562, now seen corresponding path program 3 times [2022-11-26 00:06:58,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:06:58,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254986274] [2022-11-26 00:06:58,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:06:58,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:06:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:06:58,895 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-26 00:06:58,895 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:06:58,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254986274] [2022-11-26 00:06:58,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254986274] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:06:58,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487227115] [2022-11-26 00:06:58,896 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 00:06:58,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:06:58,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:06:58,897 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:06:58,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-26 00:06:59,045 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 00:06:59,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:06:59,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-26 00:06:59,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:06:59,087 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-26 00:06:59,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:06:59,116 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-26 00:06:59,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487227115] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:06:59,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1560407483] [2022-11-26 00:06:59,119 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-26 00:06:59,119 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:06:59,119 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:06:59,120 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:06:59,120 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:06:59,168 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-26 00:06:59,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-26 00:06:59,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-26 00:06:59,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:59,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:59,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2022-11-26 00:06:59,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:59,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:59,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-26 00:06:59,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:59,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:59,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-26 00:06:59,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:59,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:59,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-26 00:06:59,391 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-26 00:06:59,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2022-11-26 00:06:59,429 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-26 00:06:59,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2022-11-26 00:06:59,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:59,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:59,704 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:06:59,798 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-26 00:06:59,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 243 treesize of output 229 [2022-11-26 00:06:59,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:59,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:59,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:59,867 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:06:59,874 INFO L321 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-11-26 00:06:59,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 247 treesize of output 232 [2022-11-26 00:06:59,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:59,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:59,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 227 [2022-11-26 00:06:59,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:59,933 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:06:59,934 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:00,048 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-26 00:07:00,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 383 treesize of output 406 [2022-11-26 00:07:00,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:00,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 314 treesize of output 305 [2022-11-26 00:07:00,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:00,108 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:00,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 448 treesize of output 483 [2022-11-26 00:07:00,310 INFO L321 Elim1Store]: treesize reduction 35, result has 2.8 percent of original size [2022-11-26 00:07:00,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 214 treesize of output 157 [2022-11-26 00:07:00,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 101 [2022-11-26 00:07:00,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 19 [2022-11-26 00:07:00,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 60 [2022-11-26 00:07:00,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 36 [2022-11-26 00:07:00,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 19 [2022-11-26 00:07:00,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:00,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:00,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:00,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:00,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:00,492 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:00,500 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-26 00:07:00,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 612 treesize of output 567 [2022-11-26 00:07:00,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:07:00,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-26 00:07:00,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:00,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:00,793 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:00,874 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-26 00:07:00,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 189 [2022-11-26 00:07:00,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:00,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:00,911 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:00,913 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:00,948 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-26 00:07:00,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 173 [2022-11-26 00:07:00,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:00,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:00,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-26 00:07:01,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:01,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 11 [2022-11-26 00:07:01,064 INFO L321 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2022-11-26 00:07:01,065 INFO L350 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 2 case distinctions, treesize of input 142 treesize of output 101 [2022-11-26 00:07:01,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:01,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:01,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 71 [2022-11-26 00:07:01,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 53 [2022-11-26 00:07:01,113 INFO L350 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 13 treesize of output 3 [2022-11-26 00:07:01,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:01,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:01,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 30 [2022-11-26 00:07:01,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-26 00:07:01,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:07:01,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:07:01,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:07:01,279 INFO L350 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 [2022-11-26 00:07:01,324 INFO L350 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 [2022-11-26 00:07:01,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:07:01,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:07:01,404 INFO L350 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 [2022-11-26 00:07:01,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:07:01,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:07:01,512 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:07:02,575 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '642#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= 1 |ULTIMATE.start_dll_create_~data#1|) (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_dll_get_data_at_#in~index#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 |ULTIMATE.start_dll_create_#in~len#1|) (<= |ULTIMATE.start_dll_create_#res#1.offset| 0) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_dll_get_data_at_~head#1.base|) |ULTIMATE.start_dll_get_data_at_~head#1.offset|) |ULTIMATE.start_dll_get_data_at_#res#1|) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.base| |ULTIMATE.start_dll_get_data_at_~head#1.base|) (<= 0 (+ |ULTIMATE.start_dll_get_data_at_#res#1| 2147483648)) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.offset| |ULTIMATE.start_dll_get_data_at_~head#1.offset|) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_dll_get_data_at_#res#1| 2147483647) (<= |ULTIMATE.start_dll_create_~data#1| 1) (= |ULTIMATE.start_dll_get_data_at_~index#1| |ULTIMATE.start_dll_get_data_at_#in~index#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_dll_create_#in~len#1| 2) (<= |ULTIMATE.start_dll_create_~len#1| 0) (<= 1 |ULTIMATE.start_dll_create_#in~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= |ULTIMATE.start_dll_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_create_#res#1.offset|) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (not (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_get_data_at_#res#1|)) (= |#NULL.base| 0))' at error location [2022-11-26 00:07:02,576 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:07:02,576 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:07:02,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-11-26 00:07:02,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258981510] [2022-11-26 00:07:02,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:07:02,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-26 00:07:02,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:07:02,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-26 00:07:02,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2022-11-26 00:07:02,578 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:07:02,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:07:02,797 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-11-26 00:07:02,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-26 00:07:02,797 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-26 00:07:02,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:07:02,798 INFO L225 Difference]: With dead ends: 33 [2022-11-26 00:07:02,798 INFO L226 Difference]: Without dead ends: 26 [2022-11-26 00:07:02,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2022-11-26 00:07:02,799 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 34 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:07:02,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 34 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:07:02,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-26 00:07:02,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2022-11-26 00:07:02,807 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) [2022-11-26 00:07:02,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-11-26 00:07:02,807 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 17 [2022-11-26 00:07:02,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:07:02,808 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-11-26 00:07:02,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:07:02,808 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-11-26 00:07:02,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-26 00:07:02,809 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:07:02,809 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:07:02,819 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-26 00:07:03,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:07:03,011 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:07:03,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:07:03,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1814988096, now seen corresponding path program 1 times [2022-11-26 00:07:03,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:07:03,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777132081] [2022-11-26 00:07:03,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:03,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:07:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:04,338 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:07:04,339 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:07:04,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777132081] [2022-11-26 00:07:04,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777132081] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:07:04,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684292728] [2022-11-26 00:07:04,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:04,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:07:04,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:07:04,341 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:07:04,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-26 00:07:04,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:04,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-26 00:07:04,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:07:04,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:07:04,625 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-26 00:07:04,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-26 00:07:04,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-11-26 00:07:04,692 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:07:04,692 INFO L350 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 44 treesize of output 41 [2022-11-26 00:07:04,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-11-26 00:07:04,876 INFO L350 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 [2022-11-26 00:07:04,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-11-26 00:07:05,090 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:05,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-26 00:07:05,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-26 00:07:05,313 INFO L350 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 22 treesize of output 10 [2022-11-26 00:07:05,348 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:07:05,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:07:05,458 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_650 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_650) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_650 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_650) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-11-26 00:07:05,478 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)))) (and (forall ((v_ArrVal_650 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| .cse0 v_ArrVal_650) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_650 (Array Int Int))) (<= (select (select (store |c_#memory_int| .cse0 v_ArrVal_650) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|)))) is different from false [2022-11-26 00:07:05,493 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (and (forall ((v_ArrVal_650 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| .cse0 v_ArrVal_650) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_650 (Array Int Int))) (<= (select (select (store |c_#memory_int| .cse0 v_ArrVal_650) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|)))) is different from false [2022-11-26 00:07:05,529 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| |c_ULTIMATE.start_dll_update_at_~data#1|))) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_649 Int) (v_ArrVal_650 (Array Int Int))) (<= (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store .cse1 |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_649)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_650) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_649 Int) (v_ArrVal_650 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store .cse1 |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_649)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_650) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-11-26 00:07:05,785 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:07:05,786 INFO L350 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 2 case distinctions, treesize of input 87 treesize of output 78 [2022-11-26 00:07:05,813 INFO L321 Elim1Store]: treesize reduction 10, result has 70.6 percent of original size [2022-11-26 00:07:05,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 86 [2022-11-26 00:07:05,837 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:07:05,838 INFO L350 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 1 case distinctions, treesize of input 7 treesize of output 6 [2022-11-26 00:07:05,857 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:07:05,857 INFO L350 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 49 treesize of output 42 [2022-11-26 00:07:05,863 INFO L350 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 78 treesize of output 66 [2022-11-26 00:07:05,870 INFO L350 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 33 treesize of output 31 [2022-11-26 00:07:05,874 INFO L350 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 31 treesize of output 29 [2022-11-26 00:07:05,891 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:07:05,892 INFO L350 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 64 treesize of output 40 [2022-11-26 00:07:05,897 INFO L350 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 8 treesize of output 4 [2022-11-26 00:07:06,005 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-26 00:07:06,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684292728] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:07:06,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [655763972] [2022-11-26 00:07:06,008 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-26 00:07:06,008 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:07:06,008 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:07:06,008 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:07:06,009 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:07:06,059 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-26 00:07:06,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-26 00:07:06,107 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-26 00:07:06,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-26 00:07:06,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:06,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:06,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-26 00:07:06,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:06,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:06,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2022-11-26 00:07:06,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:06,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:06,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-26 00:07:06,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:06,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:06,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-26 00:07:06,293 INFO L321 Elim1Store]: treesize reduction 54, result has 27.0 percent of original size [2022-11-26 00:07:06,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 227 treesize of output 235 [2022-11-26 00:07:06,370 INFO L321 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2022-11-26 00:07:06,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 230 treesize of output 245 [2022-11-26 00:07:06,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:06,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:06,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:06,765 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:06,945 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-26 00:07:06,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 323 treesize of output 301 [2022-11-26 00:07:06,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:07,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:07,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:07,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:07,037 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:07,047 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-26 00:07:07,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 327 treesize of output 304 [2022-11-26 00:07:07,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:07,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:07,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 316 treesize of output 307 [2022-11-26 00:07:07,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:07,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:07,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 316 treesize of output 307 [2022-11-26 00:07:07,161 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:07,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:07,164 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:07,233 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-26 00:07:07,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 463 treesize of output 481 [2022-11-26 00:07:07,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:07,260 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:07,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 534 treesize of output 569 [2022-11-26 00:07:07,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 104 [2022-11-26 00:07:07,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 68 [2022-11-26 00:07:07,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2022-11-26 00:07:07,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:07,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:07,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:07,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:07,778 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:07,787 INFO L321 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2022-11-26 00:07:07,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 804 treesize of output 751 [2022-11-26 00:07:07,901 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-26 00:07:07,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 899 treesize of output 800 [2022-11-26 00:07:07,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 782 treesize of output 646 [2022-11-26 00:07:07,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 763 treesize of output 733 [2022-11-26 00:07:08,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:07:08,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-26 00:07:08,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:08,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:08,126 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:08,209 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-26 00:07:08,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 184 [2022-11-26 00:07:08,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:08,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:08,252 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:08,253 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:08,287 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-26 00:07:08,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 173 [2022-11-26 00:07:08,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:08,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:08,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-26 00:07:08,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:08,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 11 [2022-11-26 00:07:08,411 INFO L321 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2022-11-26 00:07:08,411 INFO L350 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 2 case distinctions, treesize of input 61 treesize of output 30 [2022-11-26 00:07:08,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:08,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:08,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-11-26 00:07:08,455 INFO L321 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2022-11-26 00:07:08,455 INFO L350 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 2 case distinctions, treesize of input 61 treesize of output 30 [2022-11-26 00:07:08,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:08,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:08,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-11-26 00:07:08,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:07:08,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-26 00:07:08,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:07:08,639 INFO L350 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 [2022-11-26 00:07:08,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:07:08,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:07:08,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:07:08,758 INFO L350 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 [2022-11-26 00:07:08,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:07:08,909 INFO L350 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 [2022-11-26 00:07:08,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:07:08,968 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:07:10,355 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '887#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= 1 |ULTIMATE.start_dll_create_~data#1|) (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_dll_get_data_at_#in~index#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 |ULTIMATE.start_dll_create_#in~len#1|) (<= |ULTIMATE.start_dll_create_#res#1.offset| 0) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_dll_get_data_at_~head#1.base|) |ULTIMATE.start_dll_get_data_at_~head#1.offset|) |ULTIMATE.start_dll_get_data_at_#res#1|) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.base| |ULTIMATE.start_dll_get_data_at_~head#1.base|) (<= 0 (+ |ULTIMATE.start_dll_get_data_at_#res#1| 2147483648)) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.offset| |ULTIMATE.start_dll_get_data_at_~head#1.offset|) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_dll_get_data_at_#res#1| 2147483647) (<= |ULTIMATE.start_dll_create_~data#1| 1) (= |ULTIMATE.start_dll_get_data_at_~index#1| |ULTIMATE.start_dll_get_data_at_#in~index#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_dll_create_#in~len#1| 2) (<= |ULTIMATE.start_dll_create_~len#1| 0) (<= 1 |ULTIMATE.start_dll_create_#in~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= |ULTIMATE.start_dll_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_create_#res#1.offset|) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (not (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_get_data_at_#res#1|)) (= |#NULL.base| 0))' at error location [2022-11-26 00:07:10,355 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:07:10,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:07:10,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 39 [2022-11-26 00:07:10,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307761143] [2022-11-26 00:07:10,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:07:10,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-26 00:07:10,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:07:10,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-26 00:07:10,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1649, Unknown=4, NotChecked=340, Total=2162 [2022-11-26 00:07:10,359 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 39 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 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) [2022-11-26 00:07:12,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:07:12,278 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2022-11-26 00:07:12,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-26 00:07:12,281 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 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 [2022-11-26 00:07:12,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:07:12,283 INFO L225 Difference]: With dead ends: 44 [2022-11-26 00:07:12,285 INFO L226 Difference]: Without dead ends: 42 [2022-11-26 00:07:12,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=453, Invalid=2980, Unknown=5, NotChecked=468, Total=3906 [2022-11-26 00:07:12,289 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 189 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 7 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 146 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-26 00:07:12,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 81 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 400 Invalid, 18 Unknown, 146 Unchecked, 0.7s Time] [2022-11-26 00:07:12,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-26 00:07:12,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 27. [2022-11-26 00:07:12,315 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) [2022-11-26 00:07:12,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2022-11-26 00:07:12,316 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 18 [2022-11-26 00:07:12,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:07:12,316 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2022-11-26 00:07:12,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 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) [2022-11-26 00:07:12,317 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-11-26 00:07:12,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-26 00:07:12,318 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:07:12,318 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:07:12,326 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-26 00:07:12,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-26 00:07:12,519 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:07:12,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:07:12,519 INFO L85 PathProgramCache]: Analyzing trace with hash -280268398, now seen corresponding path program 2 times [2022-11-26 00:07:12,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:07:12,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727881097] [2022-11-26 00:07:12,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:12,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:07:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:12,638 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-26 00:07:12,638 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:07:12,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727881097] [2022-11-26 00:07:12,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727881097] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:07:12,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:07:12,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:07:12,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21510202] [2022-11-26 00:07:12,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:07:12,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:07:12,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:07:12,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:07:12,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:07:12,642 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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) [2022-11-26 00:07:12,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:07:12,727 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-11-26 00:07:12,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:07:12,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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 19 [2022-11-26 00:07:12,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:07:12,729 INFO L225 Difference]: With dead ends: 40 [2022-11-26 00:07:12,729 INFO L226 Difference]: Without dead ends: 30 [2022-11-26 00:07:12,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:07:12,730 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 7 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:07:12,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 18 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:07:12,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-26 00:07:12,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2022-11-26 00:07:12,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 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) [2022-11-26 00:07:12,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-11-26 00:07:12,762 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 19 [2022-11-26 00:07:12,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:07:12,762 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-11-26 00:07:12,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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) [2022-11-26 00:07:12,763 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-11-26 00:07:12,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-26 00:07:12,764 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:07:12,764 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:07:12,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-26 00:07:12,765 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:07:12,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:07:12,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1047799090, now seen corresponding path program 3 times [2022-11-26 00:07:12,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:07:12,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993832773] [2022-11-26 00:07:12,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:12,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:07:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:12,930 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-26 00:07:12,931 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:07:12,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993832773] [2022-11-26 00:07:12,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993832773] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:07:12,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96715649] [2022-11-26 00:07:12,931 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 00:07:12,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:07:12,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:07:12,933 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:07:12,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-26 00:07:13,111 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 00:07:13,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:07:13,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-26 00:07:13,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:07:13,129 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-26 00:07:13,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:07:13,152 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-26 00:07:13,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96715649] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:07:13,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [690833650] [2022-11-26 00:07:13,154 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-26 00:07:13,154 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:07:13,155 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:07:13,155 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:07:13,155 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:07:13,200 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-26 00:07:13,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-26 00:07:13,240 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-26 00:07:13,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-26 00:07:13,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:13,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:13,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2022-11-26 00:07:13,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:13,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:13,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-26 00:07:13,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:13,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:13,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-26 00:07:13,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:13,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:13,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-26 00:07:13,438 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-26 00:07:13,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2022-11-26 00:07:13,474 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-26 00:07:13,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2022-11-26 00:07:13,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:13,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:13,813 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-26 00:07:13,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 235 treesize of output 221 [2022-11-26 00:07:13,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:13,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:13,882 INFO L321 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-11-26 00:07:13,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 239 treesize of output 224 [2022-11-26 00:07:13,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:13,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:13,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 219 [2022-11-26 00:07:13,935 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:13,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:13,937 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:13,938 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:13,939 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:13,998 INFO L321 Elim1Store]: treesize reduction 66, result has 32.0 percent of original size [2022-11-26 00:07:13,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 375 treesize of output 403 [2022-11-26 00:07:14,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:14,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:14,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 240 treesize of output 231 [2022-11-26 00:07:14,060 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:14,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:14,066 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:14,067 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:14,121 INFO L321 Elim1Store]: treesize reduction 74, result has 34.5 percent of original size [2022-11-26 00:07:14,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 362 treesize of output 386 [2022-11-26 00:07:14,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:14,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:14,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 383 treesize of output 330 [2022-11-26 00:07:14,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-26 00:07:14,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:14,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 310 treesize of output 296 [2022-11-26 00:07:14,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 54 [2022-11-26 00:07:14,276 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:14,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 17 [2022-11-26 00:07:14,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-26 00:07:14,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:14,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:14,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:14,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:14,445 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-26 00:07:14,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 346 treesize of output 301 [2022-11-26 00:07:14,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:07:14,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-26 00:07:14,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:14,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:14,705 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:14,706 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:14,739 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-26 00:07:14,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 185 [2022-11-26 00:07:14,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:14,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:14,768 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:14,799 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-26 00:07:14,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 159 [2022-11-26 00:07:14,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:14,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:14,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-26 00:07:14,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:14,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 11 [2022-11-26 00:07:14,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 67 [2022-11-26 00:07:14,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:14,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:14,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 45 [2022-11-26 00:07:14,953 INFO L350 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 13 treesize of output 3 [2022-11-26 00:07:15,034 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-26 00:07:15,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 169 treesize of output 144 [2022-11-26 00:07:15,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:15,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:15,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 92 [2022-11-26 00:07:15,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-26 00:07:15,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:07:15,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:07:15,156 INFO L350 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 [2022-11-26 00:07:15,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:07:15,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:07:15,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:07:15,297 INFO L350 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 [2022-11-26 00:07:15,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:07:15,386 INFO L350 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 [2022-11-26 00:07:15,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:07:15,441 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:07:16,284 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1277#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= 1 |ULTIMATE.start_dll_create_~data#1|) (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_dll_get_data_at_#in~index#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 |ULTIMATE.start_dll_create_#in~len#1|) (<= |ULTIMATE.start_dll_create_#res#1.offset| 0) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_dll_get_data_at_~head#1.base|) |ULTIMATE.start_dll_get_data_at_~head#1.offset|) |ULTIMATE.start_dll_get_data_at_#res#1|) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.base| |ULTIMATE.start_dll_get_data_at_~head#1.base|) (<= 0 (+ |ULTIMATE.start_dll_get_data_at_#res#1| 2147483648)) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.offset| |ULTIMATE.start_dll_get_data_at_~head#1.offset|) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_dll_get_data_at_#res#1| 2147483647) (<= |ULTIMATE.start_dll_create_~data#1| 1) (= |ULTIMATE.start_dll_get_data_at_~index#1| |ULTIMATE.start_dll_get_data_at_#in~index#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_dll_create_#in~len#1| 2) (<= |ULTIMATE.start_dll_create_~len#1| 0) (<= 1 |ULTIMATE.start_dll_create_#in~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= |ULTIMATE.start_dll_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_create_#res#1.offset|) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (not (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_get_data_at_#res#1|)) (= |#NULL.base| 0))' at error location [2022-11-26 00:07:16,284 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:07:16,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:07:16,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2022-11-26 00:07:16,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427789793] [2022-11-26 00:07:16,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:07:16,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-26 00:07:16,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:07:16,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-26 00:07:16,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2022-11-26 00:07:16,286 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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) [2022-11-26 00:07:16,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:07:16,409 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2022-11-26 00:07:16,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-26 00:07:16,410 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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 19 [2022-11-26 00:07:16,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:07:16,416 INFO L225 Difference]: With dead ends: 43 [2022-11-26 00:07:16,416 INFO L226 Difference]: Without dead ends: 35 [2022-11-26 00:07:16,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2022-11-26 00:07:16,418 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 59 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:07:16,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 18 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:07:16,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-26 00:07:16,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2022-11-26 00:07:16,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 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) [2022-11-26 00:07:16,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2022-11-26 00:07:16,433 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 19 [2022-11-26 00:07:16,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:07:16,433 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-11-26 00:07:16,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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) [2022-11-26 00:07:16,434 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-11-26 00:07:16,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-26 00:07:16,434 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:07:16,434 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:07:16,440 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-26 00:07:16,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:07:16,639 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:07:16,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:07:16,639 INFO L85 PathProgramCache]: Analyzing trace with hash 428634211, now seen corresponding path program 1 times [2022-11-26 00:07:16,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:07:16,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717178565] [2022-11-26 00:07:16,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:16,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:07:16,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:16,723 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-26 00:07:16,724 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:07:16,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717178565] [2022-11-26 00:07:16,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717178565] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:07:16,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:07:16,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:07:16,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744175630] [2022-11-26 00:07:16,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:07:16,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:07:16,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:07:16,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:07:16,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:07:16,726 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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) [2022-11-26 00:07:16,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:07:16,791 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-11-26 00:07:16,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:07:16,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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 19 [2022-11-26 00:07:16,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:07:16,792 INFO L225 Difference]: With dead ends: 36 [2022-11-26 00:07:16,792 INFO L226 Difference]: Without dead ends: 31 [2022-11-26 00:07:16,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:07:16,794 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 9 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:07:16,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 20 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:07:16,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-26 00:07:16,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2022-11-26 00:07:16,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 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) [2022-11-26 00:07:16,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2022-11-26 00:07:16,808 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 19 [2022-11-26 00:07:16,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:07:16,808 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2022-11-26 00:07:16,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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) [2022-11-26 00:07:16,809 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-11-26 00:07:16,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-26 00:07:16,809 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:07:16,809 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:07:16,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-26 00:07:16,810 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:07:16,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:07:16,810 INFO L85 PathProgramCache]: Analyzing trace with hash 993692610, now seen corresponding path program 1 times [2022-11-26 00:07:16,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:07:16,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410798826] [2022-11-26 00:07:16,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:16,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:07:16,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:16,894 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-26 00:07:16,895 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:07:16,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410798826] [2022-11-26 00:07:16,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410798826] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:07:16,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175396880] [2022-11-26 00:07:16,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:16,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:07:16,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:07:16,897 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:07:16,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-26 00:07:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:17,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-26 00:07:17,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:07:17,112 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-26 00:07:17,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:07:17,138 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-26 00:07:17,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175396880] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:07:17,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [458383810] [2022-11-26 00:07:17,143 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-26 00:07:17,144 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:07:17,144 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:07:17,144 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:07:17,144 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:07:17,185 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-26 00:07:17,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-26 00:07:17,227 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-26 00:07:17,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-26 00:07:17,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:17,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:17,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-26 00:07:17,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:17,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:17,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-26 00:07:17,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:17,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:17,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2022-11-26 00:07:17,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:17,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:17,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-26 00:07:17,449 INFO L321 Elim1Store]: treesize reduction 54, result has 27.0 percent of original size [2022-11-26 00:07:17,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 227 treesize of output 235 [2022-11-26 00:07:17,524 INFO L321 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2022-11-26 00:07:17,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 230 treesize of output 245 [2022-11-26 00:07:17,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:17,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:17,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:18,003 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-26 00:07:18,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 235 treesize of output 221 [2022-11-26 00:07:18,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:18,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:18,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:18,082 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-26 00:07:18,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 239 treesize of output 224 [2022-11-26 00:07:18,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:18,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:18,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 219 [2022-11-26 00:07:18,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:18,143 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:18,143 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:18,144 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:18,221 INFO L321 Elim1Store]: treesize reduction 66, result has 32.0 percent of original size [2022-11-26 00:07:18,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 375 treesize of output 398 [2022-11-26 00:07:18,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:18,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 306 treesize of output 297 [2022-11-26 00:07:18,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:18,282 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:18,282 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:18,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 440 treesize of output 475 [2022-11-26 00:07:18,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:18,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:18,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:18,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:18,365 INFO L321 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2022-11-26 00:07:18,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 367 treesize of output 322 [2022-11-26 00:07:18,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 65 [2022-11-26 00:07:18,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:18,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-26 00:07:18,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-11-26 00:07:18,783 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-26 00:07:18,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 657 treesize of output 572 [2022-11-26 00:07:18,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 554 treesize of output 430 [2022-11-26 00:07:18,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 516 treesize of output 512 [2022-11-26 00:07:18,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:07:18,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-26 00:07:18,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:18,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:18,963 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:18,965 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:19,006 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-26 00:07:19,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 180 [2022-11-26 00:07:19,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:19,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:19,047 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:19,086 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-26 00:07:19,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 164 [2022-11-26 00:07:19,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:19,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:19,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-26 00:07:19,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:19,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 11 [2022-11-26 00:07:19,230 INFO L321 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2022-11-26 00:07:19,231 INFO L350 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 2 case distinctions, treesize of input 142 treesize of output 101 [2022-11-26 00:07:19,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:19,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:19,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 71 [2022-11-26 00:07:19,270 INFO L321 Elim1Store]: treesize reduction 35, result has 2.8 percent of original size [2022-11-26 00:07:19,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 194 treesize of output 145 [2022-11-26 00:07:19,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:19,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:19,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 91 [2022-11-26 00:07:19,299 INFO L350 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 13 treesize of output 3 [2022-11-26 00:07:19,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-26 00:07:19,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:07:19,386 INFO L350 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 [2022-11-26 00:07:19,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:07:19,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:07:19,491 INFO L350 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 [2022-11-26 00:07:19,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:07:19,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:07:19,601 INFO L350 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 [2022-11-26 00:07:19,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:07:19,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:07:19,759 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:07:21,205 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1643#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= 1 |ULTIMATE.start_dll_create_~data#1|) (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_dll_get_data_at_#in~index#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 |ULTIMATE.start_dll_create_#in~len#1|) (<= |ULTIMATE.start_dll_create_#res#1.offset| 0) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_dll_get_data_at_~head#1.base|) |ULTIMATE.start_dll_get_data_at_~head#1.offset|) |ULTIMATE.start_dll_get_data_at_#res#1|) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.base| |ULTIMATE.start_dll_get_data_at_~head#1.base|) (<= 0 (+ |ULTIMATE.start_dll_get_data_at_#res#1| 2147483648)) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.offset| |ULTIMATE.start_dll_get_data_at_~head#1.offset|) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_dll_get_data_at_#res#1| 2147483647) (<= |ULTIMATE.start_dll_create_~data#1| 1) (= |ULTIMATE.start_dll_get_data_at_~index#1| |ULTIMATE.start_dll_get_data_at_#in~index#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_dll_create_#in~len#1| 2) (<= |ULTIMATE.start_dll_create_~len#1| 0) (<= 1 |ULTIMATE.start_dll_create_#in~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= |ULTIMATE.start_dll_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_create_#res#1.offset|) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (not (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_get_data_at_#res#1|)) (= |#NULL.base| 0))' at error location [2022-11-26 00:07:21,206 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:07:21,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:07:21,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-11-26 00:07:21,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329668965] [2022-11-26 00:07:21,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:07:21,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 00:07:21,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:07:21,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 00:07:21,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-11-26 00:07:21,208 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) 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) [2022-11-26 00:07:21,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:07:21,303 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-11-26 00:07:21,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:07:21,307 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) 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 21 [2022-11-26 00:07:21,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:07:21,308 INFO L225 Difference]: With dead ends: 36 [2022-11-26 00:07:21,308 INFO L226 Difference]: Without dead ends: 31 [2022-11-26 00:07:21,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-11-26 00:07:21,309 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 20 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:07:21,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 21 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:07:21,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-26 00:07:21,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-11-26 00:07:21,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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) [2022-11-26 00:07:21,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-11-26 00:07:21,330 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 21 [2022-11-26 00:07:21,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:07:21,332 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-11-26 00:07:21,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) 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) [2022-11-26 00:07:21,333 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-11-26 00:07:21,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-26 00:07:21,334 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:07:21,334 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:07:21,342 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-26 00:07:21,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:07:21,541 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:07:21,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:07:21,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1880581264, now seen corresponding path program 4 times [2022-11-26 00:07:21,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:07:21,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189348198] [2022-11-26 00:07:21,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:21,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:07:21,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:21,703 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-26 00:07:21,704 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:07:21,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189348198] [2022-11-26 00:07:21,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189348198] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:07:21,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137813676] [2022-11-26 00:07:21,704 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-26 00:07:21,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:07:21,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:07:21,706 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:07:21,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-26 00:07:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:21,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-26 00:07:21,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:07:21,962 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-26 00:07:21,962 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:07:21,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137813676] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:07:21,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 00:07:21,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2022-11-26 00:07:21,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072210634] [2022-11-26 00:07:21,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:07:21,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 00:07:21,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:07:21,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 00:07:21,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-26 00:07:21,965 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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) [2022-11-26 00:07:22,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:07:22,021 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-11-26 00:07:22,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 00:07:22,021 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 [2022-11-26 00:07:22,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:07:22,022 INFO L225 Difference]: With dead ends: 35 [2022-11-26 00:07:22,022 INFO L226 Difference]: Without dead ends: 23 [2022-11-26 00:07:22,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-26 00:07:22,023 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 10 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:07:22,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 12 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:07:22,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-26 00:07:22,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-26 00:07:22,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 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) [2022-11-26 00:07:22,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-11-26 00:07:22,033 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 21 [2022-11-26 00:07:22,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:07:22,033 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-11-26 00:07:22,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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) [2022-11-26 00:07:22,033 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-11-26 00:07:22,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-26 00:07:22,034 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:07:22,034 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:07:22,043 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-26 00:07:22,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-26 00:07:22,239 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:07:22,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:07:22,239 INFO L85 PathProgramCache]: Analyzing trace with hash 738277921, now seen corresponding path program 1 times [2022-11-26 00:07:22,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:07:22,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012451968] [2022-11-26 00:07:22,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:22,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:07:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:23,723 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:07:23,723 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:07:23,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012451968] [2022-11-26 00:07:23,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012451968] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:07:23,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106548873] [2022-11-26 00:07:23,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:23,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:07:23,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:07:23,724 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:07:23,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-26 00:07:23,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:23,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 97 conjunts are in the unsatisfiable core [2022-11-26 00:07:23,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:07:23,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:07:24,046 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-26 00:07:24,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-26 00:07:24,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-11-26 00:07:24,115 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:07:24,116 INFO L350 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 34 treesize of output 33 [2022-11-26 00:07:24,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:24,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:24,305 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:07:24,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2022-11-26 00:07:24,531 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:07:24,532 INFO L350 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 79 treesize of output 72 [2022-11-26 00:07:24,541 INFO L350 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 31 treesize of output 21 [2022-11-26 00:07:24,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:24,546 INFO L350 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 34 treesize of output 36 [2022-11-26 00:07:24,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 37 [2022-11-26 00:07:24,880 INFO L350 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 30 treesize of output 18 [2022-11-26 00:07:24,932 INFO L350 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 22 treesize of output 10 [2022-11-26 00:07:24,970 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:07:24,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:07:25,262 INFO L350 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 86 treesize of output 64 [2022-11-26 00:07:25,287 INFO L350 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 86 treesize of output 64 [2022-11-26 00:07:25,306 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~len~0#1| 1)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (<= |c_ULTIMATE.start_dll_update_at_~data#1| .cse0) (<= .cse0 |c_ULTIMATE.start_dll_update_at_~data#1|) (forall ((v_ArrVal_1500 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1500) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) (forall ((v_ArrVal_1501 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1501) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) |c_ULTIMATE.start_dll_update_at_~head#1.base|)))) is different from false [2022-11-26 00:07:25,326 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:07:25,327 INFO L350 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 50 treesize of output 43 [2022-11-26 00:07:25,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-11-26 00:07:25,806 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:07:25,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 89 [2022-11-26 00:07:25,845 INFO L321 Elim1Store]: treesize reduction 10, result has 70.6 percent of original size [2022-11-26 00:07:25,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 91 [2022-11-26 00:07:25,871 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:07:25,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 68 [2022-11-26 00:07:25,904 INFO L321 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2022-11-26 00:07:25,905 INFO L350 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 2 case distinctions, treesize of input 10 treesize of output 11 [2022-11-26 00:07:25,921 INFO L350 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 13 treesize of output 11 [2022-11-26 00:07:25,924 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:25,926 INFO L350 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 8 treesize of output 4 [2022-11-26 00:07:25,931 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:07:25,931 INFO L350 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 17 treesize of output 9 [2022-11-26 00:07:26,122 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-26 00:07:26,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106548873] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:07:26,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [167811669] [2022-11-26 00:07:26,123 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-26 00:07:26,124 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:07:26,124 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:07:26,124 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:07:26,124 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:07:26,168 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-26 00:07:26,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-26 00:07:26,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-26 00:07:26,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:26,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:26,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-26 00:07:26,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:26,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:26,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-26 00:07:26,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:26,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:26,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2022-11-26 00:07:26,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:26,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:26,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-26 00:07:26,387 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-26 00:07:26,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2022-11-26 00:07:26,420 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-26 00:07:26,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2022-11-26 00:07:26,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:26,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:26,658 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:26,747 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-26 00:07:26,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 243 treesize of output 229 [2022-11-26 00:07:26,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:26,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:26,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:26,830 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:26,838 INFO L321 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-11-26 00:07:26,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 247 treesize of output 232 [2022-11-26 00:07:26,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:26,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:26,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 227 [2022-11-26 00:07:26,917 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:26,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:26,919 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:27,022 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-26 00:07:27,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 383 treesize of output 406 [2022-11-26 00:07:27,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:27,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 314 treesize of output 305 [2022-11-26 00:07:27,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:27,082 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:27,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 448 treesize of output 478 [2022-11-26 00:07:27,203 INFO L321 Elim1Store]: treesize reduction 35, result has 2.8 percent of original size [2022-11-26 00:07:27,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 220 treesize of output 165 [2022-11-26 00:07:27,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 113 [2022-11-26 00:07:27,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 19 [2022-11-26 00:07:27,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:27,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:27,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:27,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:27,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:27,302 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:27,309 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-26 00:07:27,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 397 treesize of output 352 [2022-11-26 00:07:27,503 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-26 00:07:27,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 725 treesize of output 644 [2022-11-26 00:07:27,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 644 treesize of output 564 [2022-11-26 00:07:27,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 579 treesize of output 559 [2022-11-26 00:07:27,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:07:27,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-26 00:07:27,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:27,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:27,667 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:27,729 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-26 00:07:27,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 184 [2022-11-26 00:07:27,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:27,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:27,760 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:27,760 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:27,794 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-26 00:07:27,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 178 [2022-11-26 00:07:27,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:27,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-26 00:07:27,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:27,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-26 00:07:27,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:27,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 11 [2022-11-26 00:07:27,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 67 [2022-11-26 00:07:27,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:27,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:27,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 45 [2022-11-26 00:07:27,923 INFO L350 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 13 treesize of output 3 [2022-11-26 00:07:28,002 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-26 00:07:28,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 169 treesize of output 144 [2022-11-26 00:07:28,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:28,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:28,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 92 [2022-11-26 00:07:28,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-26 00:07:28,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:07:28,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:07:28,105 INFO L350 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 [2022-11-26 00:07:28,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:07:28,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:07:28,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:07:28,194 INFO L350 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 [2022-11-26 00:07:28,273 INFO L350 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 [2022-11-26 00:07:28,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:07:28,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:07:28,775 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:07:30,300 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2101#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_dll_get_data_at_#in~head#1.offset| 0) (<= 1 |ULTIMATE.start_dll_create_~data#1|) (<= 2 |ULTIMATE.start_dll_create_#in~len#1|) (<= |ULTIMATE.start_dll_create_#res#1.offset| 0) (<= 0 (+ |ULTIMATE.start_dll_get_data_at_#res#1| 2147483648)) (<= |ULTIMATE.start_dll_get_data_at_~index#1| 0) (<= |ULTIMATE.start_dll_get_data_at_#res#1| 2147483647) (<= |ULTIMATE.start_dll_create_~data#1| 1) (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |ULTIMATE.start_dll_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_dll_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_dll_get_data_at_#in~index#1|) (<= |ULTIMATE.start_dll_create_~len#1| 0) (<= 1 |ULTIMATE.start_dll_create_#in~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= |ULTIMATE.start_dll_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|) (<= 2 |ULTIMATE.start_main_~expected~0#1|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_create_#res#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-26 00:07:30,300 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:07:30,300 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:07:30,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 46 [2022-11-26 00:07:30,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072319372] [2022-11-26 00:07:30,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:07:30,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-26 00:07:30,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:07:30,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-26 00:07:30,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2561, Unknown=1, NotChecked=102, Total=2862 [2022-11-26 00:07:30,304 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 46 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 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) [2022-11-26 00:07:31,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:07:31,875 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-11-26 00:07:31,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-26 00:07:31,876 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 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 22 [2022-11-26 00:07:31,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:07:31,876 INFO L225 Difference]: With dead ends: 29 [2022-11-26 00:07:31,876 INFO L226 Difference]: Without dead ends: 26 [2022-11-26 00:07:31,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 977 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=409, Invalid=3884, Unknown=1, NotChecked=128, Total=4422 [2022-11-26 00:07:31,879 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 53 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-26 00:07:31,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 54 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 441 Invalid, 1 Unknown, 25 Unchecked, 0.7s Time] [2022-11-26 00:07:31,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-26 00:07:31,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2022-11-26 00:07:31,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 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) [2022-11-26 00:07:31,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-11-26 00:07:31,894 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2022-11-26 00:07:31,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:07:31,894 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-11-26 00:07:31,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 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) [2022-11-26 00:07:31,894 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-11-26 00:07:31,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-26 00:07:31,895 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:07:31,895 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:07:31,900 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-26 00:07:32,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-26 00:07:32,099 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:07:32,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:07:32,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1410357154, now seen corresponding path program 2 times [2022-11-26 00:07:32,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:07:32,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117931065] [2022-11-26 00:07:32,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:32,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:07:32,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:32,208 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-26 00:07:32,208 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:07:32,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117931065] [2022-11-26 00:07:32,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117931065] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:07:32,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37837327] [2022-11-26 00:07:32,209 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:07:32,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:07:32,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:07:32,211 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:07:32,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-26 00:07:32,426 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-26 00:07:32,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:07:32,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-26 00:07:32,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:07:32,460 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-26 00:07:32,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:07:32,500 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-26 00:07:32,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37837327] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:07:32,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1299795993] [2022-11-26 00:07:32,503 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-26 00:07:32,503 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:07:32,503 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:07:32,504 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:07:32,504 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:07:32,540 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-26 00:07:32,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-26 00:07:32,576 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-26 00:07:32,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-26 00:07:32,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:32,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:32,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-26 00:07:32,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:32,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:32,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-26 00:07:32,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:32,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:32,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2022-11-26 00:07:32,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:32,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:32,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-26 00:07:32,776 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-26 00:07:32,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2022-11-26 00:07:32,811 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-26 00:07:32,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2022-11-26 00:07:33,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:33,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:33,076 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:33,168 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-26 00:07:33,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 243 treesize of output 229 [2022-11-26 00:07:33,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:33,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:33,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:33,235 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:33,242 INFO L321 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-11-26 00:07:33,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 247 treesize of output 232 [2022-11-26 00:07:33,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:33,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:33,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 227 [2022-11-26 00:07:33,303 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:33,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:33,305 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:33,394 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-26 00:07:33,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 383 treesize of output 401 [2022-11-26 00:07:33,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:33,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 314 treesize of output 305 [2022-11-26 00:07:33,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:33,483 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:33,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 448 treesize of output 483 [2022-11-26 00:07:33,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:33,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:33,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:33,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:33,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:33,558 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:33,566 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-26 00:07:33,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 397 treesize of output 352 [2022-11-26 00:07:33,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 65 [2022-11-26 00:07:33,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-26 00:07:33,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2022-11-26 00:07:33,738 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-26 00:07:33,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 561 treesize of output 488 [2022-11-26 00:07:33,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 470 treesize of output 386 [2022-11-26 00:07:33,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 356 treesize of output 326 [2022-11-26 00:07:33,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-26 00:07:33,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:07:33,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:33,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:33,991 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:34,075 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-26 00:07:34,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 184 [2022-11-26 00:07:34,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:34,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:34,109 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:34,110 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:34,139 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-26 00:07:34,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 173 [2022-11-26 00:07:34,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:34,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:34,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-26 00:07:34,228 INFO L321 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2022-11-26 00:07:34,229 INFO L350 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 2 case distinctions, treesize of input 61 treesize of output 30 [2022-11-26 00:07:34,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:34,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:34,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-11-26 00:07:34,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:34,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 11 [2022-11-26 00:07:34,299 INFO L321 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2022-11-26 00:07:34,299 INFO L350 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 2 case distinctions, treesize of input 142 treesize of output 101 [2022-11-26 00:07:34,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:34,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:34,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 71 [2022-11-26 00:07:34,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:07:34,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-26 00:07:34,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:07:34,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:07:34,474 INFO L350 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 [2022-11-26 00:07:34,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:07:34,545 INFO L350 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 [2022-11-26 00:07:34,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:07:34,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:07:34,681 INFO L350 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 [2022-11-26 00:07:34,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:07:35,118 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:07:36,098 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2360#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_dll_get_data_at_#in~head#1.offset| 0) (<= 1 |ULTIMATE.start_dll_create_~data#1|) (<= 2 |ULTIMATE.start_dll_create_#in~len#1|) (<= |ULTIMATE.start_dll_create_#res#1.offset| 0) (<= 0 (+ |ULTIMATE.start_dll_get_data_at_#res#1| 2147483648)) (<= |ULTIMATE.start_dll_get_data_at_~index#1| 0) (<= |ULTIMATE.start_dll_get_data_at_#res#1| 2147483647) (<= |ULTIMATE.start_dll_create_~data#1| 1) (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |ULTIMATE.start_dll_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_dll_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_dll_get_data_at_#in~index#1|) (<= |ULTIMATE.start_dll_create_~len#1| 0) (<= 1 |ULTIMATE.start_dll_create_#in~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= |ULTIMATE.start_dll_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|) (<= 2 |ULTIMATE.start_main_~expected~0#1|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_create_#res#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-26 00:07:36,098 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:07:36,098 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:07:36,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 7 [2022-11-26 00:07:36,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305480106] [2022-11-26 00:07:36,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:07:36,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-26 00:07:36,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:07:36,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-26 00:07:36,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-11-26 00:07:36,100 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 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) [2022-11-26 00:07:36,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:07:36,191 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-11-26 00:07:36,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-26 00:07:36,192 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 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 23 [2022-11-26 00:07:36,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:07:36,192 INFO L225 Difference]: With dead ends: 24 [2022-11-26 00:07:36,192 INFO L226 Difference]: Without dead ends: 0 [2022-11-26 00:07:36,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2022-11-26 00:07:36,193 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 11 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:07:36,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 9 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:07:36,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-26 00:07:36,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-26 00:07:36,195 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) [2022-11-26 00:07:36,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-26 00:07:36,195 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2022-11-26 00:07:36,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:07:36,195 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-26 00:07:36,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 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) [2022-11-26 00:07:36,196 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-26 00:07:36,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-26 00:07:36,198 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-26 00:07:36,206 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-26 00:07:36,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:07:36,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-26 00:07:41,101 INFO L902 garLoopResultBuilder]: At program point myexitENTRY(lines 572 574) the Hoare annotation is: true [2022-11-26 00:07:41,101 INFO L902 garLoopResultBuilder]: At program point L573(line 573) the Hoare annotation is: true [2022-11-26 00:07:41,101 INFO L899 garLoopResultBuilder]: For program point myexitEXIT(lines 572 574) no Hoare annotation was computed. [2022-11-26 00:07:41,101 INFO L899 garLoopResultBuilder]: For program point L589(lines 589 591) no Hoare annotation was computed. [2022-11-26 00:07:41,101 INFO L899 garLoopResultBuilder]: For program point L589-1(lines 589 591) no Hoare annotation was computed. [2022-11-26 00:07:41,101 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-26 00:07:41,101 INFO L902 garLoopResultBuilder]: At program point L590(line 590) the Hoare annotation is: true [2022-11-26 00:07:41,102 INFO L895 garLoopResultBuilder]: At program point L633-3(lines 633 638) the Hoare annotation is: (let ((.cse27 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse29 (select .cse27 4))) (let ((.cse0 (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)) (.cse1 (<= 1 |ULTIMATE.start_dll_create_~data#1|)) (.cse2 (not (= 0 .cse29))) (.cse3 (<= 2 |ULTIMATE.start_dll_create_#in~len#1|)) (.cse4 (not (= |ULTIMATE.start_main_~s~0#1.base| .cse29))) (.cse5 (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))) (.cse6 (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)) (.cse7 (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)) (.cse8 (<= |ULTIMATE.start_dll_create_~len#1| 2)) (.cse9 (<= |#NULL.offset| 0)) (.cse10 (<= |ULTIMATE.start_dll_create_~data#1| 1)) (.cse11 (<= |ULTIMATE.start_dll_update_at_~index#1| 0)) (.cse12 (<= 0 |ULTIMATE.start_main_~i~0#1|)) (.cse13 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse14 (<= |ULTIMATE.start_dll_create_#in~len#1| 2)) (.cse15 (<= 1 |ULTIMATE.start_dll_create_#in~data#1|)) (.cse16 (= (select .cse27 8) 0)) (.cse17 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse18 (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))) (.cse19 (<= |ULTIMATE.start_dll_create_#in~data#1| 1)) (.cse20 (<= |ULTIMATE.start_dll_create_~head~0#1.offset| 0)) (.cse21 (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|)) (.cse22 (<= 0 |#NULL.offset|)) (.cse23 (<= 0 |#StackHeapBarrier|)) (.cse24 (= (let ((.cse28 (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select |#memory_int| (select .cse27 .cse28)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) .cse28))) (+ |ULTIMATE.start_main_~len~0#1| 1))) (.cse25 (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse26 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~i~0#1| 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~len~0#1|) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_main_~i~0#1| 1) .cse9 (<= |ULTIMATE.start_dll_get_data_at_~index#1| 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26))))) [2022-11-26 00:07:41,102 INFO L902 garLoopResultBuilder]: At program point L642(lines 624 643) the Hoare annotation is: true [2022-11-26 00:07:41,102 INFO L895 garLoopResultBuilder]: At program point L618-2(lines 618 621) the Hoare annotation is: (let ((.cse34 (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse35 (select .cse34 4)) (.cse14 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)) (.cse1 (<= 1 |ULTIMATE.start_dll_create_~data#1|)) (.cse29 (not (= 0 (select .cse14 4)))) (.cse2 (<= 2 |ULTIMATE.start_dll_create_#in~len#1|)) (.cse3 (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))) (.cse4 (not (= |ULTIMATE.start_dll_create_~head~0#1.base| .cse35))) (.cse30 (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_update_at_~head#1.base|)) (.cse5 (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)) (.cse8 (+ |ULTIMATE.start_main_~len~0#1| 1)) (.cse6 (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)) (.cse7 (<= |ULTIMATE.start_dll_create_~len#1| 2)) (.cse9 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse10 (<= |#NULL.offset| 0)) (.cse11 (<= |ULTIMATE.start_dll_create_~data#1| 1)) (.cse12 (not (= .cse35 0))) (.cse13 (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~len~0#1|)) (.cse31 (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|)) (.cse16 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse17 (<= |ULTIMATE.start_dll_create_#in~len#1| 2)) (.cse18 (<= 1 |ULTIMATE.start_dll_create_#in~data#1|)) (.cse19 (= (select .cse14 8) 0)) (.cse20 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse21 (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))) (.cse22 (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0)) (.cse23 (<= |ULTIMATE.start_dll_create_#in~data#1| 1)) (.cse24 (= (select .cse34 8) 0)) (.cse25 (<= 0 |#NULL.offset|)) (.cse33 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_update_at_~head#1.offset|)) (.cse26 (<= 0 |#StackHeapBarrier|)) (.cse27 (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse28 (= |#NULL.base| 0))) (or (let ((.cse15 (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= |ULTIMATE.start_dll_update_at_~data#1| .cse8) .cse9 .cse10 .cse11 .cse12 .cse13 (<= |ULTIMATE.start_dll_update_at_~index#1| 0) (<= .cse8 |ULTIMATE.start_dll_update_at_~data#1|) (= (select .cse14 .cse15) |ULTIMATE.start_dll_update_at_~head#1.base|) .cse16 (forall ((v_ArrVal_1500 (Array Int Int))) (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1500) |ULTIMATE.start_main_~s~0#1.base|) .cse15) |ULTIMATE.start_dll_update_at_~head#1.offset|)) (not (= |ULTIMATE.start_dll_update_at_~head#1.base| 0)) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28)) (let ((.cse32 (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|))) (and .cse0 .cse1 .cse29 (= |ULTIMATE.start_main_~i~0#1| 0) .cse2 .cse3 .cse4 .cse30 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 (not (= (select .cse31 4) |ULTIMATE.start_dll_update_at_~head#1.base|)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (<= |ULTIMATE.start_dll_update_at_~data#1| .cse32) .cse24 .cse25 .cse33 .cse26 (<= .cse32 |ULTIMATE.start_dll_update_at_~data#1|) (= |ULTIMATE.start_dll_update_at_~index#1| 0) .cse27 .cse28)) (and .cse0 .cse1 (<= 1 |ULTIMATE.start_dll_update_at_~index#1|) .cse29 .cse2 .cse3 .cse4 .cse30 .cse5 (= .cse8 |ULTIMATE.start_dll_update_at_~data#1|) .cse6 (<= |ULTIMATE.start_dll_update_at_~index#1| 1) .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 (forall ((v_ArrVal_650 (Array Int Int))) (<= |ULTIMATE.start_main_~len~0#1| (select (select (store |#memory_int| (select .cse31 (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_650) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse33 .cse26 .cse27 .cse28))))) [2022-11-26 00:07:41,102 INFO L899 garLoopResultBuilder]: For program point L635(lines 635 637) no Hoare annotation was computed. [2022-11-26 00:07:41,102 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 641) no Hoare annotation was computed. [2022-11-26 00:07:41,103 INFO L895 garLoopResultBuilder]: At program point L611-2(lines 611 614) the Hoare annotation is: (let ((.cse36 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse38 (select .cse36 4)) (.cse16 (select (select |#memory_int| |ULTIMATE.start_dll_get_data_at_~head#1.base|) |ULTIMATE.start_dll_get_data_at_~head#1.offset|))) (let ((.cse11 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse0 (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)) (.cse1 (<= 1 |ULTIMATE.start_dll_create_~data#1|)) (.cse2 (= .cse16 |ULTIMATE.start_main_~expected~0#1|)) (.cse3 (not (= 0 .cse38))) (.cse4 (<= 2 |ULTIMATE.start_dll_create_#in~len#1|)) (.cse5 (not (= |ULTIMATE.start_main_~s~0#1.base| .cse38))) (.cse6 (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))) (.cse7 (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)) (.cse8 (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)) (.cse9 (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|)) (.cse34 (= |ULTIMATE.start_dll_get_data_at_~head#1.offset| 0)) (.cse10 (<= |ULTIMATE.start_dll_create_~len#1| 2)) (.cse12 (<= |#NULL.offset| 0)) (.cse13 (<= |ULTIMATE.start_dll_create_~data#1| 1)) (.cse14 (<= |ULTIMATE.start_dll_update_at_~index#1| 0)) (.cse15 (<= 0 |ULTIMATE.start_main_~i~0#1|)) (.cse17 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse18 (<= |ULTIMATE.start_dll_create_#in~len#1| 2)) (.cse19 (<= 1 |ULTIMATE.start_dll_create_#in~data#1|)) (.cse20 (= (select .cse36 8) 0)) (.cse21 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse22 (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))) (.cse23 (<= |ULTIMATE.start_dll_create_#in~data#1| 1)) (.cse24 (<= |ULTIMATE.start_dll_create_~head~0#1.offset| 0)) (.cse25 (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|)) (.cse26 (<= 0 |#NULL.offset|)) (.cse27 (<= 0 |#StackHeapBarrier|)) (.cse28 (= (let ((.cse37 (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select |#memory_int| (select .cse36 .cse37)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) .cse37))) (+ |ULTIMATE.start_main_~len~0#1| 1))) (.cse29 (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse30 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= |ULTIMATE.start_dll_get_data_at_~index#1| 0) .cse13 .cse14 .cse15 (= 3 .cse16) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 (not (= |ULTIMATE.start_dll_get_data_at_~head#1.base| 0)) .cse28 .cse29 .cse30) (let ((.cse33 (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_get_data_at_~head#1.base|))) (let ((.cse31 (let ((.cse35 (+ |ULTIMATE.start_dll_get_data_at_~head#1.offset| 4))) (select (select |#memory_int| (select .cse33 .cse35)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_get_data_at_~head#1.base|) .cse35)))) (.cse32 (select .cse33 4))) (and .cse0 (<= 1 |ULTIMATE.start_dll_get_data_at_~index#1|) .cse1 .cse3 .cse4 (= .cse31 |ULTIMATE.start_main_~expected~0#1|) .cse5 .cse6 (= .cse31 3) .cse7 (not (= |ULTIMATE.start_dll_get_data_at_~head#1.base| .cse32)) .cse8 (= (select .cse33 8) 0) .cse9 .cse34 .cse10 .cse11 .cse12 .cse13 (<= |ULTIMATE.start_dll_get_data_at_~index#1| 1) .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (not (= 0 .cse32)) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30))) (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_main_~i~0#1| 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse34 .cse10 .cse12 .cse13 (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~len~0#1|) .cse14 .cse15 .cse17 .cse18 (= 2 .cse16) (= |ULTIMATE.start_dll_get_data_at_~index#1| 0) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30))))) [2022-11-26 00:07:41,103 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-26 00:07:41,103 INFO L895 garLoopResultBuilder]: At program point L636(lines 624 643) the Hoare annotation is: false [2022-11-26 00:07:41,103 INFO L895 garLoopResultBuilder]: At program point L587-2(lines 587 600) the Hoare annotation is: (let ((.cse9 (<= |ULTIMATE.start_dll_create_~head~0#1.offset| 0)) (.cse10 (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|)) (.cse14 (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)) (.cse0 (<= 1 |ULTIMATE.start_dll_create_~data#1|)) (.cse1 (<= 2 |ULTIMATE.start_dll_create_#in~len#1|)) (.cse15 (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))) (.cse16 (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)) (.cse17 (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)) (.cse18 (<= |ULTIMATE.start_dll_create_~len#1| 2)) (.cse2 (<= |#NULL.offset| 0)) (.cse3 (<= |ULTIMATE.start_dll_create_~data#1| 1)) (.cse4 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse5 (<= |ULTIMATE.start_dll_create_#in~len#1| 2)) (.cse6 (<= 1 |ULTIMATE.start_dll_create_#in~data#1|)) (.cse7 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse19 (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))) (.cse8 (<= |ULTIMATE.start_dll_create_#in~data#1| 1)) (.cse11 (<= 0 |#NULL.offset|)) (.cse12 (<= 0 |#StackHeapBarrier|)) (.cse13 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_dll_create_~len#1|) .cse13) (and .cse14 .cse0 .cse1 .cse15 .cse16 .cse17 .cse18 .cse2 .cse3 (<= 1 |ULTIMATE.start_dll_create_~len#1|) .cse4 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (let ((.cse21 (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse20 (select .cse21 4))) (and .cse14 .cse0 .cse1 .cse15 (not (= |ULTIMATE.start_dll_create_~head~0#1.base| .cse20)) .cse16 .cse17 .cse18 .cse2 .cse3 (not (= .cse20 0)) .cse4 .cse5 .cse6 .cse7 .cse19 (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) .cse8 (= (select .cse21 8) 0) .cse11 .cse12 .cse13))))) [2022-11-26 00:07:41,103 INFO L902 garLoopResultBuilder]: At program point L604-2(lines 604 608) the Hoare annotation is: true [2022-11-26 00:07:41,104 INFO L895 garLoopResultBuilder]: At program point L629-3(lines 629 632) the Hoare annotation is: (let ((.cse30 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse29 (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse23 (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse31 (select .cse29 4)) (.cse4 (select .cse30 4))) (let ((.cse0 (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)) (.cse1 (<= 1 |ULTIMATE.start_dll_create_~data#1|)) (.cse2 (not (= 0 .cse4))) (.cse3 (<= 2 |ULTIMATE.start_dll_create_#in~len#1|)) (.cse5 (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))) (.cse26 (not (= |ULTIMATE.start_dll_create_~head~0#1.base| .cse31))) (.cse6 (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)) (.cse7 (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)) (.cse8 (<= |ULTIMATE.start_dll_create_~len#1| 2)) (.cse9 (<= |#NULL.offset| 0)) (.cse10 (<= |ULTIMATE.start_dll_create_~data#1| 1)) (.cse27 (not (= .cse31 0))) (.cse11 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse12 (<= |ULTIMATE.start_dll_create_#in~len#1| 2)) (.cse13 (<= 1 |ULTIMATE.start_dll_create_#in~data#1|)) (.cse14 (= (select .cse30 8) 0)) (.cse15 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse16 (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))) (.cse17 (<= |ULTIMATE.start_dll_create_#in~data#1| 1)) (.cse18 (<= |ULTIMATE.start_dll_create_~head~0#1.offset| 0)) (.cse22 (select .cse30 .cse23)) (.cse19 (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|)) (.cse28 (= (select .cse29 8) 0)) (.cse20 (<= 0 |#NULL.offset|)) (.cse21 (<= 0 |#StackHeapBarrier|)) (.cse24 (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse25 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= |ULTIMATE.start_main_~s~0#1.base| .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_dll_update_at_~index#1| 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (= (select (select |#memory_int| .cse22) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) .cse23)) (+ |ULTIMATE.start_main_~len~0#1| 1)) .cse24 .cse25) (and .cse0 .cse1 (= |ULTIMATE.start_main_~i~0#1| 0) .cse3 .cse5 .cse26 .cse6 .cse7 .cse9 .cse10 .cse27 (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_#res#1.base|) (= |ULTIMATE.start_dll_create_#res#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) .cse11 .cse12 (<= |ULTIMATE.start_dll_create_~len#1| 0) .cse13 .cse15 .cse16 (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) .cse17 (= |ULTIMATE.start_dll_create_#res#1.base| |ULTIMATE.start_main_~s~0#1.base|) .cse28 .cse20 .cse21 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse5 (<= 1 |ULTIMATE.start_main_~i~0#1|) .cse26 (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_update_at_~head#1.base|) .cse6 .cse7 .cse8 .cse9 .cse10 .cse27 (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_dll_update_at_~data#1|) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (forall ((v_ArrVal_650 (Array Int Int))) (<= |ULTIMATE.start_main_~len~0#1| (select (select (store |#memory_int| .cse22 v_ArrVal_650) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) .cse17 .cse18 (forall ((v_ArrVal_650 (Array Int Int))) (<= (select (select (store |#memory_int| .cse22 v_ArrVal_650) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~len~0#1|)) .cse19 .cse28 .cse20 (<= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_update_at_~head#1.offset|) .cse21 (= |ULTIMATE.start_dll_update_at_~index#1| 0) .cse24 .cse25))))) [2022-11-26 00:07:41,107 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1] [2022-11-26 00:07:41,109 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-26 00:07:41,117 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,118 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,118 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,119 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,119 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:07:41,119 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,120 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,120 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,121 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,121 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:07:41,135 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,136 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,137 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,137 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,137 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:07:41,138 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,138 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,138 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,139 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,139 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:07:41,143 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,143 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,144 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,144 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,144 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:07:41,145 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,145 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,145 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:07:41,146 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,146 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,147 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:07:41,147 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,147 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,148 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,148 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,148 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,149 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:07:41,149 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,149 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,150 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,150 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,151 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:07:41,154 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,154 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,154 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,155 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,155 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:07:41,155 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,155 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,156 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:07:41,156 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,156 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,157 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:07:41,157 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,157 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,158 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,158 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,158 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,158 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:07:41,159 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,159 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,160 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,160 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,161 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:07:41,164 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,164 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,165 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,166 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,167 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,167 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,170 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,170 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,171 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,171 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,171 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:07:41,172 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,172 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,173 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,173 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,173 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,174 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,174 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,186 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_650,QUANTIFIED] [2022-11-26 00:07:41,187 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,187 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_650,QUANTIFIED] [2022-11-26 00:07:41,188 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,188 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,191 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,207 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,207 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,207 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,208 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:07:41,208 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,208 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,209 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,209 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,209 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,210 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,210 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,211 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_650,QUANTIFIED] [2022-11-26 00:07:41,211 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,211 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_650,QUANTIFIED] [2022-11-26 00:07:41,211 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,212 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,214 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,215 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,215 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,216 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:07:41,216 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1500,QUANTIFIED] [2022-11-26 00:07:41,216 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,217 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,217 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,217 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,218 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,218 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,218 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,219 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,219 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,219 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,220 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,220 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_650,QUANTIFIED] [2022-11-26 00:07:41,220 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,221 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,221 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,223 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,231 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,231 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,231 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:07:41,231 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1500,QUANTIFIED] [2022-11-26 00:07:41,232 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,232 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,232 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,233 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,233 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,233 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,234 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,234 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,234 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,235 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,235 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,235 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_650,QUANTIFIED] [2022-11-26 00:07:41,235 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,236 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,236 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:07:41 BoogieIcfgContainer [2022-11-26 00:07:41,243 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-26 00:07:41,244 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-26 00:07:41,244 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-26 00:07:41,244 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-26 00:07:41,245 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:06:43" (3/4) ... [2022-11-26 00:07:41,248 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-26 00:07:41,254 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2022-11-26 00:07:41,263 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2022-11-26 00:07:41,263 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2022-11-26 00:07:41,264 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-26 00:07:41,264 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-26 00:07:41,294 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((1 <= data && 2 <= \old(len)) && #NULL <= 0) && data <= 1) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && len == 2) && \old(data) <= 1) && head <= 0) && 0 <= head) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && len == len) && #NULL == 0) || ((((((((((((((((((((new_head == 0 && 1 <= data) && 2 <= \old(len)) && !(head == 0)) && \valid[head] == 1) && \valid[new_head] == 1) && len <= 2) && #NULL <= 0) && data <= 1) && 1 <= len) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && len == 2) && !(new_head == 0)) && \old(data) <= 1) && head <= 0) && 0 <= head) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || (((((((((((((((((((((new_head == 0 && 1 <= data) && 2 <= \old(len)) && !(head == 0)) && !(head == #memory_$Pointer$[head][4])) && \valid[head] == 1) && \valid[new_head] == 1) && len <= 2) && #NULL <= 0) && data <= 1) && !(#memory_$Pointer$[head][4] == 0)) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && len == 2) && !(new_head == 0)) && head == 0) && \old(data) <= 1) && #memory_$Pointer$[head][8] == 0) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) [2022-11-26 00:07:41,295 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((new_head == 0 && 1 <= data) && !(0 == #memory_$Pointer$[s][4])) && 2 <= \old(len)) && !(s == #memory_$Pointer$[s][4])) && !(head == 0)) && \valid[head] == 1) && \valid[new_head] == 1) && len <= 2) && #NULL <= 0) && data <= 1) && unknown-#memory_int-unknown[s][s] == len) && index <= 0) && 2 <= i) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && #memory_$Pointer$[s][8] == 0) && len == 2) && !(new_head == 0)) && \old(data) <= 1) && head <= 0) && 0 <= head) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) && #NULL == 0) || ((((((((((((((((((((((((((new_head == 0 && 1 <= data) && i == 0) && 2 <= \old(len)) && !(head == 0)) && !(head == #memory_$Pointer$[head][4])) && \valid[head] == 1) && \valid[new_head] == 1) && #NULL <= 0) && data <= 1) && !(#memory_$Pointer$[head][4] == 0)) && head == \result) && \result == s) && data == 1) && \old(len) <= 2) && len <= 0) && 1 <= \old(data)) && len == 2) && !(new_head == 0)) && head == 0) && \old(data) <= 1) && \result == s) && #memory_$Pointer$[head][8] == 0) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && s == 0) && #NULL == 0)) || (((((((((((((((((((((((((((((((((new_head == 0 && 1 <= data) && !(0 == #memory_$Pointer$[s][4])) && 2 <= \old(len)) && !(head == 0)) && 1 <= i) && !(head == #memory_$Pointer$[head][4])) && s == head) && \valid[head] == 1) && \valid[new_head] == 1) && len <= 2) && #NULL <= 0) && data <= 1) && !(#memory_$Pointer$[head][4] == 0)) && len == data) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && #memory_$Pointer$[s][8] == 0) && len == 2) && !(new_head == 0)) && (forall v_ArrVal_650 : [int]int :: len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4] := v_ArrVal_650][s][s])) && \old(data) <= 1) && head <= 0) && (forall v_ArrVal_650 : [int]int :: unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4] := v_ArrVal_650][s][s] <= len)) && 0 <= head) && #memory_$Pointer$[head][8] == 0) && 0 <= #NULL) && i <= 1) && s == head) && 0 <= unknown-#StackHeapBarrier-unknown) && index == 0) && s == 0) && #NULL == 0) [2022-11-26 00:07:41,295 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((new_head == 0 && 1 <= data) && !(0 == #memory_$Pointer$[s][4])) && i == 0) && 2 <= \old(len)) && !(s == #memory_$Pointer$[s][4])) && !(head == 0)) && \valid[head] == 1) && \valid[new_head] == 1) && len <= 2) && #NULL <= 0) && data <= 1) && unknown-#memory_int-unknown[s][s] == len) && index <= 0) && 0 <= i) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && #memory_$Pointer$[s][8] == 0) && len == 2) && !(new_head == 0)) && \old(data) <= 1) && head <= 0) && 0 <= head) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) && #NULL == 0) || ((((((((((((((((((((((new_head == 0 && 1 <= data) && 2 <= \old(len)) && !(head == 0)) && \valid[head] == 1) && \valid[new_head] == 1) && len <= 2) && #NULL <= 0) && data <= 1) && index <= 0) && 0 <= i) && 2 <= i) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && len == 2) && !(new_head == 0)) && \old(data) <= 1) && head <= 0) && 0 <= head) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((((((((((((((((((((((((new_head == 0 && 1 <= data) && !(0 == #memory_$Pointer$[s][4])) && 2 <= \old(len)) && !(s == #memory_$Pointer$[s][4])) && !(head == 0)) && \valid[head] == 1) && \valid[new_head] == 1) && len <= 2) && i == 1) && #NULL <= 0) && index <= 0) && data <= 1) && index <= 0) && 0 <= i) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && #memory_$Pointer$[s][8] == 0) && len == 2) && !(new_head == 0)) && \old(data) <= 1) && head <= 0) && 0 <= head) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) && #NULL == 0) [2022-11-26 00:07:41,296 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((new_head == 0 && 1 <= data) && 2 <= \old(len)) && !(head == 0)) && !(head == #memory_$Pointer$[head][4])) && \valid[head] == 1) && \valid[new_head] == 1) && len <= 2) && data <= len + 1) && i == 1) && #NULL <= 0) && data <= 1) && !(#memory_$Pointer$[head][4] == 0)) && unknown-#memory_int-unknown[s][s] == len) && index <= 0) && len + 1 <= data) && #memory_$Pointer$[s][s + 4] == head) && data == 1) && (forall v_ArrVal_1500 : [int]int :: #memory_$Pointer$[head := v_ArrVal_1500][s][s + 4] == head)) && !(head == 0)) && \old(len) <= 2) && 1 <= \old(data)) && #memory_$Pointer$[s][8] == 0) && len == 2) && !(new_head == 0)) && head == 0) && \old(data) <= 1) && #memory_$Pointer$[head][8] == 0) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && s == 0) && #NULL == 0) || (((((((((((((((((((((((((((((((new_head == 0 && 1 <= data) && !(0 == #memory_$Pointer$[s][4])) && i == 0) && 2 <= \old(len)) && !(head == 0)) && !(head == #memory_$Pointer$[head][4])) && s == head) && \valid[head] == 1) && \valid[new_head] == 1) && len <= 2) && #NULL <= 0) && data <= 1) && !(#memory_$Pointer$[head][4] == 0)) && !(#memory_$Pointer$[head][4] == head)) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && #memory_$Pointer$[s][8] == 0) && len == 2) && !(new_head == 0)) && head == 0) && \old(data) <= 1) && data <= len + i) && #memory_$Pointer$[head][8] == 0) && 0 <= #NULL) && s == head) && 0 <= unknown-#StackHeapBarrier-unknown) && len + i <= data) && index == 0) && s == 0) && #NULL == 0)) || ((((((((((((((((((((((((((((((((new_head == 0 && 1 <= data) && 1 <= index) && !(0 == #memory_$Pointer$[s][4])) && 2 <= \old(len)) && !(head == 0)) && !(head == #memory_$Pointer$[head][4])) && s == head) && \valid[head] == 1) && len + 1 == data) && \valid[new_head] == 1) && index <= 1) && len <= 2) && i == 1) && #NULL <= 0) && data <= 1) && !(#memory_$Pointer$[head][4] == 0)) && unknown-#memory_int-unknown[s][s] == len) && (forall v_ArrVal_650 : [int]int :: len <= unknown-#memory_int-unknown[#memory_$Pointer$[head][head + 4] := v_ArrVal_650][s][s])) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && #memory_$Pointer$[s][8] == 0) && len == 2) && !(new_head == 0)) && head == 0) && \old(data) <= 1) && #memory_$Pointer$[head][8] == 0) && 0 <= #NULL) && s == head) && 0 <= unknown-#StackHeapBarrier-unknown) && s == 0) && #NULL == 0) [2022-11-26 00:07:41,297 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((new_head == 0 && 1 <= data) && unknown-#memory_int-unknown[head][head] == expected) && !(0 == #memory_$Pointer$[s][4])) && 2 <= \old(len)) && !(s == #memory_$Pointer$[s][4])) && !(head == 0)) && \valid[head] == 1) && \valid[new_head] == 1) && i + 1 <= len) && len <= 2) && i == 1) && #NULL <= 0) && index <= 0) && data <= 1) && index <= 0) && 0 <= i) && 3 == unknown-#memory_int-unknown[head][head]) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && #memory_$Pointer$[s][8] == 0) && len == 2) && !(new_head == 0)) && \old(data) <= 1) && head <= 0) && 0 <= head) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && !(head == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) && #NULL == 0) || ((((((((((((((((((((((((((((((((((((new_head == 0 && 1 <= index) && 1 <= data) && !(0 == #memory_$Pointer$[s][4])) && 2 <= \old(len)) && unknown-#memory_int-unknown[#memory_$Pointer$[head][head + 4]][#memory_$Pointer$[head][head + 4]] == expected) && !(s == #memory_$Pointer$[s][4])) && !(head == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[head][head + 4]][#memory_$Pointer$[head][head + 4]] == 3) && \valid[head] == 1) && !(head == #memory_$Pointer$[head][4])) && \valid[new_head] == 1) && #memory_$Pointer$[head][8] == 0) && i + 1 <= len) && head == 0) && len <= 2) && i == 1) && #NULL <= 0) && data <= 1) && index <= 1) && index <= 0) && 0 <= i) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && #memory_$Pointer$[s][8] == 0) && len == 2) && !(new_head == 0)) && \old(data) <= 1) && head <= 0) && !(0 == #memory_$Pointer$[head][4])) && 0 <= head) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) && #NULL == 0)) || (((((((((((((((((((((((((((((((((new_head == 0 && 1 <= data) && unknown-#memory_int-unknown[head][head] == expected) && !(0 == #memory_$Pointer$[s][4])) && i == 0) && 2 <= \old(len)) && !(s == #memory_$Pointer$[s][4])) && !(head == 0)) && \valid[head] == 1) && \valid[new_head] == 1) && i + 1 <= len) && head == 0) && len <= 2) && #NULL <= 0) && data <= 1) && unknown-#memory_int-unknown[s][s] == len) && index <= 0) && 0 <= i) && data == 1) && \old(len) <= 2) && 2 == unknown-#memory_int-unknown[head][head]) && index == 0) && 1 <= \old(data)) && #memory_$Pointer$[s][8] == 0) && len == 2) && !(new_head == 0)) && \old(data) <= 1) && head <= 0) && 0 <= head) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) && #NULL == 0) [2022-11-26 00:07:41,315 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-26 00:07:41,316 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-26 00:07:41,316 INFO L158 Benchmark]: Toolchain (without parser) took 59042.47ms. Allocated memory was 134.2MB in the beginning and 570.4MB in the end (delta: 436.2MB). Free memory was 73.1MB in the beginning and 385.4MB in the end (delta: -312.2MB). Peak memory consumption was 126.7MB. Max. memory is 16.1GB. [2022-11-26 00:07:41,316 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 134.2MB. Free memory is still 110.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:07:41,317 INFO L158 Benchmark]: CACSL2BoogieTranslator took 516.81ms. Allocated memory was 134.2MB in the beginning and 188.7MB in the end (delta: 54.5MB). Free memory was 72.9MB in the beginning and 153.5MB in the end (delta: -80.6MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2022-11-26 00:07:41,317 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.44ms. Allocated memory is still 188.7MB. Free memory was 153.5MB in the beginning and 151.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:07:41,317 INFO L158 Benchmark]: Boogie Preprocessor took 32.62ms. Allocated memory is still 188.7MB. Free memory was 151.4MB in the beginning and 150.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:07:41,317 INFO L158 Benchmark]: RCFGBuilder took 587.01ms. Allocated memory is still 188.7MB. Free memory was 150.3MB in the beginning and 130.5MB in the end (delta: 19.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-26 00:07:41,317 INFO L158 Benchmark]: TraceAbstraction took 57778.03ms. Allocated memory was 188.7MB in the beginning and 570.4MB in the end (delta: 381.7MB). Free memory was 130.5MB in the beginning and 389.6MB in the end (delta: -259.1MB). Peak memory consumption was 321.8MB. Max. memory is 16.1GB. [2022-11-26 00:07:41,318 INFO L158 Benchmark]: Witness Printer took 72.16ms. Allocated memory is still 570.4MB. Free memory was 389.6MB in the beginning and 385.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-26 00:07:41,319 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 134.2MB. Free memory is still 110.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 516.81ms. Allocated memory was 134.2MB in the beginning and 188.7MB in the end (delta: 54.5MB). Free memory was 72.9MB in the beginning and 153.5MB in the end (delta: -80.6MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.44ms. Allocated memory is still 188.7MB. Free memory was 153.5MB in the beginning and 151.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.62ms. Allocated memory is still 188.7MB. Free memory was 151.4MB in the beginning and 150.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 587.01ms. Allocated memory is still 188.7MB. Free memory was 150.3MB in the beginning and 130.5MB in the end (delta: 19.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 57778.03ms. Allocated memory was 188.7MB in the beginning and 570.4MB in the end (delta: 381.7MB). Free memory was 130.5MB in the beginning and 389.6MB in the end (delta: -259.1MB). Peak memory consumption was 321.8MB. Max. memory is 16.1GB. * Witness Printer took 72.16ms. Allocated memory is still 570.4MB. Free memory was 389.6MB in the beginning and 385.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_650,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_650,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_650,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_650,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_650,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_650,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * 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: 641]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 57.6s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 19 mSolverCounterUnknown, 460 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 460 mSDsluCounter, 344 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 171 IncrementalHoareTripleChecker+Unchecked, 264 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1216 IncrementalHoareTripleChecker+Invalid, 1453 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 80 mSDtfsCounter, 1216 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 601 GetRequests, 337 SyntacticMatches, 23 SemanticMatches, 241 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2174 ImplicationChecksByTransitivity, 14.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=10, InterpolantAutomatonStates: 102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 60 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 13 PreInvPairs, 30 NumberOfFragments, 1867 HoareAnnotationTreeSize, 13 FomulaSimplifications, 2127 FormulaSimplificationTreeSizeReduction, 2.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 39038 FormulaSimplificationTreeSizeReductionInter, 2.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 401 NumberOfCodeBlocks, 384 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 526 ConstructedInterpolants, 13 QuantifiedInterpolants, 3452 SizeOfPredicates, 85 NumberOfNonLiveVariables, 2554 ConjunctsInSsa, 227 ConjunctsInUnsatCore, 32 InterpolantComputations, 4 PerfectInterpolantSequences, 225/344 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: 4.1s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 1, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 5, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 14, TOOLS_POST_TIME: 3.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: 14, TOOLS_QUANTIFIERELIM_TIME: 3.9s, TOOLS_QUANTIFIERELIM_MAX_TIME: 1.9s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 27, 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: 3, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 5, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME: 4.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 4.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 3, 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: 62, DAG_COMPRESSION_RETAINED_NODES: 28, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 633]: Loop Invariant [2022-11-26 00:07:41,342 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,342 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,343 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,343 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,343 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:07:41,343 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,344 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,344 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,344 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,345 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:07:41,346 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,346 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,347 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,347 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,347 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:07:41,348 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,348 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,348 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,349 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,349 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((((((((((((new_head == 0 && 1 <= data) && !(0 == #memory_$Pointer$[s][4])) && i == 0) && 2 <= \old(len)) && !(s == #memory_$Pointer$[s][4])) && !(head == 0)) && \valid[head] == 1) && \valid[new_head] == 1) && len <= 2) && #NULL <= 0) && data <= 1) && unknown-#memory_int-unknown[s][s] == len) && index <= 0) && 0 <= i) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && #memory_$Pointer$[s][8] == 0) && len == 2) && !(new_head == 0)) && \old(data) <= 1) && head <= 0) && 0 <= head) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) && #NULL == 0) || ((((((((((((((((((((((new_head == 0 && 1 <= data) && 2 <= \old(len)) && !(head == 0)) && \valid[head] == 1) && \valid[new_head] == 1) && len <= 2) && #NULL <= 0) && data <= 1) && index <= 0) && 0 <= i) && 2 <= i) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && len == 2) && !(new_head == 0)) && \old(data) <= 1) && head <= 0) && 0 <= head) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((((((((((((((((((((((((new_head == 0 && 1 <= data) && !(0 == #memory_$Pointer$[s][4])) && 2 <= \old(len)) && !(s == #memory_$Pointer$[s][4])) && !(head == 0)) && \valid[head] == 1) && \valid[new_head] == 1) && len <= 2) && i == 1) && #NULL <= 0) && index <= 0) && data <= 1) && index <= 0) && 0 <= i) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && #memory_$Pointer$[s][8] == 0) && len == 2) && !(new_head == 0)) && \old(data) <= 1) && head <= 0) && 0 <= head) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) && #NULL == 0) - InvariantResult [Line: 611]: Loop Invariant [2022-11-26 00:07:41,351 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,351 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,351 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,352 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,352 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:07:41,352 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,352 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,353 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:07:41,353 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,354 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,354 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:07:41,354 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,355 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,355 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,355 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,356 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,356 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:07:41,356 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,356 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,357 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,357 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,357 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:07:41,359 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,359 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,360 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,360 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,360 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:07:41,361 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,361 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,361 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:07:41,362 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,362 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,362 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:07:41,363 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,363 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,363 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,364 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,364 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,364 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:07:41,364 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,365 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,365 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,365 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,366 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((((((((((((((((new_head == 0 && 1 <= data) && unknown-#memory_int-unknown[head][head] == expected) && !(0 == #memory_$Pointer$[s][4])) && 2 <= \old(len)) && !(s == #memory_$Pointer$[s][4])) && !(head == 0)) && \valid[head] == 1) && \valid[new_head] == 1) && i + 1 <= len) && len <= 2) && i == 1) && #NULL <= 0) && index <= 0) && data <= 1) && index <= 0) && 0 <= i) && 3 == unknown-#memory_int-unknown[head][head]) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && #memory_$Pointer$[s][8] == 0) && len == 2) && !(new_head == 0)) && \old(data) <= 1) && head <= 0) && 0 <= head) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && !(head == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) && #NULL == 0) || ((((((((((((((((((((((((((((((((((((new_head == 0 && 1 <= index) && 1 <= data) && !(0 == #memory_$Pointer$[s][4])) && 2 <= \old(len)) && unknown-#memory_int-unknown[#memory_$Pointer$[head][head + 4]][#memory_$Pointer$[head][head + 4]] == expected) && !(s == #memory_$Pointer$[s][4])) && !(head == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[head][head + 4]][#memory_$Pointer$[head][head + 4]] == 3) && \valid[head] == 1) && !(head == #memory_$Pointer$[head][4])) && \valid[new_head] == 1) && #memory_$Pointer$[head][8] == 0) && i + 1 <= len) && head == 0) && len <= 2) && i == 1) && #NULL <= 0) && data <= 1) && index <= 1) && index <= 0) && 0 <= i) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && #memory_$Pointer$[s][8] == 0) && len == 2) && !(new_head == 0)) && \old(data) <= 1) && head <= 0) && !(0 == #memory_$Pointer$[head][4])) && 0 <= head) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) && #NULL == 0)) || (((((((((((((((((((((((((((((((((new_head == 0 && 1 <= data) && unknown-#memory_int-unknown[head][head] == expected) && !(0 == #memory_$Pointer$[s][4])) && i == 0) && 2 <= \old(len)) && !(s == #memory_$Pointer$[s][4])) && !(head == 0)) && \valid[head] == 1) && \valid[new_head] == 1) && i + 1 <= len) && head == 0) && len <= 2) && #NULL <= 0) && data <= 1) && unknown-#memory_int-unknown[s][s] == len) && index <= 0) && 0 <= i) && data == 1) && \old(len) <= 2) && 2 == unknown-#memory_int-unknown[head][head]) && index == 0) && 1 <= \old(data)) && #memory_$Pointer$[s][8] == 0) && len == 2) && !(new_head == 0)) && \old(data) <= 1) && head <= 0) && 0 <= head) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) && #NULL == 0) - InvariantResult [Line: 624]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 587]: Loop Invariant [2022-11-26 00:07:41,368 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,368 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,369 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,370 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,370 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,370 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((1 <= data && 2 <= \old(len)) && #NULL <= 0) && data <= 1) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && len == 2) && \old(data) <= 1) && head <= 0) && 0 <= head) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && len == len) && #NULL == 0) || ((((((((((((((((((((new_head == 0 && 1 <= data) && 2 <= \old(len)) && !(head == 0)) && \valid[head] == 1) && \valid[new_head] == 1) && len <= 2) && #NULL <= 0) && data <= 1) && 1 <= len) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && len == 2) && !(new_head == 0)) && \old(data) <= 1) && head <= 0) && 0 <= head) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || (((((((((((((((((((((new_head == 0 && 1 <= data) && 2 <= \old(len)) && !(head == 0)) && !(head == #memory_$Pointer$[head][4])) && \valid[head] == 1) && \valid[new_head] == 1) && len <= 2) && #NULL <= 0) && data <= 1) && !(#memory_$Pointer$[head][4] == 0)) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && len == 2) && !(new_head == 0)) && head == 0) && \old(data) <= 1) && #memory_$Pointer$[head][8] == 0) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 604]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 629]: Loop Invariant [2022-11-26 00:07:41,372 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,372 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,372 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,373 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,373 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:07:41,373 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,373 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,374 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,374 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,374 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,375 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,375 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,375 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_650,QUANTIFIED] [2022-11-26 00:07:41,375 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,376 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_650,QUANTIFIED] [2022-11-26 00:07:41,376 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,376 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,378 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,378 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,379 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,379 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,379 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:07:41,379 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,380 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,380 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,380 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,381 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,381 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,381 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,382 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_650,QUANTIFIED] [2022-11-26 00:07:41,382 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,382 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_650,QUANTIFIED] [2022-11-26 00:07:41,382 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,383 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((((((((new_head == 0 && 1 <= data) && !(0 == #memory_$Pointer$[s][4])) && 2 <= \old(len)) && !(s == #memory_$Pointer$[s][4])) && !(head == 0)) && \valid[head] == 1) && \valid[new_head] == 1) && len <= 2) && #NULL <= 0) && data <= 1) && unknown-#memory_int-unknown[s][s] == len) && index <= 0) && 2 <= i) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && #memory_$Pointer$[s][8] == 0) && len == 2) && !(new_head == 0)) && \old(data) <= 1) && head <= 0) && 0 <= head) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) && #NULL == 0) || ((((((((((((((((((((((((((new_head == 0 && 1 <= data) && i == 0) && 2 <= \old(len)) && !(head == 0)) && !(head == #memory_$Pointer$[head][4])) && \valid[head] == 1) && \valid[new_head] == 1) && #NULL <= 0) && data <= 1) && !(#memory_$Pointer$[head][4] == 0)) && head == \result) && \result == s) && data == 1) && \old(len) <= 2) && len <= 0) && 1 <= \old(data)) && len == 2) && !(new_head == 0)) && head == 0) && \old(data) <= 1) && \result == s) && #memory_$Pointer$[head][8] == 0) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && s == 0) && #NULL == 0)) || (((((((((((((((((((((((((((((((((new_head == 0 && 1 <= data) && !(0 == #memory_$Pointer$[s][4])) && 2 <= \old(len)) && !(head == 0)) && 1 <= i) && !(head == #memory_$Pointer$[head][4])) && s == head) && \valid[head] == 1) && \valid[new_head] == 1) && len <= 2) && #NULL <= 0) && data <= 1) && !(#memory_$Pointer$[head][4] == 0)) && len == data) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && #memory_$Pointer$[s][8] == 0) && len == 2) && !(new_head == 0)) && (forall v_ArrVal_650 : [int]int :: len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4] := v_ArrVal_650][s][s])) && \old(data) <= 1) && head <= 0) && (forall v_ArrVal_650 : [int]int :: unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4] := v_ArrVal_650][s][s] <= len)) && 0 <= head) && #memory_$Pointer$[head][8] == 0) && 0 <= #NULL) && i <= 1) && s == head) && 0 <= unknown-#StackHeapBarrier-unknown) && index == 0) && s == 0) && #NULL == 0) - InvariantResult [Line: 573]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 624]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 618]: Loop Invariant [2022-11-26 00:07:41,385 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,385 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,386 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,386 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:07:41,386 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1500,QUANTIFIED] [2022-11-26 00:07:41,386 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,387 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,387 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,387 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,388 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,388 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,388 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,389 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,389 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,389 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,389 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,390 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_650,QUANTIFIED] [2022-11-26 00:07:41,390 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,390 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,391 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,392 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,393 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,393 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,393 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:07:41,394 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1500,QUANTIFIED] [2022-11-26 00:07:41,394 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,394 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,394 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,395 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,395 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,395 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,396 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,396 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,396 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,397 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,397 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,397 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_650,QUANTIFIED] [2022-11-26 00:07:41,397 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,398 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:07:41,398 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((((((((((((new_head == 0 && 1 <= data) && 2 <= \old(len)) && !(head == 0)) && !(head == #memory_$Pointer$[head][4])) && \valid[head] == 1) && \valid[new_head] == 1) && len <= 2) && data <= len + 1) && i == 1) && #NULL <= 0) && data <= 1) && !(#memory_$Pointer$[head][4] == 0)) && unknown-#memory_int-unknown[s][s] == len) && index <= 0) && len + 1 <= data) && #memory_$Pointer$[s][s + 4] == head) && data == 1) && (forall v_ArrVal_1500 : [int]int :: #memory_$Pointer$[head := v_ArrVal_1500][s][s + 4] == head)) && !(head == 0)) && \old(len) <= 2) && 1 <= \old(data)) && #memory_$Pointer$[s][8] == 0) && len == 2) && !(new_head == 0)) && head == 0) && \old(data) <= 1) && #memory_$Pointer$[head][8] == 0) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && s == 0) && #NULL == 0) || (((((((((((((((((((((((((((((((new_head == 0 && 1 <= data) && !(0 == #memory_$Pointer$[s][4])) && i == 0) && 2 <= \old(len)) && !(head == 0)) && !(head == #memory_$Pointer$[head][4])) && s == head) && \valid[head] == 1) && \valid[new_head] == 1) && len <= 2) && #NULL <= 0) && data <= 1) && !(#memory_$Pointer$[head][4] == 0)) && !(#memory_$Pointer$[head][4] == head)) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && #memory_$Pointer$[s][8] == 0) && len == 2) && !(new_head == 0)) && head == 0) && \old(data) <= 1) && data <= len + i) && #memory_$Pointer$[head][8] == 0) && 0 <= #NULL) && s == head) && 0 <= unknown-#StackHeapBarrier-unknown) && len + i <= data) && index == 0) && s == 0) && #NULL == 0)) || ((((((((((((((((((((((((((((((((new_head == 0 && 1 <= data) && 1 <= index) && !(0 == #memory_$Pointer$[s][4])) && 2 <= \old(len)) && !(head == 0)) && !(head == #memory_$Pointer$[head][4])) && s == head) && \valid[head] == 1) && len + 1 == data) && \valid[new_head] == 1) && index <= 1) && len <= 2) && i == 1) && #NULL <= 0) && data <= 1) && !(#memory_$Pointer$[head][4] == 0)) && unknown-#memory_int-unknown[s][s] == len) && (forall v_ArrVal_650 : [int]int :: len <= unknown-#memory_int-unknown[#memory_$Pointer$[head][head + 4] := v_ArrVal_650][s][s])) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && #memory_$Pointer$[s][8] == 0) && len == 2) && !(new_head == 0)) && head == 0) && \old(data) <= 1) && #memory_$Pointer$[head][8] == 0) && 0 <= #NULL) && s == head) && 0 <= unknown-#StackHeapBarrier-unknown) && s == 0) && #NULL == 0) RESULT: Ultimate proved your program to be correct! [2022-11-26 00:07:41,417 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41056f57-1eb1-41f1-92b1-9c826cb683da/bin/utaipan-ByfvJB40ur/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