./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2c_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b 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_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_update_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9 --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 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 --- 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-6b4ec56 [2022-11-20 20:09:56,039 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 20:09:56,042 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 20:09:56,082 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 20:09:56,083 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 20:09:56,084 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 20:09:56,085 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 20:09:56,087 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 20:09:56,089 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 20:09:56,090 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 20:09:56,091 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 20:09:56,092 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 20:09:56,092 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 20:09:56,093 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 20:09:56,094 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 20:09:56,096 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 20:09:56,096 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 20:09:56,098 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 20:09:56,099 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 20:09:56,101 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 20:09:56,103 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 20:09:56,104 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 20:09:56,105 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 20:09:56,106 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 20:09:56,110 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 20:09:56,111 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 20:09:56,111 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 20:09:56,112 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 20:09:56,113 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 20:09:56,114 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 20:09:56,114 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 20:09:56,115 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 20:09:56,116 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 20:09:56,117 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 20:09:56,118 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 20:09:56,118 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 20:09:56,119 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 20:09:56,119 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 20:09:56,120 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 20:09:56,121 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 20:09:56,121 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 20:09:56,126 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-20 20:09:56,153 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 20:09:56,157 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 20:09:56,158 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 20:09:56,159 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 20:09:56,160 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 20:09:56,160 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 20:09:56,160 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-20 20:09:56,160 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-20 20:09:56,161 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-20 20:09:56,161 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-20 20:09:56,162 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-20 20:09:56,162 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-20 20:09:56,163 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-20 20:09:56,163 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-20 20:09:56,163 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-20 20:09:56,163 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-20 20:09:56,164 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-20 20:09:56,164 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-20 20:09:56,165 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 20:09:56,165 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 20:09:56,165 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 20:09:56,165 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 20:09:56,165 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 20:09:56,166 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 20:09:56,166 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 20:09:56,166 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 20:09:56,166 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 20:09:56,167 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 20:09:56,167 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 20:09:56,167 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 20:09:56,168 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 20:09:56,168 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 20:09:56,168 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:09:56,169 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 20:09:56,169 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-20 20:09:56,169 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 20:09:56,169 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 20:09:56,170 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-20 20:09:56,170 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 20:09:56,170 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 20:09:56,170 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-20 20:09:56,171 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_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/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_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9 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 -> 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 [2022-11-20 20:09:56,468 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 20:09:56,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 20:09:56,492 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 20:09:56,493 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 20:09:56,494 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 20:09:56,495 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/../../sv-benchmarks/c/list-simple/dll2c_update_all.i [2022-11-20 20:09:59,629 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 20:09:59,896 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 20:09:59,897 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/sv-benchmarks/c/list-simple/dll2c_update_all.i [2022-11-20 20:09:59,909 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/data/05fa15244/58396cd3e63a4ec6ba075ea81d86210e/FLAG27fa1a234 [2022-11-20 20:09:59,925 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/data/05fa15244/58396cd3e63a4ec6ba075ea81d86210e [2022-11-20 20:09:59,939 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 20:09:59,941 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 20:09:59,944 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 20:09:59,947 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 20:09:59,951 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 20:09:59,952 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:09:59" (1/1) ... [2022-11-20 20:09:59,953 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f14ecd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:59, skipping insertion in model container [2022-11-20 20:09:59,953 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:09:59" (1/1) ... [2022-11-20 20:09:59,961 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 20:09:59,996 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 20:10:00,350 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_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/sv-benchmarks/c/list-simple/dll2c_update_all.i[24538,24551] [2022-11-20 20:10:00,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:10:00,375 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 20:10:00,447 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_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/sv-benchmarks/c/list-simple/dll2c_update_all.i[24538,24551] [2022-11-20 20:10:00,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:10:00,483 INFO L208 MainTranslator]: Completed translation [2022-11-20 20:10:00,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:10:00 WrapperNode [2022-11-20 20:10:00,484 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 20:10:00,486 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 20:10:00,486 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 20:10:00,486 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 20:10:00,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:10:00" (1/1) ... [2022-11-20 20:10:00,520 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:10:00" (1/1) ... [2022-11-20 20:10:00,544 INFO L138 Inliner]: procedures = 126, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 131 [2022-11-20 20:10:00,545 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 20:10:00,546 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 20:10:00,546 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 20:10:00,546 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 20:10:00,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:10:00" (1/1) ... [2022-11-20 20:10:00,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:10:00" (1/1) ... [2022-11-20 20:10:00,561 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:10:00" (1/1) ... [2022-11-20 20:10:00,561 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:10:00" (1/1) ... [2022-11-20 20:10:00,569 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:10:00" (1/1) ... [2022-11-20 20:10:00,574 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:10:00" (1/1) ... [2022-11-20 20:10:00,576 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:10:00" (1/1) ... [2022-11-20 20:10:00,577 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:10:00" (1/1) ... [2022-11-20 20:10:00,580 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 20:10:00,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 20:10:00,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 20:10:00,581 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 20:10:00,582 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:10:00" (1/1) ... [2022-11-20 20:10:00,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:10:00,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:10:00,617 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 20:10:00,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 20:10:00,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 20:10:00,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 20:10:00,666 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-20 20:10:00,666 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-20 20:10:00,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 20:10:00,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 20:10:00,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 20:10:00,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 20:10:00,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 20:10:00,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 20:10:00,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 20:10:00,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 20:10:00,854 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 20:10:00,856 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 20:10:01,127 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 20:10:01,202 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 20:10:01,203 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-20 20:10:01,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:10:01 BoogieIcfgContainer [2022-11-20 20:10:01,206 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 20:10:01,209 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 20:10:01,209 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 20:10:01,213 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 20:10:01,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:09:59" (1/3) ... [2022-11-20 20:10:01,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bff3516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:10:01, skipping insertion in model container [2022-11-20 20:10:01,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:10:00" (2/3) ... [2022-11-20 20:10:01,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bff3516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:10:01, skipping insertion in model container [2022-11-20 20:10:01,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:10:01" (3/3) ... [2022-11-20 20:10:01,217 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all.i [2022-11-20 20:10:01,239 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 20:10:01,239 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 20:10:01,288 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 20:10:01,295 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;@185a9f63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 20:10:01,295 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 20:10:01,301 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 20:10:01,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 20:10:01,310 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:10:01,310 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:10:01,311 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:10:01,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:10:01,316 INFO L85 PathProgramCache]: Analyzing trace with hash 165599205, now seen corresponding path program 1 times [2022-11-20 20:10:01,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:10:01,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998145795] [2022-11-20 20:10:01,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:10:01,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:10:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:10:01,704 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-20 20:10:01,705 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:10:01,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998145795] [2022-11-20 20:10:01,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998145795] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:10:01,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:10:01,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:10:01,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740495205] [2022-11-20 20:10:01,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:10:01,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:10:01,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:10:01,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:10:01,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:10:01,756 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 20:10:01,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:10:01,860 INFO L93 Difference]: Finished difference Result 37 states and 54 transitions. [2022-11-20 20:10:01,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:10:01,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-11-20 20:10:01,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:10:01,870 INFO L225 Difference]: With dead ends: 37 [2022-11-20 20:10:01,871 INFO L226 Difference]: Without dead ends: 19 [2022-11-20 20:10:01,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:10:01,877 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 20:10:01,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 35 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 20:10:01,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-20 20:10:01,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2022-11-20 20:10:01,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 20:10:01,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2022-11-20 20:10:01,917 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 12 [2022-11-20 20:10:01,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:10:01,917 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2022-11-20 20:10:01,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 20:10:01,918 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2022-11-20 20:10:01,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 20:10:01,919 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:10:01,919 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:10:01,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 20:10:01,920 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:10:01,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:10:01,921 INFO L85 PathProgramCache]: Analyzing trace with hash 523554530, now seen corresponding path program 1 times [2022-11-20 20:10:01,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:10:01,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129876651] [2022-11-20 20:10:01,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:10:01,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:10:01,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:10:02,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 20:10:02,200 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:10:02,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129876651] [2022-11-20 20:10:02,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129876651] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:10:02,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:10:02,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 20:10:02,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608419911] [2022-11-20 20:10:02,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:10:02,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:10:02,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:10:02,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:10:02,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:10:02,204 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 20:10:02,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:10:02,286 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-11-20 20:10:02,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 20:10:02,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-11-20 20:10:02,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:10:02,290 INFO L225 Difference]: With dead ends: 29 [2022-11-20 20:10:02,292 INFO L226 Difference]: Without dead ends: 24 [2022-11-20 20:10:02,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:10:02,295 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 27 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:10:02,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 20 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:10:02,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-20 20:10:02,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2022-11-20 20:10:02,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 20:10:02,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2022-11-20 20:10:02,311 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 18 [2022-11-20 20:10:02,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:10:02,316 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2022-11-20 20:10:02,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 20:10:02,317 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-11-20 20:10:02,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 20:10:02,318 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:10:02,318 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:10:02,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 20:10:02,319 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:10:02,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:10:02,320 INFO L85 PathProgramCache]: Analyzing trace with hash 517856597, now seen corresponding path program 1 times [2022-11-20 20:10:02,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:10:02,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078552328] [2022-11-20 20:10:02,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:10:02,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:10:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:10:02,600 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 20:10:02,601 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:10:02,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078552328] [2022-11-20 20:10:02,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078552328] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:10:02,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644458111] [2022-11-20 20:10:02,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:10:02,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:10:02,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:10:02,611 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:10:02,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 20:10:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:10:02,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 20:10:02,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:10:02,949 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 20:10:02,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:10:03,024 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 20:10:03,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644458111] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:10:03,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1146913167] [2022-11-20 20:10:03,050 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-20 20:10:03,050 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:10:03,054 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:10:03,060 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:10:03,060 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:10:03,170 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-20 20:10:03,179 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-20 20:10:03,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:03,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:03,207 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-20 20:10:03,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:03,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:03,229 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-20 20:10:03,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:03,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:03,272 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 21 treesize of output 26 [2022-11-20 20:10:03,828 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 9 treesize of output 3 [2022-11-20 20:10:03,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:03,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:03,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:03,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-20 20:10:03,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:03,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-20 20:10:03,900 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:03,903 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:03,906 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:04,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:10:04,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:10:04,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:04,229 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 7 treesize of output 3 [2022-11-20 20:10:04,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:04,255 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:04,258 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:04,260 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:04,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:04,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:04,320 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:04,333 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 20:10:04,333 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 44 treesize of output 30 [2022-11-20 20:10:04,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:04,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:04,352 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:04,367 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 20:10:04,368 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 44 treesize of output 34 [2022-11-20 20:10:04,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:04,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:04,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:04,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2022-11-20 20:10:04,688 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 9 treesize of output 3 [2022-11-20 20:10:04,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:04,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-20 20:10:04,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:04,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:04,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-20 20:10:04,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:04,752 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:04,755 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:04,758 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:05,042 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 7 treesize of output 3 [2022-11-20 20:10:05,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:05,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:05,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:10:05,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:10:05,101 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:05,104 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:05,105 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:05,107 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:05,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:05,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:05,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 18 [2022-11-20 20:10:05,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:05,211 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 20:10:05,211 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 42 treesize of output 28 [2022-11-20 20:10:05,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:05,240 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 20:10:05,240 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 42 treesize of output 32 [2022-11-20 20:10:05,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:05,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-20 20:10:05,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:05,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-11-20 20:10:05,346 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:05,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:05,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-20 20:10:05,391 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:05,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:05,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:05,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:05,407 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:10:05,407 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 36 treesize of output 23 [2022-11-20 20:10:05,422 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 13 treesize of output 9 [2022-11-20 20:10:05,442 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:05,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:05,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:05,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:05,454 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:10:05,455 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 36 treesize of output 23 [2022-11-20 20:10:05,559 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:05,560 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 134 [2022-11-20 20:10:05,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:05,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:05,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:05,588 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:10:05,589 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 144 treesize of output 121 [2022-11-20 20:10:05,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:05,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:05,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:05,616 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:10:05,616 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 144 treesize of output 121 [2022-11-20 20:10:05,962 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-11-20 20:10:06,141 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:10:09,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1146913167] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:10:09,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:10:09,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5, 5, 5] total 20 [2022-11-20 20:10:09,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272839055] [2022-11-20 20:10:10,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:10:10,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 20:10:10,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:10:10,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 20:10:10,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2022-11-20 20:10:10,002 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 12 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 20:10:10,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:10:10,263 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2022-11-20 20:10:10,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 20:10:10,264 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-11-20 20:10:10,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:10:10,265 INFO L225 Difference]: With dead ends: 25 [2022-11-20 20:10:10,265 INFO L226 Difference]: Without dead ends: 20 [2022-11-20 20:10:10,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2022-11-20 20:10:10,266 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 16 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:10:10,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 24 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 53 Unchecked, 0.2s Time] [2022-11-20 20:10:10,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-20 20:10:10,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-11-20 20:10:10,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 20:10:10,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2022-11-20 20:10:10,277 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 20 [2022-11-20 20:10:10,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:10:10,278 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2022-11-20 20:10:10,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 20:10:10,278 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2022-11-20 20:10:10,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 20:10:10,278 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:10:10,279 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:10:10,289 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 20:10:10,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:10:10,485 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:10:10,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:10:10,485 INFO L85 PathProgramCache]: Analyzing trace with hash 250342324, now seen corresponding path program 1 times [2022-11-20 20:10:10,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:10:10,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992472838] [2022-11-20 20:10:10,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:10:10,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:10:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:10:10,627 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 20:10:10,627 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:10:10,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992472838] [2022-11-20 20:10:10,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992472838] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:10:10,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:10:10,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 20:10:10,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652518408] [2022-11-20 20:10:10,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:10:10,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:10:10,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:10:10,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:10:10,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:10:10,631 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 20:10:10,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:10:10,708 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-11-20 20:10:10,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:10:10,709 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-11-20 20:10:10,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:10:10,710 INFO L225 Difference]: With dead ends: 34 [2022-11-20 20:10:10,710 INFO L226 Difference]: Without dead ends: 27 [2022-11-20 20:10:10,711 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-20 20:10:10,715 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:10:10,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 33 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:10:10,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-20 20:10:10,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2022-11-20 20:10:10,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 20:10:10,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-11-20 20:10:10,730 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 21 [2022-11-20 20:10:10,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:10:10,730 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-11-20 20:10:10,730 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 20:10:10,731 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-11-20 20:10:10,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 20:10:10,731 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:10:10,731 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:10:10,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 20:10:10,732 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:10:10,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:10:10,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1993055135, now seen corresponding path program 2 times [2022-11-20 20:10:10,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:10:10,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490165096] [2022-11-20 20:10:10,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:10:10,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:10:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:10:12,449 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:10:12,449 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:10:12,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490165096] [2022-11-20 20:10:12,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490165096] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:10:12,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468796328] [2022-11-20 20:10:12,450 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:10:12,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:10:12,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:10:12,451 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:10:12,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 20:10:12,898 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 20:10:12,899 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:10:12,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 100 conjunts are in the unsatisfiable core [2022-11-20 20:10:12,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:10:12,950 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-20 20:10:13,138 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 20:10:13,138 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-20 20:10:13,208 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-20 20:10:13,212 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-20 20:10:13,318 INFO L321 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2022-11-20 20:10:13,319 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 95 [2022-11-20 20:10:13,324 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 83 treesize of output 69 [2022-11-20 20:10:13,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-20 20:10:13,549 INFO L321 Elim1Store]: treesize reduction 28, result has 15.2 percent of original size [2022-11-20 20:10:13,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 60 [2022-11-20 20:10:13,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:13,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:13,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 58 treesize of output 57 [2022-11-20 20:10:13,573 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 9 treesize of output 7 [2022-11-20 20:10:13,580 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 13 treesize of output 9 [2022-11-20 20:10:13,741 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-20 20:10:13,804 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 16 treesize of output 18 [2022-11-20 20:10:13,962 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 15 treesize of output 7 [2022-11-20 20:10:14,001 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:10:14,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:10:14,169 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8))) (and (forall ((v_ArrVal_500 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_500) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (forall ((v_ArrVal_500 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_500) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) (+ |c_ULTIMATE.start_main_~len~0#1| 1))))) is different from false [2022-11-20 20:10:14,180 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8))) (and (forall ((v_ArrVal_500 (Array Int Int))) (< (select (select (store |c_#memory_int| .cse0 v_ArrVal_500) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) (+ |c_ULTIMATE.start_main_~len~0#1| 1))) (forall ((v_ArrVal_500 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| .cse0 v_ArrVal_500) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))) is different from false [2022-11-20 20:10:14,192 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|)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8))) (and (forall ((v_ArrVal_500 (Array Int Int))) (< (select (select (store |c_#memory_int| .cse0 v_ArrVal_500) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) (+ |c_ULTIMATE.start_main_~len~0#1| 1))) (forall ((v_ArrVal_500 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| .cse0 v_ArrVal_500) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))) is different from false [2022-11-20 20:10:14,206 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:10:14,206 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 36 treesize of output 37 [2022-11-20 20:10:14,217 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:10:14,218 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 63 [2022-11-20 20:10:14,224 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 21 [2022-11-20 20:10:14,255 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:10:14,255 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 38 treesize of output 39 [2022-11-20 20:10:14,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:14,261 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 56 [2022-11-20 20:10:14,266 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 27 treesize of output 23 [2022-11-20 20:10:14,393 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_492 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_492) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) is different from false [2022-11-20 20:10:14,421 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:10:14,422 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 68 treesize of output 82 [2022-11-20 20:10:14,449 INFO L321 Elim1Store]: treesize reduction 10, result has 70.6 percent of original size [2022-11-20 20:10:14,449 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-20 20:10:14,469 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:10:14,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 58 [2022-11-20 20:10:14,510 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-20 20:10:14,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 10 treesize of output 18 [2022-11-20 20:10:14,526 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 40 treesize of output 36 [2022-11-20 20:10:14,531 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 22 treesize of output 20 [2022-11-20 20:10:14,549 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 6 treesize of output 4 [2022-11-20 20:10:14,555 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-20 20:10:14,565 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 22 treesize of output 18 [2022-11-20 20:10:14,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468796328] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:10:14,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [695577998] [2022-11-20 20:10:14,724 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-20 20:10:14,724 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:10:14,724 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:10:14,724 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:10:14,724 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:10:14,753 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-20 20:10:14,757 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-20 20:10:14,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:14,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:14,769 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-20 20:10:14,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:14,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:14,788 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 21 treesize of output 26 [2022-11-20 20:10:14,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:14,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:14,798 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-20 20:10:14,911 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 9 treesize of output 3 [2022-11-20 20:10:14,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:14,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:14,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-20 20:10:14,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:14,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-20 20:10:14,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:14,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:14,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-20 20:10:15,007 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 9 treesize of output 3 [2022-11-20 20:10:15,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:15,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:15,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-20 20:10:15,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:15,182 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:15,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:15,189 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 209 [2022-11-20 20:10:15,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:15,209 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:15,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:15,211 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:15,212 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:15,213 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:15,233 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-20 20:10:15,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 332 treesize of output 334 [2022-11-20 20:10:15,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:15,268 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:15,270 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:15,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:15,273 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:15,293 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-20 20:10:15,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 328 treesize of output 236 [2022-11-20 20:10:15,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:15,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2022-11-20 20:10:15,381 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 20:10:15,382 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 2 case distinctions, treesize of input 40 treesize of output 23 [2022-11-20 20:10:15,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:15,393 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 23 treesize of output 17 [2022-11-20 20:10:15,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:15,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-20 20:10:15,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:15,473 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 9 treesize of output 3 [2022-11-20 20:10:15,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:15,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:15,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-20 20:10:15,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:15,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-20 20:10:15,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:15,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:15,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-20 20:10:15,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:15,582 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 9 treesize of output 3 [2022-11-20 20:10:15,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:15,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:15,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 18 [2022-11-20 20:10:15,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:15,666 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 20:10:15,666 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 42 treesize of output 28 [2022-11-20 20:10:15,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:15,692 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 20:10:15,692 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 42 treesize of output 32 [2022-11-20 20:10:15,744 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:15,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:15,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-20 20:10:15,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:15,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-20 20:10:15,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:15,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-11-20 20:10:15,850 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:15,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:15,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:15,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:15,861 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:10:15,861 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 36 treesize of output 23 [2022-11-20 20:10:15,877 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:15,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:15,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:15,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:15,888 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:10:15,888 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 36 treesize of output 23 [2022-11-20 20:10:15,902 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 13 treesize of output 9 [2022-11-20 20:10:16,133 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-20 20:10:16,134 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 132 [2022-11-20 20:10:16,168 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-20 20:10:16,168 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 128 [2022-11-20 20:10:16,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 13 treesize of output 9 [2022-11-20 20:10:16,437 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-11-20 20:10:16,587 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:10:21,349 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '648#(and (<= |ULTIMATE.start_dll_circular_get_data_at_#res#1| 2147483647) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| |ULTIMATE.start_dll_circular_get_data_at_~index#1|) (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= 0 (+ 2147483648 |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) (= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (not (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|) (= |#NULL.offset| 0) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |#NULL.base| 0) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (+ 8 |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|)) |ULTIMATE.start_dll_circular_get_data_at_#res#1|))' at error location [2022-11-20 20:10:21,349 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:10:21,350 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:10:21,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 35 [2022-11-20 20:10:21,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146133729] [2022-11-20 20:10:21,350 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:10:21,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-20 20:10:21,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:10:21,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-20 20:10:21,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=2870, Unknown=4, NotChecked=444, Total=3540 [2022-11-20 20:10:21,353 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 35 states, 32 states have (on average 1.09375) internal successors, (35), 30 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-20 20:10:22,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:10:22,345 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2022-11-20 20:10:22,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 20:10:22,346 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 1.09375) internal successors, (35), 30 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 23 [2022-11-20 20:10:22,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:10:22,348 INFO L225 Difference]: With dead ends: 48 [2022-11-20 20:10:22,348 INFO L226 Difference]: Without dead ends: 46 [2022-11-20 20:10:22,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=340, Invalid=3829, Unknown=7, NotChecked=516, Total=4692 [2022-11-20 20:10:22,351 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 97 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 20:10:22,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 159 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 452 Invalid, 0 Unknown, 44 Unchecked, 0.5s Time] [2022-11-20 20:10:22,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-20 20:10:22,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2022-11-20 20:10:22,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 20:10:22,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2022-11-20 20:10:22,371 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 47 transitions. Word has length 23 [2022-11-20 20:10:22,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:10:22,371 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 47 transitions. [2022-11-20 20:10:22,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 1.09375) internal successors, (35), 30 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-20 20:10:22,372 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2022-11-20 20:10:22,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 20:10:22,372 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:10:22,373 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:10:22,387 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 20:10:22,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:10:22,580 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:10:22,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:10:22,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1657540567, now seen corresponding path program 1 times [2022-11-20 20:10:22,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:10:22,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914625192] [2022-11-20 20:10:22,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:10:22,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:10:22,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:10:22,677 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 20:10:22,677 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:10:22,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914625192] [2022-11-20 20:10:22,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914625192] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:10:22,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:10:22,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 20:10:22,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920861367] [2022-11-20 20:10:22,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:10:22,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:10:22,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:10:22,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:10:22,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:10:22,680 INFO L87 Difference]: Start difference. First operand 34 states and 47 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 20:10:22,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:10:22,753 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-11-20 20:10:22,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:10:22,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-11-20 20:10:22,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:10:22,757 INFO L225 Difference]: With dead ends: 45 [2022-11-20 20:10:22,757 INFO L226 Difference]: Without dead ends: 40 [2022-11-20 20:10:22,757 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-20 20:10:22,759 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 9 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 20:10:22,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 33 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 20:10:22,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-20 20:10:22,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2022-11-20 20:10:22,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 20:10:22,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-11-20 20:10:22,829 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 24 [2022-11-20 20:10:22,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:10:22,829 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2022-11-20 20:10:22,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 20:10:22,830 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-11-20 20:10:22,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 20:10:22,830 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:10:22,831 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:10:22,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 20:10:22,831 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:10:22,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:10:22,832 INFO L85 PathProgramCache]: Analyzing trace with hash -278510040, now seen corresponding path program 3 times [2022-11-20 20:10:22,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:10:22,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289304187] [2022-11-20 20:10:22,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:10:22,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:10:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:10:22,990 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 20:10:22,990 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:10:22,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289304187] [2022-11-20 20:10:22,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289304187] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:10:22,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869890002] [2022-11-20 20:10:22,991 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 20:10:22,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:10:22,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:10:22,993 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:10:23,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 20:10:23,168 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 20:10:23,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:10:23,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 20:10:23,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:10:23,203 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 20:10:23,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:10:23,239 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 20:10:23,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869890002] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:10:23,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1323982738] [2022-11-20 20:10:23,246 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-20 20:10:23,247 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:10:23,247 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:10:23,247 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:10:23,248 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:10:23,273 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-20 20:10:23,279 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-20 20:10:23,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:23,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:23,295 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-20 20:10:23,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:23,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:23,308 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-20 20:10:23,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:23,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:23,337 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 21 treesize of output 26 [2022-11-20 20:10:23,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:23,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:10:23,671 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 7 treesize of output 3 [2022-11-20 20:10:23,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:23,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:10:23,701 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:23,703 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:23,705 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:23,709 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:23,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:23,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:23,958 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 7 treesize of output 3 [2022-11-20 20:10:23,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:10:23,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:10:23,992 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:23,994 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:23,996 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:24,089 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:24,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:24,100 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 209 [2022-11-20 20:10:24,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:24,116 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:24,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:24,118 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:24,120 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:24,149 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-20 20:10:24,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 332 treesize of output 338 [2022-11-20 20:10:24,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:24,170 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:24,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:24,173 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:24,174 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:24,175 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:24,192 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-20 20:10:24,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 344 treesize of output 243 [2022-11-20 20:10:24,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:24,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 13 [2022-11-20 20:10:24,269 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-20 20:10:24,269 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 142 treesize of output 113 [2022-11-20 20:10:24,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:24,281 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 99 treesize of output 73 [2022-11-20 20:10:24,301 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 20:10:24,302 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 2 case distinctions, treesize of input 34 treesize of output 17 [2022-11-20 20:10:24,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:24,314 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 17 treesize of output 11 [2022-11-20 20:10:24,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:24,512 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 7 treesize of output 3 [2022-11-20 20:10:24,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:24,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:10:24,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:10:24,550 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:24,552 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:24,554 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:24,556 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:24,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:24,741 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 9 treesize of output 3 [2022-11-20 20:10:24,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:24,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-20 20:10:24,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:24,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:24,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-20 20:10:24,784 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:24,786 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:24,788 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:24,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:24,836 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:24,846 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-20 20:10:24,846 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 44 treesize of output 30 [2022-11-20 20:10:24,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:24,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:24,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:24,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 20 [2022-11-20 20:10:24,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:24,877 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:24,890 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-20 20:10:24,890 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 44 treesize of output 34 [2022-11-20 20:10:24,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:24,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-11-20 20:10:24,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:24,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-20 20:10:24,985 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:24,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:24,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-20 20:10:25,028 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:25,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:25,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:25,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:25,037 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:10:25,038 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 36 treesize of output 23 [2022-11-20 20:10:25,049 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 13 treesize of output 9 [2022-11-20 20:10:25,065 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:25,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:25,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:25,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:25,074 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:10:25,074 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 36 treesize of output 23 [2022-11-20 20:10:25,183 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 19 treesize of output 1 [2022-11-20 20:10:25,190 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 13 treesize of output 9 [2022-11-20 20:10:25,200 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 19 treesize of output 1 [2022-11-20 20:10:25,296 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 13 treesize of output 9 [2022-11-20 20:10:25,304 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 19 treesize of output 1 [2022-11-20 20:10:25,314 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 19 treesize of output 1 [2022-11-20 20:10:25,503 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-11-20 20:10:25,645 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:10:28,986 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1113#(and (<= |ULTIMATE.start_dll_circular_get_data_at_#res#1| 2147483647) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| |ULTIMATE.start_dll_circular_get_data_at_~index#1|) (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= 0 (+ 2147483648 |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) (= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (not (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|) (= |#NULL.offset| 0) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |#NULL.base| 0) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (+ 8 |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|)) |ULTIMATE.start_dll_circular_get_data_at_#res#1|))' at error location [2022-11-20 20:10:28,986 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:10:28,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:10:28,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2022-11-20 20:10:28,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301997183] [2022-11-20 20:10:28,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:10:28,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 20:10:28,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:10:28,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 20:10:28,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2022-11-20 20:10:28,988 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 20:10:29,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:10:29,167 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2022-11-20 20:10:29,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 20:10:29,168 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-11-20 20:10:29,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:10:29,172 INFO L225 Difference]: With dead ends: 55 [2022-11-20 20:10:29,172 INFO L226 Difference]: Without dead ends: 46 [2022-11-20 20:10:29,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2022-11-20 20:10:29,174 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 57 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:10:29,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 41 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:10:29,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-20 20:10:29,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38. [2022-11-20 20:10:29,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 20:10:29,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2022-11-20 20:10:29,204 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 24 [2022-11-20 20:10:29,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:10:29,205 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2022-11-20 20:10:29,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 20:10:29,205 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2022-11-20 20:10:29,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 20:10:29,207 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:10:29,207 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:10:29,218 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 20:10:29,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-20 20:10:29,418 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:10:29,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:10:29,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1824430642, now seen corresponding path program 4 times [2022-11-20 20:10:29,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:10:29,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252228925] [2022-11-20 20:10:29,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:10:29,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:10:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:10:29,546 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 20:10:29,546 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:10:29,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252228925] [2022-11-20 20:10:29,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252228925] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:10:29,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500047701] [2022-11-20 20:10:29,547 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 20:10:29,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:10:29,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:10:29,548 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:10:29,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 20:10:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:10:29,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 20:10:29,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:10:29,758 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 20:10:29,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:10:29,801 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 20:10:29,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500047701] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:10:29,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [937787219] [2022-11-20 20:10:29,805 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-20 20:10:29,805 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:10:29,806 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:10:29,806 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:10:29,806 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:10:29,824 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-20 20:10:29,828 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-20 20:10:29,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:29,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:29,840 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-20 20:10:29,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:29,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:29,853 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 21 treesize of output 26 [2022-11-20 20:10:29,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:29,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:29,862 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-20 20:10:30,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:30,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-20 20:10:30,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:30,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:30,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:30,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-20 20:10:30,143 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 9 treesize of output 3 [2022-11-20 20:10:30,153 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:30,155 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:30,157 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:30,159 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:30,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:30,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:30,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:10:30,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:10:30,313 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 7 treesize of output 3 [2022-11-20 20:10:30,324 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:30,325 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:30,328 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:30,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:30,395 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 20:10:30,396 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 42 treesize of output 32 [2022-11-20 20:10:30,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:30,423 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 20:10:30,424 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 42 treesize of output 28 [2022-11-20 20:10:30,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:30,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:30,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 18 [2022-11-20 20:10:30,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:30,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:30,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:10:30,677 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 7 treesize of output 3 [2022-11-20 20:10:30,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:10:30,698 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:30,700 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:30,701 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:30,703 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:30,866 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 7 treesize of output 3 [2022-11-20 20:10:30,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:30,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:10:30,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:10:30,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:30,911 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:30,913 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:30,915 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:30,917 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:30,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:30,973 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 20:10:30,973 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 42 treesize of output 28 [2022-11-20 20:10:30,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:30,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:30,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 18 [2022-11-20 20:10:31,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:31,014 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 20:10:31,014 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 42 treesize of output 32 [2022-11-20 20:10:31,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:31,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-11-20 20:10:31,066 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:31,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:31,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-20 20:10:31,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:31,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-20 20:10:31,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 13 treesize of output 9 [2022-11-20 20:10:31,124 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:31,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:31,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:31,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:31,133 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:10:31,133 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 36 treesize of output 23 [2022-11-20 20:10:31,146 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:31,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:31,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:31,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:31,155 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:10:31,155 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 36 treesize of output 23 [2022-11-20 20:10:31,270 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 19 treesize of output 1 [2022-11-20 20:10:31,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 19 treesize of output 1 [2022-11-20 20:10:31,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 13 treesize of output 9 [2022-11-20 20:10:31,403 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 19 treesize of output 1 [2022-11-20 20:10:31,416 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 13 treesize of output 9 [2022-11-20 20:10:31,426 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 19 treesize of output 1 [2022-11-20 20:10:31,670 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-11-20 20:10:31,808 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:10:35,284 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1448#(and (<= |ULTIMATE.start_dll_circular_get_data_at_#res#1| 2147483647) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| |ULTIMATE.start_dll_circular_get_data_at_~index#1|) (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= 0 (+ 2147483648 |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) (= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (not (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|) (= |#NULL.offset| 0) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |#NULL.base| 0) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (+ 8 |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|)) |ULTIMATE.start_dll_circular_get_data_at_#res#1|))' at error location [2022-11-20 20:10:35,285 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:10:35,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:10:35,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-11-20 20:10:35,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904152356] [2022-11-20 20:10:35,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:10:35,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 20:10:35,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:10:35,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 20:10:35,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2022-11-20 20:10:35,287 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 20:10:35,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:10:35,439 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-11-20 20:10:35,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 20:10:35,440 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2022-11-20 20:10:35,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:10:35,443 INFO L225 Difference]: With dead ends: 57 [2022-11-20 20:10:35,443 INFO L226 Difference]: Without dead ends: 38 [2022-11-20 20:10:35,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2022-11-20 20:10:35,446 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:10:35,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 54 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:10:35,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-20 20:10:35,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2022-11-20 20:10:35,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 20:10:35,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-11-20 20:10:35,481 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 25 [2022-11-20 20:10:35,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:10:35,482 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-11-20 20:10:35,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 20:10:35,482 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-11-20 20:10:35,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 20:10:35,492 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:10:35,492 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:10:35,503 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 20:10:35,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:10:35,699 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:10:35,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:10:35,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1431804676, now seen corresponding path program 1 times [2022-11-20 20:10:35,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:10:35,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838444212] [2022-11-20 20:10:35,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:10:35,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:10:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:10:35,802 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 20:10:35,802 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:10:35,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838444212] [2022-11-20 20:10:35,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838444212] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:10:35,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368817910] [2022-11-20 20:10:35,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:10:35,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:10:35,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:10:35,807 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:10:35,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 20:10:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:10:36,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 20:10:36,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:10:36,021 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 20:10:36,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:10:36,046 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 20:10:36,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368817910] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:10:36,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1354067779] [2022-11-20 20:10:36,049 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-20 20:10:36,050 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:10:36,050 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:10:36,050 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:10:36,051 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:10:36,070 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-20 20:10:36,075 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-20 20:10:36,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:36,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:36,093 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 21 treesize of output 26 [2022-11-20 20:10:36,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:36,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:36,102 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-20 20:10:36,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:36,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:36,109 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-20 20:10:36,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:36,352 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 7 treesize of output 3 [2022-11-20 20:10:36,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:36,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:10:36,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:10:36,394 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:36,395 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:36,397 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:36,590 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 7 treesize of output 3 [2022-11-20 20:10:36,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:10:36,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:10:36,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:36,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:36,674 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:36,676 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:36,678 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:36,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:36,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:36,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:36,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2022-11-20 20:10:36,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:36,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:36,734 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:36,746 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 20:10:36,746 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 44 treesize of output 34 [2022-11-20 20:10:36,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:36,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:36,763 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:36,773 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 20:10:36,773 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 44 treesize of output 30 [2022-11-20 20:10:36,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:10:36,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:10:36,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:36,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:37,003 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 7 treesize of output 3 [2022-11-20 20:10:37,025 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:37,027 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:37,029 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:37,036 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:37,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:37,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:37,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-20 20:10:37,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:37,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-20 20:10:37,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:37,276 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 9 treesize of output 3 [2022-11-20 20:10:37,287 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:37,289 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:37,291 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:37,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:37,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:37,343 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:37,356 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 20:10:37,357 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 44 treesize of output 30 [2022-11-20 20:10:37,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:37,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:37,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:37,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2022-11-20 20:10:37,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:37,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:37,393 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:37,407 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 20:10:37,407 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 44 treesize of output 34 [2022-11-20 20:10:37,445 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:37,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:37,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-20 20:10:37,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:37,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-20 20:10:37,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:37,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-11-20 20:10:37,514 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 13 treesize of output 9 [2022-11-20 20:10:37,526 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:37,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:37,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:37,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:37,535 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:10:37,536 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 36 treesize of output 23 [2022-11-20 20:10:37,551 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:37,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:37,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:37,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:37,561 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:10:37,562 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 36 treesize of output 23 [2022-11-20 20:10:37,679 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 13 treesize of output 9 [2022-11-20 20:10:37,688 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 19 treesize of output 1 [2022-11-20 20:10:37,697 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 19 treesize of output 1 [2022-11-20 20:10:37,835 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 19 treesize of output 1 [2022-11-20 20:10:37,851 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 19 treesize of output 1 [2022-11-20 20:10:37,859 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 13 treesize of output 9 [2022-11-20 20:10:38,397 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-11-20 20:10:38,559 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:10:42,919 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1782#(and (<= |ULTIMATE.start_dll_circular_get_data_at_#res#1| 2147483647) (<= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |#NULL.base|) (= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| |ULTIMATE.start_dll_circular_get_data_at_~index#1|) (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= 0 (+ 2147483648 |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= 0 |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| 0) (not (< 0 |ULTIMATE.start_dll_circular_get_data_at_~index#1|)) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) (= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (not (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (<= |#NULL.base| 0) (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= 2 |ULTIMATE.start_main_~expected~0#1|) (<= 0 |#NULL.offset|) (<= 1 |ULTIMATE.start_main_~data~0#1|) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) (<= 0 |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (+ 8 |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|)) |ULTIMATE.start_dll_circular_get_data_at_#res#1|) (<= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| 0))' at error location [2022-11-20 20:10:42,919 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:10:42,919 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:10:42,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-11-20 20:10:42,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675638324] [2022-11-20 20:10:42,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:10:42,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 20:10:42,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:10:42,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 20:10:42,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-11-20 20:10:42,921 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 20:10:43,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:10:43,016 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-11-20 20:10:43,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:10:43,017 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-11-20 20:10:43,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:10:43,018 INFO L225 Difference]: With dead ends: 42 [2022-11-20 20:10:43,018 INFO L226 Difference]: Without dead ends: 39 [2022-11-20 20:10:43,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2022-11-20 20:10:43,019 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:10:43,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 43 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:10:43,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-20 20:10:43,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2022-11-20 20:10:43,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 20:10:43,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-11-20 20:10:43,035 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 26 [2022-11-20 20:10:43,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:10:43,035 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-11-20 20:10:43,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 20:10:43,036 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-11-20 20:10:43,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 20:10:43,036 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:10:43,036 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:10:43,043 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 20:10:43,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:10:43,243 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:10:43,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:10:43,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1438645522, now seen corresponding path program 1 times [2022-11-20 20:10:43,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:10:43,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238658178] [2022-11-20 20:10:43,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:10:43,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:10:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:10:45,362 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:10:45,362 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:10:45,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238658178] [2022-11-20 20:10:45,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238658178] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:10:45,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898036141] [2022-11-20 20:10:45,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:10:45,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:10:45,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:10:45,364 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:10:45,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 20:10:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:10:45,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 101 conjunts are in the unsatisfiable core [2022-11-20 20:10:45,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:10:45,628 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-20 20:10:45,881 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 20:10:45,882 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-20 20:10:45,948 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-20 20:10:45,951 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-20 20:10:46,026 INFO L321 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2022-11-20 20:10:46,026 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 99 [2022-11-20 20:10:46,032 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 85 treesize of output 71 [2022-11-20 20:10:46,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-11-20 20:10:46,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 23 [2022-11-20 20:10:46,053 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 9 [2022-11-20 20:10:46,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:46,189 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 30 treesize of output 25 [2022-11-20 20:10:46,413 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 20:10:46,414 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 64 treesize of output 59 [2022-11-20 20:10:46,425 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 27 treesize of output 19 [2022-11-20 20:10:46,429 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 30 treesize of output 32 [2022-11-20 20:10:46,780 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 58 treesize of output 38 [2022-11-20 20:10:46,784 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 34 treesize of output 22 [2022-11-20 20:10:46,852 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 28 treesize of output 10 [2022-11-20 20:10:46,905 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:10:46,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:10:47,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 76 treesize of output 56 [2022-11-20 20:10:47,319 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 76 treesize of output 56 [2022-11-20 20:10:47,528 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:10:47,529 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 38 treesize of output 37 [2022-11-20 20:10:47,533 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 11 [2022-11-20 20:10:48,116 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:10:48,117 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 68 treesize of output 82 [2022-11-20 20:10:48,148 INFO L321 Elim1Store]: treesize reduction 10, result has 70.6 percent of original size [2022-11-20 20:10:48,148 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-20 20:10:48,177 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-20 20:10:48,177 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 84 [2022-11-20 20:10:48,195 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:10:48,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2022-11-20 20:10:48,234 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 6 treesize of output 4 [2022-11-20 20:10:48,280 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 133 treesize of output 129 [2022-11-20 20:10:48,286 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:48,289 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 97 treesize of output 95 [2022-11-20 20:10:48,292 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:48,295 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 97 treesize of output 93 [2022-11-20 20:10:48,298 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:48,301 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 73 treesize of output 71 [2022-11-20 20:10:48,319 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:48,321 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 6 treesize of output 4 [2022-11-20 20:10:48,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898036141] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:10:48,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [516262983] [2022-11-20 20:10:48,517 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-20 20:10:48,518 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:10:48,518 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:10:48,518 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:10:48,518 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:10:48,536 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-20 20:10:48,542 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-20 20:10:48,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:48,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:48,559 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 21 treesize of output 26 [2022-11-20 20:10:48,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:48,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:48,568 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-20 20:10:48,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:48,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:48,577 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-20 20:10:48,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:48,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:48,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:10:48,707 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 7 treesize of output 3 [2022-11-20 20:10:48,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:10:48,756 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 7 treesize of output 3 [2022-11-20 20:10:48,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:48,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:10:48,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:48,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:10:48,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:48,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:48,833 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:48,845 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 20:10:48,846 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 44 treesize of output 34 [2022-11-20 20:10:48,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:48,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:48,861 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:48,872 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 20:10:48,873 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 44 treesize of output 30 [2022-11-20 20:10:48,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:48,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:48,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:48,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2022-11-20 20:10:48,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:10:48,960 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 7 treesize of output 3 [2022-11-20 20:10:48,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:48,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:48,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:10:49,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:10:49,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:49,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:10:49,063 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 7 treesize of output 3 [2022-11-20 20:10:49,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:49,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:49,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:49,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 18 [2022-11-20 20:10:49,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:49,151 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 20:10:49,152 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 42 treesize of output 32 [2022-11-20 20:10:49,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:49,175 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 20:10:49,176 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 42 treesize of output 28 [2022-11-20 20:10:49,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:49,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-11-20 20:10:49,242 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:49,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:49,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-20 20:10:49,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:49,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-20 20:10:49,356 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:49,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:49,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:49,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:49,367 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:10:49,367 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 36 treesize of output 23 [2022-11-20 20:10:49,384 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:49,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:49,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:49,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:49,393 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:10:49,393 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 36 treesize of output 23 [2022-11-20 20:10:49,408 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 13 treesize of output 9 [2022-11-20 20:10:49,576 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 13 treesize of output 9 [2022-11-20 20:10:49,613 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-20 20:10:49,614 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 132 [2022-11-20 20:10:49,647 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-20 20:10:49,648 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 128 [2022-11-20 20:10:50,019 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-11-20 20:10:50,164 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:10:55,954 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2117#(and (<= |ULTIMATE.start_dll_circular_get_data_at_#res#1| 2147483647) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= 0 (+ 2147483648 |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (<= 0 |ULTIMATE.start_dll_circular_get_data_at_#in~index#1|) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (not (< 0 |ULTIMATE.start_dll_circular_get_data_at_~index#1|)) (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (not (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|) (= |#NULL.offset| 0) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= 2 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= 0 |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |#NULL.base| 0) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (+ 8 |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|)) |ULTIMATE.start_dll_circular_get_data_at_#res#1|) (<= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| 0))' at error location [2022-11-20 20:10:55,954 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:10:55,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:10:55,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 42 [2022-11-20 20:10:55,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12276930] [2022-11-20 20:10:55,955 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:10:55,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-20 20:10:55,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:10:55,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-20 20:10:55,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=4427, Unknown=26, NotChecked=0, Total=4692 [2022-11-20 20:10:55,957 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 42 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-20 20:10:58,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:10:58,573 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-11-20 20:10:58,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 20:10:58,574 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 27 [2022-11-20 20:10:58,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:10:58,575 INFO L225 Difference]: With dead ends: 48 [2022-11-20 20:10:58,575 INFO L226 Difference]: Without dead ends: 45 [2022-11-20 20:10:58,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1359 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=480, Invalid=6803, Unknown=27, NotChecked=0, Total=7310 [2022-11-20 20:10:58,578 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 135 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 20:10:58,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 213 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 20:10:58,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-20 20:10:58,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2022-11-20 20:10:58,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 20:10:58,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2022-11-20 20:10:58,607 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 27 [2022-11-20 20:10:58,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:10:58,608 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2022-11-20 20:10:58,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-20 20:10:58,608 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-11-20 20:10:58,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-20 20:10:58,609 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:10:58,609 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:10:58,622 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 20:10:58,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 20:10:58,817 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:10:58,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:10:58,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1650711748, now seen corresponding path program 2 times [2022-11-20 20:10:58,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:10:58,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049218966] [2022-11-20 20:10:58,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:10:58,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:10:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:10:58,959 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 20:10:58,959 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:10:58,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049218966] [2022-11-20 20:10:58,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049218966] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:10:58,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367664071] [2022-11-20 20:10:58,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:10:58,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:10:58,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:10:58,962 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:10:58,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 20:10:59,244 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 20:10:59,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:10:59,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 20:10:59,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:10:59,301 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-20 20:10:59,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:10:59,366 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-20 20:10:59,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367664071] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:10:59,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1010242380] [2022-11-20 20:10:59,374 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-20 20:10:59,374 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:10:59,374 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:10:59,375 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:10:59,375 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:10:59,392 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-20 20:10:59,395 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-20 20:10:59,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:59,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:59,411 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 21 treesize of output 26 [2022-11-20 20:10:59,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:59,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:59,418 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-20 20:10:59,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:59,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:59,425 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-20 20:10:59,671 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 7 treesize of output 3 [2022-11-20 20:10:59,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:10:59,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:59,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:59,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:10:59,721 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:59,723 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:59,725 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:10:59,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:10:59,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:10:59,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:11:00,005 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 7 treesize of output 3 [2022-11-20 20:11:00,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:11:00,030 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:11:00,031 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:11:00,033 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:11:00,035 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:11:00,103 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:11:00,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:00,109 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 209 [2022-11-20 20:11:00,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:00,124 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:11:00,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:00,126 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:11:00,127 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:11:00,157 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-20 20:11:00,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 332 treesize of output 343 [2022-11-20 20:11:00,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:00,179 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:11:00,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:00,183 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:11:00,184 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:11:00,185 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:11:00,204 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-20 20:11:00,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 344 treesize of output 248 [2022-11-20 20:11:00,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:00,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 13 [2022-11-20 20:11:00,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:11:00,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:11:00,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:00,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-20 20:11:00,528 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 9 treesize of output 3 [2022-11-20 20:11:00,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:00,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-20 20:11:00,549 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:11:00,551 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:11:00,553 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:11:00,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:11:00,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:11:00,789 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 7 treesize of output 3 [2022-11-20 20:11:00,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:11:00,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:11:00,827 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:11:00,829 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:11:00,831 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:11:00,835 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:11:00,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:00,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:00,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:00,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2022-11-20 20:11:00,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:00,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:00,921 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:11:00,935 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 20:11:00,935 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 44 treesize of output 34 [2022-11-20 20:11:00,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:00,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:00,951 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:11:00,962 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 20:11:00,963 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 44 treesize of output 30 [2022-11-20 20:11:00,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:00,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-20 20:11:01,006 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:11:01,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:01,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-20 20:11:01,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:01,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-11-20 20:11:01,069 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 13 treesize of output 9 [2022-11-20 20:11:01,082 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:11:01,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:01,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:01,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:01,092 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:11:01,092 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 36 treesize of output 23 [2022-11-20 20:11:01,109 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:11:01,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:01,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:01,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:01,129 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:11:01,129 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 36 treesize of output 23 [2022-11-20 20:11:01,260 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 13 treesize of output 9 [2022-11-20 20:11:01,274 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 19 treesize of output 1 [2022-11-20 20:11:01,283 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 19 treesize of output 1 [2022-11-20 20:11:01,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 19 treesize of output 1 [2022-11-20 20:11:01,396 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 19 treesize of output 1 [2022-11-20 20:11:01,403 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 13 treesize of output 9 [2022-11-20 20:11:01,781 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-11-20 20:11:01,916 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:11:05,648 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2484#(and (<= |ULTIMATE.start_dll_circular_get_data_at_#res#1| 2147483647) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= 0 (+ 2147483648 |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (<= 0 |ULTIMATE.start_dll_circular_get_data_at_#in~index#1|) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (not (< 0 |ULTIMATE.start_dll_circular_get_data_at_~index#1|)) (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (not (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|) (= |#NULL.offset| 0) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= 2 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= 0 |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |#NULL.base| 0) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (+ 8 |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|)) |ULTIMATE.start_dll_circular_get_data_at_#res#1|) (<= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| 0))' at error location [2022-11-20 20:11:05,648 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:11:05,648 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:11:05,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-11-20 20:11:05,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610597430] [2022-11-20 20:11:05,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:11:05,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 20:11:05,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:11:05,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 20:11:05,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-11-20 20:11:05,650 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 20:11:05,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:11:05,823 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2022-11-20 20:11:05,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 20:11:05,824 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-11-20 20:11:05,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:11:05,825 INFO L225 Difference]: With dead ends: 46 [2022-11-20 20:11:05,825 INFO L226 Difference]: Without dead ends: 30 [2022-11-20 20:11:05,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2022-11-20 20:11:05,826 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 34 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:11:05,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 31 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:11:05,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-20 20:11:05,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-11-20 20:11:05,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 20:11:05,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-11-20 20:11:05,839 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 28 [2022-11-20 20:11:05,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:11:05,839 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-11-20 20:11:05,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 20:11:05,839 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-11-20 20:11:05,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 20:11:05,840 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:11:05,840 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:11:05,846 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-20 20:11:06,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-20 20:11:06,043 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:11:06,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:11:06,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1942414012, now seen corresponding path program 5 times [2022-11-20 20:11:06,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:11:06,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542816522] [2022-11-20 20:11:06,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:11:06,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:11:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:11:06,169 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 20:11:06,171 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:11:06,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542816522] [2022-11-20 20:11:06,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542816522] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:11:06,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618526865] [2022-11-20 20:11:06,172 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:11:06,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:11:06,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:11:06,175 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:11:06,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 20:11:06,533 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 20:11:06,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:11:06,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 20:11:06,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:11:06,558 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 20:11:06,559 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:11:06,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618526865] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:11:06,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 20:11:06,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-11-20 20:11:06,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670495289] [2022-11-20 20:11:06,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:11:06,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:11:06,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:11:06,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:11:06,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:11:06,561 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 20:11:06,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:11:06,588 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-11-20 20:11:06,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 20:11:06,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-11-20 20:11:06,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:11:06,590 INFO L225 Difference]: With dead ends: 31 [2022-11-20 20:11:06,590 INFO L226 Difference]: Without dead ends: 0 [2022-11-20 20:11:06,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 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-20 20:11:06,591 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 20:11:06,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 20:11:06,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-20 20:11:06,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-20 20:11:06,593 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-20 20:11:06,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-20 20:11:06,593 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2022-11-20 20:11:06,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:11:06,593 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-20 20:11:06,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 20:11:06,594 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-20 20:11:06,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-20 20:11:06,597 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 20:11:06,611 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 20:11:06,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-20 20:11:06,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-20 20:11:11,200 INFO L895 garLoopResultBuilder]: At program point L638(lines 626 645) the Hoare annotation is: false [2022-11-20 20:11:11,200 INFO L895 garLoopResultBuilder]: At program point L589(line 589) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 12) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= (select .cse0 0) 0) (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_dll_circular_create_#in~data#1|) (= |ULTIMATE.start_dll_circular_create_#in~len#1| |ULTIMATE.start_main_~len~0#1|) (<= |#NULL.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) |ULTIMATE.start_dll_circular_create_~data#1|) (< |ULTIMATE.start_dll_circular_create_~head~0#1.base| |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select .cse0 4) 0) (= |ULTIMATE.start_dll_circular_create_#in~len#1| |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select .cse1 4) 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 0 |#NULL.offset|) (= (select .cse1 0) 0) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-20 20:11:11,200 INFO L899 garLoopResultBuilder]: For program point L589-1(line 589) no Hoare annotation was computed. [2022-11-20 20:11:11,201 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-20 20:11:11,201 INFO L895 garLoopResultBuilder]: At program point L631-3(lines 631 634) the Hoare annotation is: (let ((.cse23 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse26 (select .cse23 0)) (.cse2 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (.cse0 (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|)) (.cse1 (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|)) (.cse3 (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse4 (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1)) (.cse6 (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse11 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse12 (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|)) (.cse14 (= |#NULL.offset| 0)) (.cse21 (= |#NULL.base| 0)) (.cse27 (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse5 (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse24 (let ((.cse36 (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4))) (let ((.cse28 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (.cse29 (= (select .cse5 .cse36) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse30 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse31 (= (select .cse27 .cse36) |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse32 (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse33 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| |ULTIMATE.start_main_~s~0#1.offset|)) (.cse34 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse35 (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (or (and .cse28 .cse29 (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 .cse1 .cse3 .cse4 .cse6 .cse30 .cse31 .cse32 .cse11 .cse12 .cse33 .cse14 .cse34 .cse35 .cse21) (and (= |ULTIMATE.start_dll_circular_update_at_#in~data#1| |ULTIMATE.start_dll_circular_update_at_~data#1|) .cse28 .cse29 .cse0 .cse1 .cse3 .cse4 .cse6 (= (+ |ULTIMATE.start_dll_circular_update_at_#in~index#1| |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_main_~new_data~0#1|) .cse30 (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) |ULTIMATE.start_dll_circular_update_at_~data#1|) .cse31 .cse32 (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~new_data~0#1|) .cse11 .cse12 .cse33 (= |ULTIMATE.start_dll_circular_update_at_#in~index#1| |ULTIMATE.start_dll_circular_update_at_~index#1|) (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_dll_circular_update_at_#in~head#1.base|) (= |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (= |ULTIMATE.start_dll_circular_update_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) .cse14 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset|) .cse34 (= (+ |ULTIMATE.start_main_~new_data~0#1| 1) (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|)) .cse35 (= |ULTIMATE.start_dll_circular_update_at_#in~data#1| |ULTIMATE.start_main_~new_data~0#1|) .cse21))))) (.cse7 (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| (select .cse27 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (.cse8 (= .cse2 0)) (.cse10 (not (= .cse26 0))) (.cse13 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse15 (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|)) (.cse17 (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2)) (.cse25 (<= |ULTIMATE.start_dll_circular_create_~len#1| 1)) (.cse18 (<= |ULTIMATE.start_dll_circular_create_~data#1| 1)) (.cse19 (<= 0 |#StackHeapBarrier|)) (.cse20 (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse22 (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (or (let ((.cse9 (select .cse23 |ULTIMATE.start_main_~s~0#1.offset|)) (.cse16 (+ |ULTIMATE.start_main_~len~0#1| 1))) (and (not (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) .cse0 (<= |ULTIMATE.start_dll_circular_create_~len#1| 2) .cse1 (= .cse2 |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) .cse3 .cse4 (= (select .cse5 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) .cse6 .cse7 .cse8 (= .cse9 |ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse10 (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse11 .cse12 .cse13 .cse14 .cse15 (= |ULTIMATE.start_dll_circular_update_at_~data#1| .cse16) .cse17 (= (select (select |#memory_int| .cse9) (+ .cse2 8)) .cse16) .cse18 .cse19 (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 8))) .cse20 .cse21 .cse22)) (and .cse24 .cse7 (= |ULTIMATE.start_main_~i~0#1| 1) .cse8 .cse10 .cse13 .cse15 .cse17 .cse25 .cse18 .cse19 .cse20 .cse22) (and .cse24 .cse7 .cse8 .cse10 .cse13 .cse15 .cse17 .cse25 (exists ((v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (and (= (select v_DerPreprocessor_9 4) (select .cse23 4)) (= (select |#memory_$Pointer$.base| .cse26) (select (store (store (store (store |#memory_$Pointer$.base| .cse26 v_DerPreprocessor_8) |ULTIMATE.start_main_~s~0#1.base| v_DerPreprocessor_9) .cse26 v_DerPreprocessor_8) |ULTIMATE.start_main_~s~0#1.base| v_DerPreprocessor_9) .cse26)))) .cse18 .cse19 .cse20 .cse22))))) [2022-11-20 20:11:11,202 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 611) no Hoare annotation was computed. [2022-11-20 20:11:11,202 INFO L899 garLoopResultBuilder]: For program point L602(lines 602 610) no Hoare annotation was computed. [2022-11-20 20:11:11,202 INFO L895 garLoopResultBuilder]: At program point L635-3(lines 635 640) the Hoare annotation is: (let ((.cse28 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse30 (+ |ULTIMATE.start_main_~len~0#1| 1)) (.cse22 (select .cse28 |ULTIMATE.start_main_~s~0#1.offset|)) (.cse29 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse18 (not (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (.cse0 (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|)) (.cse1 (<= |ULTIMATE.start_dll_circular_create_~len#1| 2)) (.cse2 (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|)) (.cse19 (= .cse29 |ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (.cse3 (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse4 (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse5 (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1)) (.cse20 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0)) (.cse6 (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse21 (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (.cse23 (= .cse29 0)) (.cse24 (= .cse22 |ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse7 (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 0)) (.cse8 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse9 (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|)) (.cse10 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse11 (= |#NULL.offset| 0)) (.cse12 (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|)) (.cse25 (= |ULTIMATE.start_dll_circular_update_at_~data#1| .cse30)) (.cse13 (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2)) (.cse26 (= (select (select |#memory_int| .cse22) (+ .cse29 8)) .cse30)) (.cse14 (<= |ULTIMATE.start_dll_circular_create_~data#1| 1)) (.cse15 (<= 0 |#StackHeapBarrier|)) (.cse16 (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse17 (= |#NULL.base| 0)) (.cse27 (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse19 .cse3 .cse4 .cse5 .cse20 .cse6 .cse21 (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 0) (not (= .cse22 0)) .cse23 .cse24 (not (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) .cse7 .cse8 .cse9 (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_dll_circular_update_at_~data#1|) .cse10 .cse11 .cse12 .cse25 .cse13 .cse26 .cse14 .cse15 .cse16 .cse17 .cse27) (and .cse18 (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 .cse1 .cse2 .cse19 .cse3 .cse4 .cse5 .cse20 .cse6 .cse21 .cse23 .cse24 (not (= (select .cse28 0) 0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse25 .cse13 .cse26 .cse14 .cse15 (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 8))) .cse16 (= |ULTIMATE.start_main_~s~0#1.offset| 0) .cse17 .cse27))))) [2022-11-20 20:11:11,203 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 643) no Hoare annotation was computed. [2022-11-20 20:11:11,203 INFO L895 garLoopResultBuilder]: At program point L586(line 586) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_dll_circular_create_#in~data#1|) (= 2 (select |#length| 1)) (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_dll_circular_create_#in~data#1|) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_dll_circular_create_#in~len#1| |ULTIMATE.start_dll_circular_create_~len#1|) (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select |#valid| 0) 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (= (select .cse0 1) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-20 20:11:11,203 INFO L899 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2022-11-20 20:11:11,203 INFO L902 garLoopResultBuilder]: At program point L644(lines 626 645) the Hoare annotation is: true [2022-11-20 20:11:11,203 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-20 20:11:11,204 INFO L895 garLoopResultBuilder]: At program point L620-2(lines 620 623) the Hoare annotation is: (let ((.cse27 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse28 (select .cse27 0)) (.cse33 (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 8)))) (.cse30 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse31 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse32 (= |#NULL.offset| 0)) (.cse34 (= |#NULL.base| 0)) (.cse36 (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse37 (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse35 (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|))) (let ((.cse9 (= |ULTIMATE.start_dll_circular_update_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|)) (.cse11 (= |ULTIMATE.start_dll_circular_update_at_#in~index#1| |ULTIMATE.start_dll_circular_update_at_~index#1|)) (.cse12 (= .cse35 |ULTIMATE.start_main_~new_data~0#1|)) (.cse13 (= |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (.cse14 (= |ULTIMATE.start_dll_circular_update_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse16 (let ((.cse46 (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4))) (let ((.cse38 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (.cse39 (= (select .cse37 .cse46) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse40 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse41 (= (select .cse36 .cse46) |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse42 (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse43 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| |ULTIMATE.start_main_~s~0#1.offset|)) (.cse44 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse45 (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (or (and .cse38 .cse39 .cse40 .cse41 .cse42 .cse30 .cse43 .cse31 .cse32 .cse44 .cse33 .cse45 .cse34) (and .cse38 .cse39 (= |ULTIMATE.start_main_~i~0#1| 0) .cse40 .cse41 .cse42 .cse30 .cse43 .cse31 .cse32 .cse44 .cse45 .cse34))))) (.cse17 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset|)) (.cse21 (<= |ULTIMATE.start_dll_circular_create_~len#1| 1)) (.cse24 (= |ULTIMATE.start_dll_circular_update_at_#in~data#1| |ULTIMATE.start_main_~new_data~0#1|)) (.cse0 (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|)) (.cse1 (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|)) (.cse2 (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse3 (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1)) (.cse4 (= (select .cse37 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0)) (.cse5 (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse6 (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| (select .cse36 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (.cse7 (not (= .cse28 0))) (.cse18 (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse8 (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|)) (.cse10 (= .cse35 |ULTIMATE.start_dll_circular_update_at_~data#1|)) (.cse15 (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|)) (.cse19 (= |ULTIMATE.start_dll_circular_update_at_~data#1| (+ |ULTIMATE.start_main_~len~0#1| 1))) (.cse20 (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2)) (.cse22 (<= |ULTIMATE.start_dll_circular_create_~data#1| 1)) (.cse23 (<= 0 |#StackHeapBarrier|)) (.cse25 (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse26 (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 (= |ULTIMATE.start_dll_circular_update_at_~index#1| 0) .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 (exists ((v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (and (= (select v_DerPreprocessor_9 4) (select .cse27 4)) (= (select |#memory_$Pointer$.base| .cse28) (select (store (store (store (store |#memory_$Pointer$.base| .cse28 v_DerPreprocessor_8) |ULTIMATE.start_main_~s~0#1.base| v_DerPreprocessor_9) .cse28 v_DerPreprocessor_8) |ULTIMATE.start_main_~s~0#1.base| v_DerPreprocessor_9) .cse28)))) .cse22 .cse23 .cse24 .cse25 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) .cse26) (let ((.cse29 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (and (not (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) .cse0 (<= |ULTIMATE.start_dll_circular_create_~len#1| 2) .cse1 (= .cse29 |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) .cse2 .cse3 .cse4 .cse5 .cse6 (= .cse29 0) (= (select .cse27 |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse7 (not .cse18) (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 0) .cse30 .cse8 .cse10 .cse31 .cse32 .cse15 .cse19 .cse20 .cse22 .cse23 .cse33 .cse25 .cse34 .cse26)))))) [2022-11-20 20:11:11,204 INFO L899 garLoopResultBuilder]: For program point L637(lines 637 639) no Hoare annotation was computed. [2022-11-20 20:11:11,205 INFO L902 garLoopResultBuilder]: At program point L604-2(lines 604 608) the Hoare annotation is: true [2022-11-20 20:11:11,205 INFO L895 garLoopResultBuilder]: At program point L588-2(lines 588 596) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse1 (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse3 (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse2 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse4 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse5 (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|)) (.cse7 (<= |ULTIMATE.start_dll_circular_create_~data#1| 1)) (.cse8 (= |#NULL.base| 0)) (.cse6 (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (or (and .cse0 (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 12) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= (select .cse1 0) 0) (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_dll_circular_create_#in~data#1|) (<= |#NULL.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) |ULTIMATE.start_dll_circular_create_~data#1|) (< |ULTIMATE.start_dll_circular_create_~head~0#1.base| |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select .cse1 4) 0) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_dll_circular_create_#in~len#1| |ULTIMATE.start_dll_circular_create_~len#1|) .cse2 (= (select .cse3 4) 0) .cse4 .cse5 (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) .cse6 (<= 0 |#NULL.offset|) (= (select .cse3 0) 0) .cse7 (< 0 |#StackHeapBarrier|) .cse8) (and (not (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0)) .cse0 (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (= (select .cse1 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| (select .cse3 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) .cse2 (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) .cse4 (= |#NULL.offset| 0) .cse5 (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) .cse7 (<= 0 |#StackHeapBarrier|) .cse8 (not .cse6)))) [2022-11-20 20:11:11,205 INFO L895 garLoopResultBuilder]: At program point L613-2(lines 613 616) the Hoare annotation is: (let ((.cse14 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse39 (+ |ULTIMATE.start_main_~len~0#1| 1)) (.cse37 (select .cse14 |ULTIMATE.start_main_~s~0#1.offset|)) (.cse38 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse0 (not (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (.cse2 (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|)) (.cse3 (<= |ULTIMATE.start_dll_circular_create_~len#1| 2)) (.cse4 (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|)) (.cse5 (= .cse38 |ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (.cse6 (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse7 (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse8 (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1)) (.cse9 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0)) (.cse10 (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse11 (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (.cse31 (not (= .cse37 0))) (.cse12 (= .cse38 0)) (.cse13 (= .cse37 |ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse34 (not (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|))) (.cse15 (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 0)) (.cse16 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse17 (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|)) (.cse35 (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_dll_circular_update_at_~data#1|)) (.cse18 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse19 (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| 0)) (.cse20 (= |#NULL.offset| 0)) (.cse21 (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|)) (.cse22 (= |ULTIMATE.start_dll_circular_update_at_~data#1| .cse39)) (.cse23 (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2)) (.cse24 (= (select (select |#memory_int| .cse37) (+ .cse38 8)) .cse39)) (.cse25 (<= |ULTIMATE.start_dll_circular_create_~data#1| 1)) (.cse26 (<= 0 |#StackHeapBarrier|)) (.cse27 (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse28 (= |#NULL.base| 0)) (.cse29 (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (.cse1 (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|))) (or (and .cse0 (= |ULTIMATE.start_main_~expected~0#1| (select .cse1 8)) (= |ULTIMATE.start_main_~i~0#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 0) .cse12 .cse13 (= 2 |ULTIMATE.start_main_~expected~0#1|) (not (= (select .cse14 0) 0)) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 8))) .cse27 (= |ULTIMATE.start_main_~s~0#1.offset| 0) .cse28 .cse29) (let ((.cse30 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|)) (.cse32 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|))) (let ((.cse33 (select (select |#memory_int| .cse30) (+ 8 .cse32)))) (and (<= 1 |ULTIMATE.start_dll_circular_get_data_at_~index#1|) .cse0 (not (= .cse30 0)) .cse2 .cse3 (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse31 (= 0 .cse32) (= .cse33 |ULTIMATE.start_main_~expected~0#1|) .cse12 .cse13 (not (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.base| .cse30)) .cse34 .cse15 .cse16 .cse17 .cse35 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 (= .cse33 3) .cse27 .cse28 .cse29))) (let ((.cse36 (select .cse1 (+ 8 |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|)))) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 0) (= .cse36 3) .cse31 .cse12 .cse13 .cse34 .cse15 .cse16 .cse17 .cse35 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (= .cse36 |ULTIMATE.start_main_~expected~0#1|) .cse25 .cse26 .cse27 (not (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.base| 0)) .cse28 .cse29)))))) [2022-11-20 20:11:11,206 INFO L899 garLoopResultBuilder]: For program point L577(lines 577 579) no Hoare annotation was computed. [2022-11-20 20:11:11,206 INFO L902 garLoopResultBuilder]: At program point L573(line 573) the Hoare annotation is: true [2022-11-20 20:11:11,206 INFO L895 garLoopResultBuilder]: At program point node_createENTRY(lines 575 584) the Hoare annotation is: (or (let ((.cse0 (not (= |#NULL.offset| 0))) (.cse1 (not (< 0 |#StackHeapBarrier|))) (.cse2 (not (= |#NULL.base| 0))) (.cse3 (not (= |node_create_#in~data#1| 1)))) (and (or .cse0 .cse1 .cse2 .cse3 (forall ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_5| Int)) (let ((.cse4 (select |old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_5|)) (.cse5 (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_5|))) (or (not (= (select .cse4 0) 0)) (not (= (select .cse4 4) 0)) (not (= (select |old(#length)| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_5|) 12)) (not (= (select .cse5 4) 0)) (not (= (select .cse5 0) 0)) (not (< |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_5| |#StackHeapBarrier|)) (not (= (select (select |old(#memory_int)| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_5|) 8) |node_create_#in~data#1|)) (= |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_5| 0) (not (= (select |old(#valid)| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_5|) 1)))))) (let ((.cse6 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) .cse0 .cse1 .cse2 .cse3 (not (= (select |old(#length)| 1) 2)) (not (= (select .cse6 0) 48)) (not (= (select |old(#valid)| 0) 0)) (not (= (select .cse6 1) 0)) (not (= 19 (select |old(#length)| 2))))))) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))) [2022-11-20 20:11:11,207 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 575 584) no Hoare annotation was computed. [2022-11-20 20:11:11,211 INFO L444 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1] [2022-11-20 20:11:11,215 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 20:11:11,237 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,237 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,238 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,238 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,239 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,239 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,239 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,240 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,240 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,240 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,241 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,241 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,241 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,242 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,242 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,242 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,243 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,243 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,243 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,244 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,244 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,245 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_9,QUANTIFIED] [2022-11-20 20:11:11,245 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,245 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,245 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,246 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,246 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_8,QUANTIFIED] [2022-11-20 20:11:11,246 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,246 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_9,QUANTIFIED] [2022-11-20 20:11:11,247 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_8,QUANTIFIED] [2022-11-20 20:11:11,247 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,247 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_9,QUANTIFIED] [2022-11-20 20:11:11,247 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,248 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,248 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,248 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,249 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,249 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,249 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,249 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,258 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,258 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,258 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,259 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,259 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,259 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,260 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,260 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,260 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,261 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,261 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,261 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,262 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,262 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,262 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,263 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,263 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,263 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,264 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,264 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,264 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,265 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_9,QUANTIFIED] [2022-11-20 20:11:11,265 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,265 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,265 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,265 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,266 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_8,QUANTIFIED] [2022-11-20 20:11:11,266 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,266 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_9,QUANTIFIED] [2022-11-20 20:11:11,266 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_8,QUANTIFIED] [2022-11-20 20:11:11,266 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,267 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_9,QUANTIFIED] [2022-11-20 20:11:11,267 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,267 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,267 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,268 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,268 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,268 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,269 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,269 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,274 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,275 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,275 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,275 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,275 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,276 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,276 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,276 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,277 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,277 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,277 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,277 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,278 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,278 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,278 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,279 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,281 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,281 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,282 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,282 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,282 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,282 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,283 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,283 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,283 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,284 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,284 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,284 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,284 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,285 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,285 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,285 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,288 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,288 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,288 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,289 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,289 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,289 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,290 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,290 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,290 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,290 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,291 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,291 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,291 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,292 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,292 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,293 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,293 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,293 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,293 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,294 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,294 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,294 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,295 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,295 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,295 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,296 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,296 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,296 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,297 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,297 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,297 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_9,QUANTIFIED] [2022-11-20 20:11:11,297 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,298 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,298 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,298 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,298 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_8,QUANTIFIED] [2022-11-20 20:11:11,298 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,299 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_9,QUANTIFIED] [2022-11-20 20:11:11,299 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_8,QUANTIFIED] [2022-11-20 20:11:11,299 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,299 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_9,QUANTIFIED] [2022-11-20 20:11:11,299 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,304 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,304 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,305 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,305 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,305 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,305 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,313 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,313 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,314 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,314 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,314 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,315 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,315 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,315 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,316 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,316 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,317 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,317 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,317 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,318 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,318 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,318 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,319 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,319 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,319 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,320 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,320 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,321 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,321 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,321 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,321 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_9,QUANTIFIED] [2022-11-20 20:11:11,322 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,322 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,322 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,322 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,323 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_8,QUANTIFIED] [2022-11-20 20:11:11,323 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,323 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_9,QUANTIFIED] [2022-11-20 20:11:11,323 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_8,QUANTIFIED] [2022-11-20 20:11:11,324 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,324 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_9,QUANTIFIED] [2022-11-20 20:11:11,324 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,328 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,329 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,329 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,329 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,329 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,330 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,331 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,331 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,332 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,332 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,332 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,332 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,334 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,335 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,335 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,335 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,336 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,336 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,336 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,337 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,337 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,337 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,338 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,338 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,339 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,339 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,339 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,340 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,340 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,340 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,341 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,341 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,341 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,341 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,342 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,342 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,342 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,343 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,343 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,343 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,344 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,344 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,344 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,347 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,347 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,348 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,348 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,348 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,349 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,349 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,349 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,350 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,350 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,350 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,351 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,351 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,352 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,352 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,352 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,353 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,353 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,353 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,354 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,354 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,354 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,354 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,355 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,355 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,356 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,356 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,356 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,357 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,357 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,357 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 08:11:11 BoogieIcfgContainer [2022-11-20 20:11:11,360 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 20:11:11,361 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 20:11:11,361 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 20:11:11,361 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 20:11:11,362 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:10:01" (3/4) ... [2022-11-20 20:11:11,366 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-20 20:11:11,373 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2022-11-20 20:11:11,378 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 30 nodes and edges [2022-11-20 20:11:11,379 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2022-11-20 20:11:11,379 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-20 20:11:11,379 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 20:11:11,409 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((head == 0 && unknown-#length-unknown[head] == 12) && head == last) && #memory_$Pointer$[head][0] == 0) && data == \old(data)) && #NULL <= 0) && unknown-#memory_int-unknown[head][8] == data) && head < unknown-#StackHeapBarrier-unknown) && \valid[head] == 1) && #memory_$Pointer$[head][4] == 0) && 2 == len) && \old(len) == len) && data == 1) && #memory_$Pointer$[head][4] == 0) && len == 2) && 1 <= data) && !(head == 0)) && head == last) && 0 <= #NULL) && #memory_$Pointer$[head][0] == 0) && data <= 1) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (((((((((((((((((((!(last == 0) && head == 0) && 2 <= \old(len)) && 1 <= len) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && last == #memory_$Pointer$[head][head]) && data == 1) && 1 <= \old(data)) && len == 2) && #NULL == 0) && 1 <= data) && \old(len) <= 2) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) && !(head == last)) [2022-11-20 20:11:11,410 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((!(last == 0) && head == 0) && 2 <= \old(len)) && len <= 2) && 1 <= len) && #memory_$Pointer$[s][s] == head) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && last == #memory_$Pointer$[head][head]) && #memory_$Pointer$[s][s] == 0) && #memory_$Pointer$[s][s] == head) && !(#memory_$Pointer$[s][0] == 0)) && index <= 0) && 2 <= i) && data == 1) && 1 <= \old(data)) && len == 2) && #NULL == 0) && 1 <= data) && data == len + 1) && \old(len) <= 2) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 8] == len + 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && len == unknown-#memory_int-unknown[s][s + 8]) && s == 0) && #NULL == 0) && !(head == last)) || ((((((((((((((((((((((((((((((head == #memory_$Pointer$[last][last] && #memory_$Pointer$[head][head + 4] == last) && i == 0) && 2 <= \old(len)) && 1 <= len) && 0 <= last) && \old(data) <= 1) && last <= 0) && \result == head) && #memory_$Pointer$[head][head + 4] == last) && \result == s) && data == 1) && 1 <= \old(data)) && \result == s) && #NULL == 0) && #memory_$Pointer$[last][last] == head) && \result == head) && #NULL == 0) || (((((((((((((((((((((((((((\old(data) == data && head == #memory_$Pointer$[last][last]) && #memory_$Pointer$[head][head + 4] == last) && 2 <= \old(len)) && 1 <= len) && 0 <= last) && \old(data) <= 1) && last <= 0) && \old(index) + len == new_data) && \result == head) && unknown-#memory_int-unknown[head][8 + head] == data) && #memory_$Pointer$[head][head + 4] == last) && \result == s) && len == new_data) && data == 1) && 1 <= \old(data)) && \result == s) && \old(index) == index) && head == head) && head == head) && head == s) && #NULL == 0) && s == head) && #memory_$Pointer$[last][last] == head) && new_data + 1 == len + i) && \result == head) && \old(data) == new_data) && #NULL == 0)) && last == #memory_$Pointer$[head][head]) && i == 1) && #memory_$Pointer$[s][s] == 0) && !(#memory_$Pointer$[s][0] == 0)) && len == 2) && 1 <= data) && \old(len) <= 2) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s == 0) && !(head == last))) || ((((((((((((((((((((((((((((((head == #memory_$Pointer$[last][last] && #memory_$Pointer$[head][head + 4] == last) && i == 0) && 2 <= \old(len)) && 1 <= len) && 0 <= last) && \old(data) <= 1) && last <= 0) && \result == head) && #memory_$Pointer$[head][head + 4] == last) && \result == s) && data == 1) && 1 <= \old(data)) && \result == s) && #NULL == 0) && #memory_$Pointer$[last][last] == head) && \result == head) && #NULL == 0) || (((((((((((((((((((((((((((\old(data) == data && head == #memory_$Pointer$[last][last]) && #memory_$Pointer$[head][head + 4] == last) && 2 <= \old(len)) && 1 <= len) && 0 <= last) && \old(data) <= 1) && last <= 0) && \old(index) + len == new_data) && \result == head) && unknown-#memory_int-unknown[head][8 + head] == data) && #memory_$Pointer$[head][head + 4] == last) && \result == s) && len == new_data) && data == 1) && 1 <= \old(data)) && \result == s) && \old(index) == index) && head == head) && head == head) && head == s) && #NULL == 0) && s == head) && #memory_$Pointer$[last][last] == head) && new_data + 1 == len + i) && \result == head) && \old(data) == new_data) && #NULL == 0)) && last == #memory_$Pointer$[head][head]) && #memory_$Pointer$[s][s] == 0) && !(#memory_$Pointer$[s][0] == 0)) && len == 2) && 1 <= data) && \old(len) <= 2) && len <= 1) && (\exists v_DerPreprocessor_9 : [int]int, v_DerPreprocessor_8 : [int]int :: v_DerPreprocessor_9[4] == #memory_$Pointer$[s][4] && #memory_$Pointer$[#memory_$Pointer$[s][0]] == #memory_$Pointer$[#memory_$Pointer$[s][0] := v_DerPreprocessor_8][s := v_DerPreprocessor_9][#memory_$Pointer$[s][0] := v_DerPreprocessor_8][s := v_DerPreprocessor_9][#memory_$Pointer$[s][0]])) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s == 0) && !(head == last)) [2022-11-20 20:11:11,411 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((2 <= \old(len) && len <= 2) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && index <= 0) && 2 <= i) && data == 1) && 1 <= \old(data)) && len == 2) && #NULL == 0) && 1 <= data) && \old(len) <= 2) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= head) && #NULL == 0) || ((((((((((((((((((((((((((((((!(last == 0) && 2 <= \old(len)) && len <= 2) && 1 <= len) && #memory_$Pointer$[s][s] == head) && head <= 0) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && last == #memory_$Pointer$[head][head]) && index <= 0) && !(#memory_$Pointer$[s][s] == 0)) && #memory_$Pointer$[s][s] == 0) && #memory_$Pointer$[s][s] == head) && !(head == s)) && index <= 0) && data == 1) && 1 <= \old(data)) && len + i == data) && len == 2) && #NULL == 0) && 1 <= data) && data == len + 1) && \old(len) <= 2) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 8] == len + 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= head) && #NULL == 0) && !(head == last))) || ((((((((((((((((((((((((((((((!(last == 0) && i == 0) && 2 <= \old(len)) && len <= 2) && 1 <= len) && #memory_$Pointer$[s][s] == head) && head <= 0) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && last == #memory_$Pointer$[head][head]) && #memory_$Pointer$[s][s] == 0) && #memory_$Pointer$[s][s] == head) && !(#memory_$Pointer$[s][0] == 0)) && index <= 0) && data == 1) && 1 <= \old(data)) && len == 2) && #NULL == 0) && 1 <= data) && data == len + 1) && \old(len) <= 2) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 8] == len + 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && len == unknown-#memory_int-unknown[s][s + 8]) && 0 <= head) && s == 0) && #NULL == 0) && !(head == last)) [2022-11-20 20:11:11,411 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((2 <= \old(len) && 1 <= len) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && last == #memory_$Pointer$[head][head]) && !(#memory_$Pointer$[s][0] == 0)) && 1 <= \old(data)) && \old(index) == i) && len + i == data) && \old(index) == index) && len + i == new_data) && head == head) && head == s) && 1 <= data) && (((((((((((((head == #memory_$Pointer$[last][last] && #memory_$Pointer$[head][head + 4] == last) && \result == head) && #memory_$Pointer$[head][head + 4] == last) && \result == s) && data == 1) && \result == s) && len == 2) && #NULL == 0) && #memory_$Pointer$[last][last] == head) && len == unknown-#memory_int-unknown[s][s + 8]) && \result == head) && #NULL == 0) || ((((((((((((head == #memory_$Pointer$[last][last] && #memory_$Pointer$[head][head + 4] == last) && i == 0) && \result == head) && #memory_$Pointer$[head][head + 4] == last) && \result == s) && data == 1) && \result == s) && len == 2) && #NULL == 0) && #memory_$Pointer$[last][last] == head) && \result == head) && #NULL == 0))) && s == head) && head == s) && data == len + 1) && \old(len) <= 2) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && \old(data) == new_data) && s == 0) && !(head == last)) || (((((((((((((((((((((((((((2 <= \old(len) && index == 0) && 1 <= len) && 0 <= last) && \old(data) <= 1) && last <= 0) && last == #memory_$Pointer$[head][head]) && !(#memory_$Pointer$[s][0] == 0)) && 1 <= \old(data)) && \old(index) == i) && len + i == data) && \old(index) == index) && len + i == new_data) && head == head) && head == s) && 1 <= data) && (((((((((((((head == #memory_$Pointer$[last][last] && #memory_$Pointer$[head][head + 4] == last) && \result == head) && #memory_$Pointer$[head][head + 4] == last) && \result == s) && data == 1) && \result == s) && len == 2) && #NULL == 0) && #memory_$Pointer$[last][last] == head) && len == unknown-#memory_int-unknown[s][s + 8]) && \result == head) && #NULL == 0) || ((((((((((((head == #memory_$Pointer$[last][last] && #memory_$Pointer$[head][head + 4] == last) && i == 0) && \result == head) && #memory_$Pointer$[head][head + 4] == last) && \result == s) && data == 1) && \result == s) && len == 2) && #NULL == 0) && #memory_$Pointer$[last][last] == head) && \result == head) && #NULL == 0))) && s == head) && head == s) && \old(len) <= 2) && len <= 1) && (\exists v_DerPreprocessor_9 : [int]int, v_DerPreprocessor_8 : [int]int :: v_DerPreprocessor_9[4] == #memory_$Pointer$[s][4] && #memory_$Pointer$[#memory_$Pointer$[s][0]] == #memory_$Pointer$[#memory_$Pointer$[s][0] := v_DerPreprocessor_8][s := v_DerPreprocessor_9][#memory_$Pointer$[s][0] := v_DerPreprocessor_8][s := v_DerPreprocessor_9][#memory_$Pointer$[s][0]])) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && \old(data) == new_data) && s == 0) && #memory_$Pointer$[head][s] == 0) && !(head == last))) || (((((((((((((((((((((((((((((!(last == 0) && head == 0) && 2 <= \old(len)) && len <= 2) && 1 <= len) && #memory_$Pointer$[s][s] == head) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && last == #memory_$Pointer$[head][head]) && #memory_$Pointer$[s][s] == 0) && #memory_$Pointer$[s][s] == head) && !(#memory_$Pointer$[s][0] == 0)) && !(head == s)) && index <= 0) && data == 1) && 1 <= \old(data)) && len + i == data) && len == 2) && #NULL == 0) && 1 <= data) && data == len + 1) && \old(len) <= 2) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && len == unknown-#memory_int-unknown[s][s + 8]) && s == 0) && #NULL == 0) && !(head == last)) [2022-11-20 20:11:11,411 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((!(last == 0) && expected == unknown-#memory_int-unknown[head][8]) && i == 0) && 2 <= \old(len)) && len <= 2) && 1 <= len) && #memory_$Pointer$[s][s] == head) && head <= 0) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && last == #memory_$Pointer$[head][head]) && index == 0) && #memory_$Pointer$[s][s] == 0) && #memory_$Pointer$[s][s] == head) && 2 == expected) && !(#memory_$Pointer$[s][0] == 0)) && index <= 0) && data == 1) && 1 <= \old(data)) && len == 2) && head == 0) && #NULL == 0) && 1 <= data) && data == len + 1) && \old(len) <= 2) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 8] == len + 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && len == unknown-#memory_int-unknown[s][s + 8]) && 0 <= head) && s == 0) && #NULL == 0) && !(head == last)) || ((((((((((((((((((((((((((((((((((((1 <= index && !(last == 0)) && !(#memory_$Pointer$[head][head] == 0)) && 2 <= \old(len)) && len <= 2) && index <= 1) && 1 <= len) && #memory_$Pointer$[s][s] == head) && head <= 0) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && last == #memory_$Pointer$[head][head]) && !(#memory_$Pointer$[s][s] == 0)) && 0 == #memory_$Pointer$[head][head]) && unknown-#memory_int-unknown[#memory_$Pointer$[head][head]][8 + #memory_$Pointer$[head][head]] == expected) && #memory_$Pointer$[s][s] == 0) && #memory_$Pointer$[s][s] == head) && !(head == #memory_$Pointer$[head][head])) && !(head == s)) && index <= 0) && data == 1) && 1 <= \old(data)) && len + i == data) && len == 2) && #NULL == 0) && 1 <= data) && data == len + 1) && \old(len) <= 2) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 8] == len + 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[#memory_$Pointer$[head][head]][8 + #memory_$Pointer$[head][head]] == 3) && 0 <= head) && #NULL == 0) && !(head == last))) || ((((((((((((((((((((((((((((((((((!(last == 0) && 2 <= \old(len)) && len <= 2) && 1 <= len) && #memory_$Pointer$[s][s] == head) && head <= 0) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && last == #memory_$Pointer$[head][head]) && index <= 0) && unknown-#memory_int-unknown[head][8 + head] == 3) && !(#memory_$Pointer$[s][s] == 0)) && #memory_$Pointer$[s][s] == 0) && #memory_$Pointer$[s][s] == head) && !(head == s)) && index <= 0) && data == 1) && 1 <= \old(data)) && len + i == data) && len == 2) && head == 0) && #NULL == 0) && 1 <= data) && data == len + 1) && \old(len) <= 2) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 8] == len + 1) && unknown-#memory_int-unknown[head][8 + head] == expected) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= head) && !(head == 0)) && #NULL == 0) && !(head == last)) [2022-11-20 20:11:11,427 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/witness.graphml [2022-11-20 20:11:11,428 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 20:11:11,428 INFO L158 Benchmark]: Toolchain (without parser) took 71487.59ms. Allocated memory was 207.6MB in the beginning and 650.1MB in the end (delta: 442.5MB). Free memory was 162.1MB in the beginning and 597.5MB in the end (delta: -435.4MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2022-11-20 20:11:11,429 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 146.8MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 20:11:11,429 INFO L158 Benchmark]: CACSL2BoogieTranslator took 541.09ms. Allocated memory is still 207.6MB. Free memory was 162.1MB in the beginning and 144.3MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-20 20:11:11,429 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.21ms. Allocated memory is still 207.6MB. Free memory was 144.3MB in the beginning and 142.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 20:11:11,430 INFO L158 Benchmark]: Boogie Preprocessor took 34.49ms. Allocated memory is still 207.6MB. Free memory was 142.4MB in the beginning and 140.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 20:11:11,430 INFO L158 Benchmark]: RCFGBuilder took 625.09ms. Allocated memory is still 207.6MB. Free memory was 140.2MB in the beginning and 120.2MB in the end (delta: 20.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-20 20:11:11,430 INFO L158 Benchmark]: TraceAbstraction took 70151.12ms. Allocated memory was 207.6MB in the beginning and 650.1MB in the end (delta: 442.5MB). Free memory was 119.3MB in the beginning and 600.6MB in the end (delta: -481.3MB). Peak memory consumption was 340.3MB. Max. memory is 16.1GB. [2022-11-20 20:11:11,430 INFO L158 Benchmark]: Witness Printer took 67.30ms. Allocated memory is still 650.1MB. Free memory was 600.6MB in the beginning and 597.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 20:11:11,432 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.29ms. Allocated memory is still 146.8MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 541.09ms. Allocated memory is still 207.6MB. Free memory was 162.1MB in the beginning and 144.3MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.21ms. Allocated memory is still 207.6MB. Free memory was 144.3MB in the beginning and 142.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.49ms. Allocated memory is still 207.6MB. Free memory was 142.4MB in the beginning and 140.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 625.09ms. Allocated memory is still 207.6MB. Free memory was 140.2MB in the beginning and 120.2MB in the end (delta: 20.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 70151.12ms. Allocated memory was 207.6MB in the beginning and 650.1MB in the end (delta: 442.5MB). Free memory was 119.3MB in the beginning and 600.6MB in the end (delta: -481.3MB). Peak memory consumption was 340.3MB. Max. memory is 16.1GB. * Witness Printer took 67.30ms. Allocated memory is still 650.1MB. Free memory was 600.6MB in the beginning and 597.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. 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$.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$.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$.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$.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$.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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_9,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_8,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_DerPreprocessor_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_8,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_DerPreprocessor_9,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$.offset - 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$.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$.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$.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$.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$.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$.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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_9,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_8,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_DerPreprocessor_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_8,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_DerPreprocessor_9,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$.offset - 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$.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$.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$.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$.offset - 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$.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$.offset - 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$.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$.offset - 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$.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$.offset - 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$.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$.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$.offset - 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$.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$.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$.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$.offset - 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$.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$.offset - 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_DerPreprocessor_9,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_8,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_DerPreprocessor_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_8,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_DerPreprocessor_9,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$.offset - 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$.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$.offset - 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$.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$.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$.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$.offset - 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$.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$.offset - 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_DerPreprocessor_9,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_8,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_DerPreprocessor_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_8,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_DerPreprocessor_9,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$.offset - 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$.offset - 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$.offset - 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$.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$.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$.offset - 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$.offset - 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$.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$.offset - 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$.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$.offset - 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$.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$.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$.offset - 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$.offset - 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$.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$.offset - 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$.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 * 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: 643]: 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, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 69.9s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 420 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 415 mSDsluCounter, 696 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 97 IncrementalHoareTripleChecker+Unchecked, 567 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1537 IncrementalHoareTripleChecker+Invalid, 1693 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 129 mSDtfsCounter, 1537 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 646 GetRequests, 361 SyntacticMatches, 16 SemanticMatches, 269 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2818 ImplicationChecksByTransitivity, 36.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=10, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 51 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 16 PreInvPairs, 33 NumberOfFragments, 2669 HoareAnnotationTreeSize, 16 FomulaSimplifications, 1103 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 12 FomulaSimplificationsInter, 7317 FormulaSimplificationTreeSizeReductionInter, 3.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 479 NumberOfCodeBlocks, 463 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 577 ConstructedInterpolants, 2 QuantifiedInterpolants, 2630 SizeOfPredicates, 81 NumberOfNonLiveVariables, 2793 ConjunctsInSsa, 232 ConjunctsInUnsatCore, 25 InterpolantComputations, 5 PerfectInterpolantSequences, 230/306 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 3.1s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 2, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 14, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 17, TOOLS_POST_TIME: 1.1s, TOOLS_POST_CALL_APPLICATIONS: 8, TOOLS_POST_CALL_TIME: 1.0s, TOOLS_POST_RETURN_APPLICATIONS: 6, TOOLS_POST_RETURN_TIME: 0.7s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 31, TOOLS_QUANTIFIERELIM_TIME: 2.8s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.3s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 49, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 8, DOMAIN_JOIN_TIME: 0.1s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 1, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 3, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 14, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 2, LOOP_SUMMARIZER_CACHE_MISSES: 2, LOOP_SUMMARIZER_OVERALL_TIME: 1.2s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 1.2s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 3, CALL_SUMMARIZER_APPLICATIONS: 6, CALL_SUMMARIZER_CACHE_MISSES: 1, CALL_SUMMARIZER_OVERALL_TIME: 0.1s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.1s, 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: 220, DAG_COMPRESSION_RETAINED_NODES: 54, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 620]: Loop Invariant [2022-11-20 20:11:11,468 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,468 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,469 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,469 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,469 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,469 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,469 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,470 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,470 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,470 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,470 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,471 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,471 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,471 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,471 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,471 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,472 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,472 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,472 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,472 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,472 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,473 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_9,QUANTIFIED] [2022-11-20 20:11:11,473 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,473 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,473 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,473 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,473 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_8,QUANTIFIED] [2022-11-20 20:11:11,473 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,473 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_9,QUANTIFIED] [2022-11-20 20:11:11,474 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_8,QUANTIFIED] [2022-11-20 20:11:11,474 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,474 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_9,QUANTIFIED] [2022-11-20 20:11:11,474 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,474 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,474 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,474 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,476 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,476 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,477 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,477 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,479 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,479 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,479 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,480 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,480 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,480 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,480 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,481 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,481 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,481 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,481 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,482 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,482 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,482 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,483 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,483 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,483 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,483 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,484 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,484 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,484 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,484 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_9,QUANTIFIED] [2022-11-20 20:11:11,484 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,485 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,485 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,485 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,485 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_8,QUANTIFIED] [2022-11-20 20:11:11,485 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,486 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_9,QUANTIFIED] [2022-11-20 20:11:11,486 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_8,QUANTIFIED] [2022-11-20 20:11:11,486 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,486 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_9,QUANTIFIED] [2022-11-20 20:11:11,486 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,487 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,487 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,487 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,487 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,487 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,488 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,488 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((((((((2 <= \old(len) && 1 <= len) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && last == #memory_$Pointer$[head][head]) && !(#memory_$Pointer$[s][0] == 0)) && 1 <= \old(data)) && \old(index) == i) && len + i == data) && \old(index) == index) && len + i == new_data) && head == head) && head == s) && 1 <= data) && (((((((((((((head == #memory_$Pointer$[last][last] && #memory_$Pointer$[head][head + 4] == last) && \result == head) && #memory_$Pointer$[head][head + 4] == last) && \result == s) && data == 1) && \result == s) && len == 2) && #NULL == 0) && #memory_$Pointer$[last][last] == head) && len == unknown-#memory_int-unknown[s][s + 8]) && \result == head) && #NULL == 0) || ((((((((((((head == #memory_$Pointer$[last][last] && #memory_$Pointer$[head][head + 4] == last) && i == 0) && \result == head) && #memory_$Pointer$[head][head + 4] == last) && \result == s) && data == 1) && \result == s) && len == 2) && #NULL == 0) && #memory_$Pointer$[last][last] == head) && \result == head) && #NULL == 0))) && s == head) && head == s) && data == len + 1) && \old(len) <= 2) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && \old(data) == new_data) && s == 0) && !(head == last)) || (((((((((((((((((((((((((((2 <= \old(len) && index == 0) && 1 <= len) && 0 <= last) && \old(data) <= 1) && last <= 0) && last == #memory_$Pointer$[head][head]) && !(#memory_$Pointer$[s][0] == 0)) && 1 <= \old(data)) && \old(index) == i) && len + i == data) && \old(index) == index) && len + i == new_data) && head == head) && head == s) && 1 <= data) && (((((((((((((head == #memory_$Pointer$[last][last] && #memory_$Pointer$[head][head + 4] == last) && \result == head) && #memory_$Pointer$[head][head + 4] == last) && \result == s) && data == 1) && \result == s) && len == 2) && #NULL == 0) && #memory_$Pointer$[last][last] == head) && len == unknown-#memory_int-unknown[s][s + 8]) && \result == head) && #NULL == 0) || ((((((((((((head == #memory_$Pointer$[last][last] && #memory_$Pointer$[head][head + 4] == last) && i == 0) && \result == head) && #memory_$Pointer$[head][head + 4] == last) && \result == s) && data == 1) && \result == s) && len == 2) && #NULL == 0) && #memory_$Pointer$[last][last] == head) && \result == head) && #NULL == 0))) && s == head) && head == s) && \old(len) <= 2) && len <= 1) && (\exists v_DerPreprocessor_9 : [int]int, v_DerPreprocessor_8 : [int]int :: v_DerPreprocessor_9[4] == #memory_$Pointer$[s][4] && #memory_$Pointer$[#memory_$Pointer$[s][0]] == #memory_$Pointer$[#memory_$Pointer$[s][0] := v_DerPreprocessor_8][s := v_DerPreprocessor_9][#memory_$Pointer$[s][0] := v_DerPreprocessor_8][s := v_DerPreprocessor_9][#memory_$Pointer$[s][0]])) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && \old(data) == new_data) && s == 0) && #memory_$Pointer$[head][s] == 0) && !(head == last))) || (((((((((((((((((((((((((((((!(last == 0) && head == 0) && 2 <= \old(len)) && len <= 2) && 1 <= len) && #memory_$Pointer$[s][s] == head) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && last == #memory_$Pointer$[head][head]) && #memory_$Pointer$[s][s] == 0) && #memory_$Pointer$[s][s] == head) && !(#memory_$Pointer$[s][0] == 0)) && !(head == s)) && index <= 0) && data == 1) && 1 <= \old(data)) && len + i == data) && len == 2) && #NULL == 0) && 1 <= data) && data == len + 1) && \old(len) <= 2) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && len == unknown-#memory_int-unknown[s][s + 8]) && s == 0) && #NULL == 0) && !(head == last)) - InvariantResult [Line: 635]: Loop Invariant [2022-11-20 20:11:11,490 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,491 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,491 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,491 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,492 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,492 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,492 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,492 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,492 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,493 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,493 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,493 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,493 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,494 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,494 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,494 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,495 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,495 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,496 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,496 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,496 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,496 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,497 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,497 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,497 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,497 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,498 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,498 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,498 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,498 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,498 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,499 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((2 <= \old(len) && len <= 2) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && index <= 0) && 2 <= i) && data == 1) && 1 <= \old(data)) && len == 2) && #NULL == 0) && 1 <= data) && \old(len) <= 2) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= head) && #NULL == 0) || ((((((((((((((((((((((((((((((!(last == 0) && 2 <= \old(len)) && len <= 2) && 1 <= len) && #memory_$Pointer$[s][s] == head) && head <= 0) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && last == #memory_$Pointer$[head][head]) && index <= 0) && !(#memory_$Pointer$[s][s] == 0)) && #memory_$Pointer$[s][s] == 0) && #memory_$Pointer$[s][s] == head) && !(head == s)) && index <= 0) && data == 1) && 1 <= \old(data)) && len + i == data) && len == 2) && #NULL == 0) && 1 <= data) && data == len + 1) && \old(len) <= 2) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 8] == len + 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= head) && #NULL == 0) && !(head == last))) || ((((((((((((((((((((((((((((((!(last == 0) && i == 0) && 2 <= \old(len)) && len <= 2) && 1 <= len) && #memory_$Pointer$[s][s] == head) && head <= 0) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && last == #memory_$Pointer$[head][head]) && #memory_$Pointer$[s][s] == 0) && #memory_$Pointer$[s][s] == head) && !(#memory_$Pointer$[s][0] == 0)) && index <= 0) && data == 1) && 1 <= \old(data)) && len == 2) && #NULL == 0) && 1 <= data) && data == len + 1) && \old(len) <= 2) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 8] == len + 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && len == unknown-#memory_int-unknown[s][s + 8]) && 0 <= head) && s == 0) && #NULL == 0) && !(head == last)) - InvariantResult [Line: 626]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 631]: Loop Invariant [2022-11-20 20:11:11,500 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,501 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,501 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,501 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,501 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,501 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,502 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,502 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,502 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,502 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,503 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,503 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,503 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,504 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,504 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,504 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,504 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,505 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,505 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,505 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,505 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,506 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,506 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,506 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,506 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,507 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,507 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,507 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,507 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,508 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,508 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_9,QUANTIFIED] [2022-11-20 20:11:11,508 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,508 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,508 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,508 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,509 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_8,QUANTIFIED] [2022-11-20 20:11:11,509 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,509 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_9,QUANTIFIED] [2022-11-20 20:11:11,509 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_8,QUANTIFIED] [2022-11-20 20:11:11,509 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,510 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_9,QUANTIFIED] [2022-11-20 20:11:11,510 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,512 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,512 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,512 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,513 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,513 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,513 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,513 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,513 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,514 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,514 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,514 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,514 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,515 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,515 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,515 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,516 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,516 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,516 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,516 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,516 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,517 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,517 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,517 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,517 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,518 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,518 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,518 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,519 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,519 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,519 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,519 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_9,QUANTIFIED] [2022-11-20 20:11:11,519 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,520 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,520 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,520 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,520 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_8,QUANTIFIED] [2022-11-20 20:11:11,520 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,521 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_9,QUANTIFIED] [2022-11-20 20:11:11,521 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_8,QUANTIFIED] [2022-11-20 20:11:11,521 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,521 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_9,QUANTIFIED] [2022-11-20 20:11:11,521 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((((((((((!(last == 0) && head == 0) && 2 <= \old(len)) && len <= 2) && 1 <= len) && #memory_$Pointer$[s][s] == head) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && last == #memory_$Pointer$[head][head]) && #memory_$Pointer$[s][s] == 0) && #memory_$Pointer$[s][s] == head) && !(#memory_$Pointer$[s][0] == 0)) && index <= 0) && 2 <= i) && data == 1) && 1 <= \old(data)) && len == 2) && #NULL == 0) && 1 <= data) && data == len + 1) && \old(len) <= 2) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 8] == len + 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && len == unknown-#memory_int-unknown[s][s + 8]) && s == 0) && #NULL == 0) && !(head == last)) || ((((((((((((((((((((((((((((((head == #memory_$Pointer$[last][last] && #memory_$Pointer$[head][head + 4] == last) && i == 0) && 2 <= \old(len)) && 1 <= len) && 0 <= last) && \old(data) <= 1) && last <= 0) && \result == head) && #memory_$Pointer$[head][head + 4] == last) && \result == s) && data == 1) && 1 <= \old(data)) && \result == s) && #NULL == 0) && #memory_$Pointer$[last][last] == head) && \result == head) && #NULL == 0) || (((((((((((((((((((((((((((\old(data) == data && head == #memory_$Pointer$[last][last]) && #memory_$Pointer$[head][head + 4] == last) && 2 <= \old(len)) && 1 <= len) && 0 <= last) && \old(data) <= 1) && last <= 0) && \old(index) + len == new_data) && \result == head) && unknown-#memory_int-unknown[head][8 + head] == data) && #memory_$Pointer$[head][head + 4] == last) && \result == s) && len == new_data) && data == 1) && 1 <= \old(data)) && \result == s) && \old(index) == index) && head == head) && head == head) && head == s) && #NULL == 0) && s == head) && #memory_$Pointer$[last][last] == head) && new_data + 1 == len + i) && \result == head) && \old(data) == new_data) && #NULL == 0)) && last == #memory_$Pointer$[head][head]) && i == 1) && #memory_$Pointer$[s][s] == 0) && !(#memory_$Pointer$[s][0] == 0)) && len == 2) && 1 <= data) && \old(len) <= 2) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s == 0) && !(head == last))) || ((((((((((((((((((((((((((((((head == #memory_$Pointer$[last][last] && #memory_$Pointer$[head][head + 4] == last) && i == 0) && 2 <= \old(len)) && 1 <= len) && 0 <= last) && \old(data) <= 1) && last <= 0) && \result == head) && #memory_$Pointer$[head][head + 4] == last) && \result == s) && data == 1) && 1 <= \old(data)) && \result == s) && #NULL == 0) && #memory_$Pointer$[last][last] == head) && \result == head) && #NULL == 0) || (((((((((((((((((((((((((((\old(data) == data && head == #memory_$Pointer$[last][last]) && #memory_$Pointer$[head][head + 4] == last) && 2 <= \old(len)) && 1 <= len) && 0 <= last) && \old(data) <= 1) && last <= 0) && \old(index) + len == new_data) && \result == head) && unknown-#memory_int-unknown[head][8 + head] == data) && #memory_$Pointer$[head][head + 4] == last) && \result == s) && len == new_data) && data == 1) && 1 <= \old(data)) && \result == s) && \old(index) == index) && head == head) && head == head) && head == s) && #NULL == 0) && s == head) && #memory_$Pointer$[last][last] == head) && new_data + 1 == len + i) && \result == head) && \old(data) == new_data) && #NULL == 0)) && last == #memory_$Pointer$[head][head]) && #memory_$Pointer$[s][s] == 0) && !(#memory_$Pointer$[s][0] == 0)) && len == 2) && 1 <= data) && \old(len) <= 2) && len <= 1) && (\exists v_DerPreprocessor_9 : [int]int, v_DerPreprocessor_8 : [int]int :: v_DerPreprocessor_9[4] == #memory_$Pointer$[s][4] && #memory_$Pointer$[#memory_$Pointer$[s][0]] == #memory_$Pointer$[#memory_$Pointer$[s][0] := v_DerPreprocessor_8][s := v_DerPreprocessor_9][#memory_$Pointer$[s][0] := v_DerPreprocessor_8][s := v_DerPreprocessor_9][#memory_$Pointer$[s][0]])) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s == 0) && !(head == last)) - InvariantResult [Line: 604]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 588]: Loop Invariant [2022-11-20 20:11:11,524 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,524 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,524 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,525 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,525 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,525 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,526 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,526 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,526 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,526 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,527 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,527 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((head == 0 && unknown-#length-unknown[head] == 12) && head == last) && #memory_$Pointer$[head][0] == 0) && data == \old(data)) && #NULL <= 0) && unknown-#memory_int-unknown[head][8] == data) && head < unknown-#StackHeapBarrier-unknown) && \valid[head] == 1) && #memory_$Pointer$[head][4] == 0) && 2 == len) && \old(len) == len) && data == 1) && #memory_$Pointer$[head][4] == 0) && len == 2) && 1 <= data) && !(head == 0)) && head == last) && 0 <= #NULL) && #memory_$Pointer$[head][0] == 0) && data <= 1) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (((((((((((((((((((!(last == 0) && head == 0) && 2 <= \old(len)) && 1 <= len) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && last == #memory_$Pointer$[head][head]) && data == 1) && 1 <= \old(data)) && len == 2) && #NULL == 0) && 1 <= data) && \old(len) <= 2) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) && !(head == last)) - InvariantResult [Line: 613]: Loop Invariant [2022-11-20 20:11:11,528 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,528 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,528 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,528 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,529 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,529 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,529 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,529 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,529 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,530 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,530 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,530 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,530 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,531 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,531 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,531 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,531 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,532 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,532 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,532 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,532 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,533 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,533 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,533 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,533 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,534 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,534 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,534 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,534 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,534 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,535 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,536 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,537 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,537 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,537 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,537 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,538 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,538 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,538 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,538 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,539 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,539 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,539 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,540 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,540 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,540 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,540 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,541 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,541 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,541 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,541 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,542 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,542 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,542 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,542 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,542 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,543 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,543 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,543 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:11:11,543 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,544 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:11:11,544 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((((((((((((((((((!(last == 0) && expected == unknown-#memory_int-unknown[head][8]) && i == 0) && 2 <= \old(len)) && len <= 2) && 1 <= len) && #memory_$Pointer$[s][s] == head) && head <= 0) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && last == #memory_$Pointer$[head][head]) && index == 0) && #memory_$Pointer$[s][s] == 0) && #memory_$Pointer$[s][s] == head) && 2 == expected) && !(#memory_$Pointer$[s][0] == 0)) && index <= 0) && data == 1) && 1 <= \old(data)) && len == 2) && head == 0) && #NULL == 0) && 1 <= data) && data == len + 1) && \old(len) <= 2) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 8] == len + 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && len == unknown-#memory_int-unknown[s][s + 8]) && 0 <= head) && s == 0) && #NULL == 0) && !(head == last)) || ((((((((((((((((((((((((((((((((((((1 <= index && !(last == 0)) && !(#memory_$Pointer$[head][head] == 0)) && 2 <= \old(len)) && len <= 2) && index <= 1) && 1 <= len) && #memory_$Pointer$[s][s] == head) && head <= 0) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && last == #memory_$Pointer$[head][head]) && !(#memory_$Pointer$[s][s] == 0)) && 0 == #memory_$Pointer$[head][head]) && unknown-#memory_int-unknown[#memory_$Pointer$[head][head]][8 + #memory_$Pointer$[head][head]] == expected) && #memory_$Pointer$[s][s] == 0) && #memory_$Pointer$[s][s] == head) && !(head == #memory_$Pointer$[head][head])) && !(head == s)) && index <= 0) && data == 1) && 1 <= \old(data)) && len + i == data) && len == 2) && #NULL == 0) && 1 <= data) && data == len + 1) && \old(len) <= 2) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 8] == len + 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[#memory_$Pointer$[head][head]][8 + #memory_$Pointer$[head][head]] == 3) && 0 <= head) && #NULL == 0) && !(head == last))) || ((((((((((((((((((((((((((((((((((!(last == 0) && 2 <= \old(len)) && len <= 2) && 1 <= len) && #memory_$Pointer$[s][s] == head) && head <= 0) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && last == #memory_$Pointer$[head][head]) && index <= 0) && unknown-#memory_int-unknown[head][8 + head] == 3) && !(#memory_$Pointer$[s][s] == 0)) && #memory_$Pointer$[s][s] == 0) && #memory_$Pointer$[s][s] == head) && !(head == s)) && index <= 0) && data == 1) && 1 <= \old(data)) && len + i == data) && len == 2) && head == 0) && #NULL == 0) && 1 <= data) && data == len + 1) && \old(len) <= 2) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 8] == len + 1) && unknown-#memory_int-unknown[head][8 + head] == expected) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= head) && !(head == 0)) && #NULL == 0) && !(head == last)) - InvariantResult [Line: 573]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-20 20:11:11,567 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853e43c8-333c-4d9c-97d2-e8d5d5e8463c/bin/utaipan-6cKwYrpEi9/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