./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2n_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_update_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c46cc56772f2c3f0b073640343b328fb3b128ed13803ffe5a04f6290fe624494 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-22 01:37:37,742 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 01:37:37,744 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 01:37:37,779 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 01:37:37,779 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 01:37:37,784 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 01:37:37,786 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 01:37:37,790 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 01:37:37,792 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 01:37:37,796 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 01:37:37,797 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 01:37:37,798 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 01:37:37,798 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 01:37:37,799 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 01:37:37,800 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 01:37:37,801 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 01:37:37,814 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 01:37:37,815 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 01:37:37,816 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 01:37:37,818 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 01:37:37,819 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 01:37:37,828 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 01:37:37,830 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 01:37:37,831 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 01:37:37,834 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 01:37:37,834 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 01:37:37,835 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 01:37:37,836 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 01:37:37,836 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 01:37:37,837 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 01:37:37,837 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 01:37:37,838 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 01:37:37,839 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 01:37:37,840 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 01:37:37,841 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 01:37:37,841 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 01:37:37,842 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 01:37:37,842 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 01:37:37,842 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 01:37:37,843 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 01:37:37,855 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 01:37:37,856 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-22 01:37:37,893 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 01:37:37,893 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 01:37:37,894 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 01:37:37,894 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 01:37:37,895 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 01:37:37,895 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 01:37:37,895 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 01:37:37,896 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 01:37:37,896 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 01:37:37,896 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 01:37:37,897 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 01:37:37,897 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 01:37:37,898 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 01:37:37,898 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 01:37:37,898 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 01:37:37,898 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 01:37:37,898 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 01:37:37,899 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 01:37:37,899 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 01:37:37,900 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 01:37:37,900 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 01:37:37,900 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 01:37:37,900 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 01:37:37,900 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 01:37:37,901 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 01:37:37,901 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 01:37:37,901 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 01:37:37,901 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 01:37:37,901 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 01:37:37,902 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 01:37:37,902 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 01:37:37,902 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 01:37:37,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:37:37,903 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 01:37:37,903 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 01:37:37,903 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 01:37:37,903 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 01:37:37,903 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 01:37:37,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 01:37:37,904 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 01:37:37,904 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 01:37:37,904 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_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/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_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c46cc56772f2c3f0b073640343b328fb3b128ed13803ffe5a04f6290fe624494 [2022-11-22 01:37:38,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 01:37:38,265 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 01:37:38,267 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 01:37:38,269 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 01:37:38,269 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 01:37:38,270 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/list-simple/dll2n_update_all.i [2022-11-22 01:37:41,281 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 01:37:41,568 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 01:37:41,569 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/sv-benchmarks/c/list-simple/dll2n_update_all.i [2022-11-22 01:37:41,588 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/data/fc6a4d355/c6e7519dfd2446109a65a4fe966b235f/FLAGc11de59e4 [2022-11-22 01:37:41,602 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/data/fc6a4d355/c6e7519dfd2446109a65a4fe966b235f [2022-11-22 01:37:41,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 01:37:41,606 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 01:37:41,607 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 01:37:41,608 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 01:37:41,611 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 01:37:41,612 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:37:41" (1/1) ... [2022-11-22 01:37:41,613 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7254f45e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:37:41, skipping insertion in model container [2022-11-22 01:37:41,613 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:37:41" (1/1) ... [2022-11-22 01:37:41,621 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 01:37:41,650 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 01:37:42,005 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_55431dc4-1c78-4428-8f35-9f09cb8dbeff/sv-benchmarks/c/list-simple/dll2n_update_all.i[24455,24468] [2022-11-22 01:37:42,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:37:42,031 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 01:37:42,098 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_55431dc4-1c78-4428-8f35-9f09cb8dbeff/sv-benchmarks/c/list-simple/dll2n_update_all.i[24455,24468] [2022-11-22 01:37:42,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:37:42,133 INFO L208 MainTranslator]: Completed translation [2022-11-22 01:37:42,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:37:42 WrapperNode [2022-11-22 01:37:42,133 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 01:37:42,135 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 01:37:42,135 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 01:37:42,135 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 01:37:42,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:37:42" (1/1) ... [2022-11-22 01:37:42,174 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:37:42" (1/1) ... [2022-11-22 01:37:42,207 INFO L138 Inliner]: procedures = 126, calls = 27, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 111 [2022-11-22 01:37:42,207 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 01:37:42,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 01:37:42,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 01:37:42,209 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 01:37:42,218 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:37:42" (1/1) ... [2022-11-22 01:37:42,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:37:42" (1/1) ... [2022-11-22 01:37:42,230 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:37:42" (1/1) ... [2022-11-22 01:37:42,230 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:37:42" (1/1) ... [2022-11-22 01:37:42,241 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:37:42" (1/1) ... [2022-11-22 01:37:42,245 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:37:42" (1/1) ... [2022-11-22 01:37:42,247 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:37:42" (1/1) ... [2022-11-22 01:37:42,248 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:37:42" (1/1) ... [2022-11-22 01:37:42,250 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 01:37:42,251 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 01:37:42,251 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 01:37:42,251 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 01:37:42,252 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:37:42" (1/1) ... [2022-11-22 01:37:42,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:37:42,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:37:42,288 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 01:37:42,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 01:37:42,340 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-22 01:37:42,341 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-22 01:37:42,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-22 01:37:42,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 01:37:42,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-22 01:37:42,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 01:37:42,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-22 01:37:42,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-22 01:37:42,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 01:37:42,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 01:37:42,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 01:37:42,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 01:37:42,493 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 01:37:42,495 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 01:37:42,564 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-22 01:37:42,753 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 01:37:42,859 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 01:37:42,859 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-22 01:37:42,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:37:42 BoogieIcfgContainer [2022-11-22 01:37:42,862 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 01:37:42,864 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 01:37:42,864 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 01:37:42,867 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 01:37:42,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:37:41" (1/3) ... [2022-11-22 01:37:42,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ecdfc17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:37:42, skipping insertion in model container [2022-11-22 01:37:42,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:37:42" (2/3) ... [2022-11-22 01:37:42,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ecdfc17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:37:42, skipping insertion in model container [2022-11-22 01:37:42,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:37:42" (3/3) ... [2022-11-22 01:37:42,870 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_update_all.i [2022-11-22 01:37:42,896 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 01:37:42,896 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-22 01:37:42,956 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 01:37:42,962 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;@489465c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 01:37:42,963 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-22 01:37:42,967 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:37:42,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-22 01:37:42,974 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:37:42,974 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:37:42,975 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:37:42,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:37:42,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1570243634, now seen corresponding path program 1 times [2022-11-22 01:37:42,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:37:42,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486912639] [2022-11-22 01:37:42,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:37:42,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:37:43,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:37:43,235 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-22 01:37:43,236 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:37:43,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486912639] [2022-11-22 01:37:43,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486912639] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:37:43,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:37:43,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:37:43,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837030187] [2022-11-22 01:37:43,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:37:43,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:37:43,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:37:43,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:37:43,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:37:43,300 INFO L87 Difference]: Start difference. First operand has 17 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:37:43,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:37:43,396 INFO L93 Difference]: Finished difference Result 31 states and 45 transitions. [2022-11-22 01:37:43,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:37:43,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-22 01:37:43,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:37:43,405 INFO L225 Difference]: With dead ends: 31 [2022-11-22 01:37:43,406 INFO L226 Difference]: Without dead ends: 14 [2022-11-22 01:37:43,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:37:43,417 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 3 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:37:43,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 24 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:37:43,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-11-22 01:37:43,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2022-11-22 01:37:43,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:37:43,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2022-11-22 01:37:43,459 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 7 [2022-11-22 01:37:43,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:37:43,460 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-11-22 01:37:43,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:37:43,461 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2022-11-22 01:37:43,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-22 01:37:43,462 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:37:43,462 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:37:43,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 01:37:43,463 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:37:43,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:37:43,464 INFO L85 PathProgramCache]: Analyzing trace with hash 299858783, now seen corresponding path program 1 times [2022-11-22 01:37:43,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:37:43,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940615181] [2022-11-22 01:37:43,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:37:43,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:37:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:37:43,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:37:43,705 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:37:43,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940615181] [2022-11-22 01:37:43,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940615181] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:37:43,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977424642] [2022-11-22 01:37:43,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:37:43,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:37:43,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:37:43,710 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:37:43,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 01:37:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:37:43,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 01:37:43,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:37:43,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:37:43,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:37:43,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:37:43,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977424642] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:37:43,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1903902755] [2022-11-22 01:37:43,978 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-22 01:37:43,978 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:37:43,982 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:37:43,988 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:37:43,989 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:37:44,156 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-22 01:37:44,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-22 01:37:44,233 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-22 01:37:44,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-22 01:37:44,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:44,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:44,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-22 01:37:44,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:44,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:44,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2022-11-22 01:37:44,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:44,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:44,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-22 01:37:44,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:44,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:44,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-22 01:37:44,677 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-22 01:37:44,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2022-11-22 01:37:44,769 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-22 01:37:44,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2022-11-22 01:37:45,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:45,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:45,486 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-22 01:37:45,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 315 treesize of output 293 [2022-11-22 01:37:45,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:45,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:45,581 INFO L321 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-11-22 01:37:45,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 319 treesize of output 296 [2022-11-22 01:37:45,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:45,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:45,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 308 treesize of output 299 [2022-11-22 01:37:45,657 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:37:45,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:45,660 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:37:45,661 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:37:45,662 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:37:45,740 INFO L321 Elim1Store]: treesize reduction 66, result has 32.0 percent of original size [2022-11-22 01:37:45,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 455 treesize of output 483 [2022-11-22 01:37:45,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:45,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:45,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 326 treesize of output 317 [2022-11-22 01:37:45,815 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:37:45,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:45,819 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:37:45,820 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:37:45,883 INFO L321 Elim1Store]: treesize reduction 74, result has 34.5 percent of original size [2022-11-22 01:37:45,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 448 treesize of output 472 [2022-11-22 01:37:46,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 78 [2022-11-22 01:37:46,266 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:37:46,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 17 [2022-11-22 01:37:46,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 31 [2022-11-22 01:37:46,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:46,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:46,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 757 treesize of output 704 [2022-11-22 01:37:46,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:46,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 684 treesize of output 670 [2022-11-22 01:37:46,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-22 01:37:46,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:46,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:46,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:46,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:46,698 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-22 01:37:46,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 720 treesize of output 667 [2022-11-22 01:37:46,849 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-22 01:37:46,857 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-22 01:37:46,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:46,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:46,908 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:37:46,909 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:37:46,949 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-22 01:37:46,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 180 [2022-11-22 01:37:46,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:46,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:46,987 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:37:47,028 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-22 01:37:47,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 164 [2022-11-22 01:37:47,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:47,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-22 01:37:47,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:47,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-22 01:37:47,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:47,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 11 [2022-11-22 01:37:47,137 INFO L321 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2022-11-22 01:37:47,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 30 [2022-11-22 01:37:47,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:47,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:47,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-11-22 01:37:47,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 65 [2022-11-22 01:37:47,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 3 [2022-11-22 01:37:47,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:47,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:47,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 30 [2022-11-22 01:37:47,311 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-22 01:37:47,318 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-22 01:37:47,339 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:37:47,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1903902755] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:37:47,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:37:47,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3, 3, 3] total 7 [2022-11-22 01:37:47,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117506551] [2022-11-22 01:37:47,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:37:47,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:37:47,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:37:47,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:37:47,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-22 01:37:47,610 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:37:47,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:37:47,680 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2022-11-22 01:37:47,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:37:47,681 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-22 01:37:47,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:37:47,681 INFO L225 Difference]: With dead ends: 19 [2022-11-22 01:37:47,681 INFO L226 Difference]: Without dead ends: 14 [2022-11-22 01:37:47,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-22 01:37:47,683 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:37:47,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 12 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:37:47,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-11-22 01:37:47,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2022-11-22 01:37:47,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:37:47,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2022-11-22 01:37:47,689 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 10 [2022-11-22 01:37:47,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:37:47,690 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-11-22 01:37:47,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:37:47,690 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2022-11-22 01:37:47,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 01:37:47,691 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:37:47,691 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:37:47,706 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-22 01:37:47,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:37:47,899 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:37:47,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:37:47,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1448453533, now seen corresponding path program 1 times [2022-11-22 01:37:47,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:37:47,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033113150] [2022-11-22 01:37:47,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:37:47,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:37:47,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:37:48,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:37:48,010 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:37:48,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033113150] [2022-11-22 01:37:48,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033113150] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:37:48,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389732378] [2022-11-22 01:37:48,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:37:48,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:37:48,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:37:48,014 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:37:48,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 01:37:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:37:48,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 01:37:48,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:37:48,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:37:48,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:37:48,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:37:48,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389732378] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:37:48,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [368281502] [2022-11-22 01:37:48,143 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-22 01:37:48,144 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:37:48,144 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:37:48,144 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:37:48,145 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:37:48,189 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-22 01:37:48,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-22 01:37:48,233 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-22 01:37:48,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-22 01:37:48,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:48,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:48,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-22 01:37:48,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:48,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:48,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2022-11-22 01:37:48,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:48,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:48,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-22 01:37:48,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:48,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:48,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-22 01:37:48,446 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-22 01:37:48,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2022-11-22 01:37:48,487 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-22 01:37:48,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2022-11-22 01:37:48,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:48,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:48,829 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-22 01:37:48,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 235 treesize of output 221 [2022-11-22 01:37:48,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:48,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:48,897 INFO L321 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-11-22 01:37:48,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 239 treesize of output 224 [2022-11-22 01:37:48,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:48,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:48,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 219 [2022-11-22 01:37:48,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:48,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:48,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 219 [2022-11-22 01:37:49,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:49,014 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:37:49,015 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:37:49,016 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:37:49,089 INFO L321 Elim1Store]: treesize reduction 66, result has 32.0 percent of original size [2022-11-22 01:37:49,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 375 treesize of output 403 [2022-11-22 01:37:49,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:49,123 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:37:49,124 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:37:49,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 440 treesize of output 470 [2022-11-22 01:37:49,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:49,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:49,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:49,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:49,187 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-22 01:37:49,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 367 treesize of output 322 [2022-11-22 01:37:49,308 INFO L321 Elim1Store]: treesize reduction 35, result has 2.8 percent of original size [2022-11-22 01:37:49,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 190 treesize of output 125 [2022-11-22 01:37:49,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 64 [2022-11-22 01:37:49,342 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:37:49,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:49,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 11 [2022-11-22 01:37:49,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:49,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 566 treesize of output 513 [2022-11-22 01:37:49,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-22 01:37:49,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:49,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 493 treesize of output 479 [2022-11-22 01:37:49,723 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-22 01:37:49,731 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-22 01:37:49,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:49,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:49,774 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:37:49,775 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:37:49,812 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-22 01:37:49,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 185 [2022-11-22 01:37:49,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:49,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:49,846 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:37:49,877 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-22 01:37:49,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 164 [2022-11-22 01:37:49,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:49,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-22 01:37:49,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:49,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-22 01:37:49,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:49,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 11 [2022-11-22 01:37:50,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 67 [2022-11-22 01:37:50,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:50,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:50,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 45 [2022-11-22 01:37:50,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2022-11-22 01:37:50,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 53 [2022-11-22 01:37:50,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2022-11-22 01:37:50,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:50,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:50,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 30 [2022-11-22 01:37:50,214 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-22 01:37:50,224 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-22 01:37:50,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:37:50,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:37:50,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:37:50,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:37:50,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:37:50,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:37:50,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:37:50,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:37:50,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:37:50,517 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:37:51,440 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '278#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= 1 |ULTIMATE.start_dll_create_~data#1|) (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_dll_get_data_at_#in~index#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 |ULTIMATE.start_dll_create_#in~len#1|) (<= |ULTIMATE.start_dll_create_#res#1.offset| 0) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_dll_get_data_at_~head#1.base|) |ULTIMATE.start_dll_get_data_at_~head#1.offset|) |ULTIMATE.start_dll_get_data_at_#res#1|) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.base| |ULTIMATE.start_dll_get_data_at_~head#1.base|) (<= 0 (+ |ULTIMATE.start_dll_get_data_at_#res#1| 2147483648)) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.offset| |ULTIMATE.start_dll_get_data_at_~head#1.offset|) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_dll_get_data_at_#res#1| 2147483647) (<= |ULTIMATE.start_dll_create_~data#1| 1) (= |ULTIMATE.start_dll_get_data_at_~index#1| |ULTIMATE.start_dll_get_data_at_#in~index#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_dll_create_#in~len#1| 2) (<= |ULTIMATE.start_dll_create_~len#1| 0) (<= 1 |ULTIMATE.start_dll_create_#in~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= |ULTIMATE.start_dll_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_create_#res#1.offset|) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (not (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_get_data_at_#res#1|)) (= |#NULL.base| 0))' at error location [2022-11-22 01:37:51,440 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 01:37:51,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:37:51,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-11-22 01:37:51,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428273885] [2022-11-22 01:37:51,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:37:51,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:37:51,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:37:51,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:37:51,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-11-22 01:37:51,442 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:37:51,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:37:51,507 INFO L93 Difference]: Finished difference Result 24 states and 32 transitions. [2022-11-22 01:37:51,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:37:51,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-22 01:37:51,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:37:51,509 INFO L225 Difference]: With dead ends: 24 [2022-11-22 01:37:51,509 INFO L226 Difference]: Without dead ends: 16 [2022-11-22 01:37:51,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-11-22 01:37:51,510 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 4 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:37:51,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 20 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:37:51,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-11-22 01:37:51,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-11-22 01:37:51,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:37:51,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2022-11-22 01:37:51,517 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 12 [2022-11-22 01:37:51,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:37:51,518 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2022-11-22 01:37:51,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:37:51,518 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2022-11-22 01:37:51,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-22 01:37:51,519 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:37:51,519 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:37:51,529 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-22 01:37:51,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:37:51,725 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:37:51,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:37:51,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1813339504, now seen corresponding path program 2 times [2022-11-22 01:37:51,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:37:51,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561638645] [2022-11-22 01:37:51,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:37:51,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:37:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:37:52,059 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:37:52,059 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:37:52,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561638645] [2022-11-22 01:37:52,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561638645] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:37:52,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556883824] [2022-11-22 01:37:52,059 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:37:52,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:37:52,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:37:52,075 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:37:52,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-22 01:37:52,208 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-22 01:37:52,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:37:52,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 01:37:52,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:37:52,251 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-22 01:37:52,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:37:52,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-22 01:37:52,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556883824] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:37:52,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [136391957] [2022-11-22 01:37:52,288 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-22 01:37:52,288 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:37:52,288 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:37:52,288 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:37:52,289 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:37:52,327 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-22 01:37:52,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-22 01:37:52,364 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-22 01:37:52,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-22 01:37:52,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:52,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:52,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2022-11-22 01:37:52,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:52,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:52,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-22 01:37:52,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:52,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:52,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-22 01:37:52,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:52,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:52,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-22 01:37:52,550 INFO L321 Elim1Store]: treesize reduction 54, result has 27.0 percent of original size [2022-11-22 01:37:52,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 227 treesize of output 235 [2022-11-22 01:37:52,620 INFO L321 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2022-11-22 01:37:52,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 230 treesize of output 245 [2022-11-22 01:37:52,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:52,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:52,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:53,143 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-22 01:37:53,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 235 treesize of output 221 [2022-11-22 01:37:53,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:53,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:53,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:53,235 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-22 01:37:53,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 239 treesize of output 224 [2022-11-22 01:37:53,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:53,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:53,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 219 [2022-11-22 01:37:53,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:53,308 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:37:53,309 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:37:53,310 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:37:53,438 INFO L321 Elim1Store]: treesize reduction 66, result has 32.0 percent of original size [2022-11-22 01:37:53,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 375 treesize of output 398 [2022-11-22 01:37:53,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:53,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 306 treesize of output 297 [2022-11-22 01:37:53,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:53,497 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:37:53,498 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:37:53,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 440 treesize of output 475 [2022-11-22 01:37:53,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 65 [2022-11-22 01:37:53,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:53,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-22 01:37:53,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-11-22 01:37:53,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:53,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:53,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:53,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:53,902 INFO L321 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2022-11-22 01:37:53,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 565 treesize of output 520 [2022-11-22 01:37:54,004 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-22 01:37:54,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 657 treesize of output 572 [2022-11-22 01:37:54,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 554 treesize of output 430 [2022-11-22 01:37:54,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 516 treesize of output 512 [2022-11-22 01:37:54,137 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-22 01:37:54,143 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-22 01:37:54,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:54,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:54,178 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:37:54,179 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:37:54,224 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-22 01:37:54,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 180 [2022-11-22 01:37:54,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:54,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:54,260 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:37:54,322 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-22 01:37:54,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 164 [2022-11-22 01:37:54,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:54,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-22 01:37:54,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:54,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-22 01:37:54,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:54,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 11 [2022-11-22 01:37:54,420 INFO L321 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2022-11-22 01:37:54,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 30 [2022-11-22 01:37:54,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:54,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:54,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-11-22 01:37:54,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 65 [2022-11-22 01:37:54,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:54,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:54,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 30 [2022-11-22 01:37:54,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 3 [2022-11-22 01:37:54,572 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-22 01:37:54,579 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-22 01:37:54,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:37:54,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:37:54,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:37:54,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:37:54,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:37:54,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:37:54,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:37:54,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:37:54,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:37:54,829 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:37:55,739 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '443#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= 1 |ULTIMATE.start_dll_create_~data#1|) (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_dll_get_data_at_#in~index#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 |ULTIMATE.start_dll_create_#in~len#1|) (<= |ULTIMATE.start_dll_create_#res#1.offset| 0) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_dll_get_data_at_~head#1.base|) |ULTIMATE.start_dll_get_data_at_~head#1.offset|) |ULTIMATE.start_dll_get_data_at_#res#1|) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.base| |ULTIMATE.start_dll_get_data_at_~head#1.base|) (<= 0 (+ |ULTIMATE.start_dll_get_data_at_#res#1| 2147483648)) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.offset| |ULTIMATE.start_dll_get_data_at_~head#1.offset|) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_dll_get_data_at_#res#1| 2147483647) (<= |ULTIMATE.start_dll_create_~data#1| 1) (= |ULTIMATE.start_dll_get_data_at_~index#1| |ULTIMATE.start_dll_get_data_at_#in~index#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_dll_create_#in~len#1| 2) (<= |ULTIMATE.start_dll_create_~len#1| 0) (<= 1 |ULTIMATE.start_dll_create_#in~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= |ULTIMATE.start_dll_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_create_#res#1.offset|) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (not (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_get_data_at_#res#1|)) (= |#NULL.base| 0))' at error location [2022-11-22 01:37:55,739 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 01:37:55,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:37:55,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-11-22 01:37:55,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355395628] [2022-11-22 01:37:55,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:37:55,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-22 01:37:55,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:37:55,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-22 01:37:55,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2022-11-22 01:37:55,741 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:37:55,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:37:55,877 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-11-22 01:37:55,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 01:37:55,878 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-22 01:37:55,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:37:55,878 INFO L225 Difference]: With dead ends: 34 [2022-11-22 01:37:55,879 INFO L226 Difference]: Without dead ends: 29 [2022-11-22 01:37:55,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2022-11-22 01:37:55,880 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 54 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:37:55,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 21 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:37:55,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-22 01:37:55,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2022-11-22 01:37:55,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:37:55,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2022-11-22 01:37:55,887 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 15 [2022-11-22 01:37:55,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:37:55,887 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2022-11-22 01:37:55,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:37:55,888 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-11-22 01:37:55,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 01:37:55,888 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:37:55,888 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:37:55,895 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-22 01:37:56,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:37:56,091 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:37:56,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:37:56,092 INFO L85 PathProgramCache]: Analyzing trace with hash -2110536562, now seen corresponding path program 3 times [2022-11-22 01:37:56,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:37:56,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366263930] [2022-11-22 01:37:56,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:37:56,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:37:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:37:56,280 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 01:37:56,281 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:37:56,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366263930] [2022-11-22 01:37:56,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366263930] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:37:56,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516013736] [2022-11-22 01:37:56,281 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 01:37:56,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:37:56,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:37:56,283 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:37:56,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-22 01:37:56,418 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 01:37:56,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:37:56,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 01:37:56,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:37:56,453 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-22 01:37:56,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:37:56,488 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-22 01:37:56,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516013736] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:37:56,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [348121941] [2022-11-22 01:37:56,491 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-22 01:37:56,491 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:37:56,491 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:37:56,491 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:37:56,491 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:37:56,538 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-22 01:37:56,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-22 01:37:56,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-22 01:37:56,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:56,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:56,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2022-11-22 01:37:56,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:56,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:56,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-22 01:37:56,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:56,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:56,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-22 01:37:56,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:56,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:56,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-22 01:37:56,736 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-22 01:37:56,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2022-11-22 01:37:56,769 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-22 01:37:56,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2022-11-22 01:37:56,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:56,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:57,035 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:37:57,129 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-22 01:37:57,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 243 treesize of output 229 [2022-11-22 01:37:57,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:57,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:57,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:57,196 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:37:57,204 INFO L321 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-11-22 01:37:57,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 247 treesize of output 232 [2022-11-22 01:37:57,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:57,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:57,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 227 [2022-11-22 01:37:57,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:57,261 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:37:57,262 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:37:57,367 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-22 01:37:57,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 383 treesize of output 406 [2022-11-22 01:37:57,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:57,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 314 treesize of output 305 [2022-11-22 01:37:57,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:57,425 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:37:57,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 448 treesize of output 483 [2022-11-22 01:37:57,671 INFO L321 Elim1Store]: treesize reduction 35, result has 2.8 percent of original size [2022-11-22 01:37:57,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 214 treesize of output 157 [2022-11-22 01:37:57,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 101 [2022-11-22 01:37:57,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 19 [2022-11-22 01:37:57,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 60 [2022-11-22 01:37:57,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 36 [2022-11-22 01:37:57,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 19 [2022-11-22 01:37:57,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:57,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:57,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:57,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:57,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:57,872 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:37:57,879 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-22 01:37:57,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 612 treesize of output 567 [2022-11-22 01:37:58,135 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-22 01:37:58,141 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-22 01:37:58,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:58,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:58,181 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:37:58,256 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-22 01:37:58,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 189 [2022-11-22 01:37:58,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:58,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:58,283 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:37:58,284 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:37:58,314 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-22 01:37:58,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 173 [2022-11-22 01:37:58,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:58,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:58,365 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-22 01:37:58,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:58,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 11 [2022-11-22 01:37:58,436 INFO L321 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2022-11-22 01:37:58,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 142 treesize of output 101 [2022-11-22 01:37:58,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:58,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:58,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 71 [2022-11-22 01:37:58,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 53 [2022-11-22 01:37:58,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2022-11-22 01:37:58,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:58,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:37:58,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 30 [2022-11-22 01:37:58,572 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-22 01:37:58,577 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-22 01:37:58,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:37:58,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:37:58,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:37:58,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:37:58,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:37:58,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:37:58,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:37:58,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:37:58,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:37:58,858 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:37:59,872 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '642#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= 1 |ULTIMATE.start_dll_create_~data#1|) (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_dll_get_data_at_#in~index#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 |ULTIMATE.start_dll_create_#in~len#1|) (<= |ULTIMATE.start_dll_create_#res#1.offset| 0) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_dll_get_data_at_~head#1.base|) |ULTIMATE.start_dll_get_data_at_~head#1.offset|) |ULTIMATE.start_dll_get_data_at_#res#1|) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.base| |ULTIMATE.start_dll_get_data_at_~head#1.base|) (<= 0 (+ |ULTIMATE.start_dll_get_data_at_#res#1| 2147483648)) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.offset| |ULTIMATE.start_dll_get_data_at_~head#1.offset|) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_dll_get_data_at_#res#1| 2147483647) (<= |ULTIMATE.start_dll_create_~data#1| 1) (= |ULTIMATE.start_dll_get_data_at_~index#1| |ULTIMATE.start_dll_get_data_at_#in~index#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_dll_create_#in~len#1| 2) (<= |ULTIMATE.start_dll_create_~len#1| 0) (<= 1 |ULTIMATE.start_dll_create_#in~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= |ULTIMATE.start_dll_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_create_#res#1.offset|) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (not (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_get_data_at_#res#1|)) (= |#NULL.base| 0))' at error location [2022-11-22 01:37:59,873 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 01:37:59,873 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:37:59,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-11-22 01:37:59,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503318383] [2022-11-22 01:37:59,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:37:59,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-22 01:37:59,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:37:59,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-22 01:37:59,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2022-11-22 01:37:59,874 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:38:00,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:38:00,076 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-11-22 01:38:00,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 01:38:00,076 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-22 01:38:00,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:38:00,077 INFO L225 Difference]: With dead ends: 33 [2022-11-22 01:38:00,077 INFO L226 Difference]: Without dead ends: 26 [2022-11-22 01:38:00,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2022-11-22 01:38:00,078 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 34 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:38:00,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 34 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:38:00,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-22 01:38:00,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2022-11-22 01:38:00,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:38:00,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-11-22 01:38:00,086 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 17 [2022-11-22 01:38:00,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:38:00,087 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-11-22 01:38:00,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:38:00,087 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-11-22 01:38:00,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-22 01:38:00,088 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:38:00,088 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:38:00,093 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-22 01:38:00,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:38:00,291 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:38:00,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:38:00,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1814988096, now seen corresponding path program 1 times [2022-11-22 01:38:00,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:38:00,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621221340] [2022-11-22 01:38:00,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:38:00,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:38:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:38:01,653 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:38:01,654 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:38:01,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621221340] [2022-11-22 01:38:01,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621221340] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:38:01,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434335487] [2022-11-22 01:38:01,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:38:01,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:38:01,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:38:01,663 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:38:01,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-22 01:38:01,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:38:01,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-22 01:38:01,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:38:01,860 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-22 01:38:01,945 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 01:38:01,945 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-22 01:38:02,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-11-22 01:38:02,019 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 01:38:02,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2022-11-22 01:38:02,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-11-22 01:38:02,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 11 treesize of output 7 [2022-11-22 01:38:02,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-11-22 01:38:02,323 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:02,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-22 01:38:02,385 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-22 01:38:02,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-22 01:38:02,533 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:38:02,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:38:02,626 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_650 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_650) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_650 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_650) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-11-22 01:38:02,848 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| |c_ULTIMATE.start_dll_update_at_~data#1|))) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_649 Int) (v_ArrVal_650 (Array Int Int))) (<= (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store .cse1 |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_649)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_650) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_649 Int) (v_ArrVal_650 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store .cse1 |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_649)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_650) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-11-22 01:38:05,051 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:38:05,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 78 [2022-11-22 01:38:05,083 INFO L321 Elim1Store]: treesize reduction 10, result has 70.6 percent of original size [2022-11-22 01:38:05,083 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-22 01:38:05,108 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:38:05,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 7 treesize of output 6 [2022-11-22 01:38:05,130 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:38:05,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 42 [2022-11-22 01:38:05,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 66 [2022-11-22 01:38:05,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2022-11-22 01:38:05,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2022-11-22 01:38:05,166 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:38:05,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 40 [2022-11-22 01:38:05,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-22 01:38:05,296 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-22 01:38:05,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434335487] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:38:05,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [786689772] [2022-11-22 01:38:05,298 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-22 01:38:05,298 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:38:05,298 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:38:05,298 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:38:05,298 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:38:05,344 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-22 01:38:05,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-22 01:38:05,392 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-22 01:38:05,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-22 01:38:05,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:05,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:05,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-22 01:38:05,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:05,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:05,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2022-11-22 01:38:05,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:05,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:05,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-22 01:38:05,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:05,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:05,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-22 01:38:05,657 INFO L321 Elim1Store]: treesize reduction 54, result has 27.0 percent of original size [2022-11-22 01:38:05,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 227 treesize of output 235 [2022-11-22 01:38:05,737 INFO L321 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2022-11-22 01:38:05,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 230 treesize of output 245 [2022-11-22 01:38:06,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:06,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:06,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:06,130 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:06,284 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-22 01:38:06,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 323 treesize of output 301 [2022-11-22 01:38:06,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:06,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:06,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:06,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:06,389 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:06,396 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-22 01:38:06,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 327 treesize of output 304 [2022-11-22 01:38:06,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:06,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:06,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 316 treesize of output 307 [2022-11-22 01:38:06,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:06,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:06,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 316 treesize of output 307 [2022-11-22 01:38:06,521 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:06,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:06,523 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:06,593 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-22 01:38:06,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 463 treesize of output 481 [2022-11-22 01:38:06,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:06,627 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:06,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 534 treesize of output 569 [2022-11-22 01:38:07,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 104 [2022-11-22 01:38:07,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 68 [2022-11-22 01:38:07,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2022-11-22 01:38:07,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:07,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:07,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:07,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:07,122 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:07,130 INFO L321 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2022-11-22 01:38:07,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 804 treesize of output 751 [2022-11-22 01:38:07,243 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-22 01:38:07,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 899 treesize of output 800 [2022-11-22 01:38:07,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 782 treesize of output 646 [2022-11-22 01:38:07,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 763 treesize of output 733 [2022-11-22 01:38:07,406 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-22 01:38:07,414 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-22 01:38:07,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:07,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:07,451 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:07,513 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-22 01:38:07,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 184 [2022-11-22 01:38:07,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:07,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:07,553 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:07,554 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:07,597 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-22 01:38:07,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 173 [2022-11-22 01:38:07,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:07,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:07,648 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-22 01:38:07,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:07,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 11 [2022-11-22 01:38:07,700 INFO L321 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2022-11-22 01:38:07,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 30 [2022-11-22 01:38:07,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:07,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:07,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-11-22 01:38:07,736 INFO L321 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2022-11-22 01:38:07,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 30 [2022-11-22 01:38:07,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:07,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:07,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-11-22 01:38:07,831 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-22 01:38:07,837 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-22 01:38:07,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:38:07,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:38:07,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:38:07,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:38:08,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:38:08,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:38:08,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:38:08,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:38:08,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:38:08,182 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:38:09,582 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '887#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= 1 |ULTIMATE.start_dll_create_~data#1|) (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_dll_get_data_at_#in~index#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 |ULTIMATE.start_dll_create_#in~len#1|) (<= |ULTIMATE.start_dll_create_#res#1.offset| 0) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_dll_get_data_at_~head#1.base|) |ULTIMATE.start_dll_get_data_at_~head#1.offset|) |ULTIMATE.start_dll_get_data_at_#res#1|) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.base| |ULTIMATE.start_dll_get_data_at_~head#1.base|) (<= 0 (+ |ULTIMATE.start_dll_get_data_at_#res#1| 2147483648)) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.offset| |ULTIMATE.start_dll_get_data_at_~head#1.offset|) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_dll_get_data_at_#res#1| 2147483647) (<= |ULTIMATE.start_dll_create_~data#1| 1) (= |ULTIMATE.start_dll_get_data_at_~index#1| |ULTIMATE.start_dll_get_data_at_#in~index#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_dll_create_#in~len#1| 2) (<= |ULTIMATE.start_dll_create_~len#1| 0) (<= 1 |ULTIMATE.start_dll_create_#in~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= |ULTIMATE.start_dll_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_create_#res#1.offset|) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (not (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_get_data_at_#res#1|)) (= |#NULL.base| 0))' at error location [2022-11-22 01:38:09,582 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 01:38:09,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:38:09,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 39 [2022-11-22 01:38:09,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775343064] [2022-11-22 01:38:09,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:38:09,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-22 01:38:09,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:38:09,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-22 01:38:09,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1792, Unknown=22, NotChecked=174, Total=2162 [2022-11-22 01:38:09,585 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 39 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:38:11,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:38:11,322 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2022-11-22 01:38:11,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-22 01:38:11,323 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-22 01:38:11,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:38:11,323 INFO L225 Difference]: With dead ends: 44 [2022-11-22 01:38:11,323 INFO L226 Difference]: Without dead ends: 42 [2022-11-22 01:38:11,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=465, Invalid=3181, Unknown=22, NotChecked=238, Total=3906 [2022-11-22 01:38:11,326 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 197 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 9 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 01:38:11,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 86 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 422 Invalid, 15 Unknown, 70 Unchecked, 0.7s Time] [2022-11-22 01:38:11,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-22 01:38:11,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 27. [2022-11-22 01:38:11,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:38:11,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2022-11-22 01:38:11,344 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 18 [2022-11-22 01:38:11,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:38:11,344 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2022-11-22 01:38:11,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:38:11,345 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-11-22 01:38:11,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 01:38:11,345 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:38:11,346 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:38:11,356 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-22 01:38:11,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-22 01:38:11,557 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:38:11,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:38:11,557 INFO L85 PathProgramCache]: Analyzing trace with hash -280268398, now seen corresponding path program 2 times [2022-11-22 01:38:11,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:38:11,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354870792] [2022-11-22 01:38:11,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:38:11,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:38:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:38:11,647 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-22 01:38:11,647 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:38:11,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354870792] [2022-11-22 01:38:11,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354870792] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:38:11,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:38:11,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:38:11,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907269692] [2022-11-22 01:38:11,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:38:11,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:38:11,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:38:11,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:38:11,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:38:11,650 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:38:11,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:38:11,721 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-11-22 01:38:11,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:38:11,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-22 01:38:11,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:38:11,723 INFO L225 Difference]: With dead ends: 40 [2022-11-22 01:38:11,723 INFO L226 Difference]: Without dead ends: 30 [2022-11-22 01:38:11,723 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-22 01:38:11,724 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 7 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:38:11,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 18 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 01:38:11,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-22 01:38:11,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2022-11-22 01:38:11,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:38:11,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-11-22 01:38:11,746 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 19 [2022-11-22 01:38:11,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:38:11,747 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-11-22 01:38:11,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:38:11,747 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-11-22 01:38:11,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 01:38:11,748 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:38:11,748 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:38:11,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-22 01:38:11,749 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:38:11,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:38:11,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1047799090, now seen corresponding path program 3 times [2022-11-22 01:38:11,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:38:11,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188313332] [2022-11-22 01:38:11,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:38:11,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:38:11,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:38:11,881 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-22 01:38:11,881 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:38:11,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188313332] [2022-11-22 01:38:11,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188313332] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:38:11,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453643758] [2022-11-22 01:38:11,882 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 01:38:11,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:38:11,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:38:11,883 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:38:11,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-22 01:38:12,040 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 01:38:12,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:38:12,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 01:38:12,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:38:12,068 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-22 01:38:12,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:38:12,099 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-22 01:38:12,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453643758] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:38:12,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1349785386] [2022-11-22 01:38:12,101 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-22 01:38:12,102 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:38:12,102 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:38:12,102 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:38:12,102 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:38:12,142 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-22 01:38:12,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-22 01:38:12,183 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-22 01:38:12,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-22 01:38:12,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:12,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:12,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2022-11-22 01:38:12,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:12,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:12,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-22 01:38:12,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:12,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:12,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-22 01:38:12,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:12,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:12,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-22 01:38:12,384 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-22 01:38:12,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2022-11-22 01:38:12,436 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-22 01:38:12,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2022-11-22 01:38:12,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:12,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:12,757 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-22 01:38:12,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 235 treesize of output 221 [2022-11-22 01:38:12,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:12,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:12,829 INFO L321 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-11-22 01:38:12,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 239 treesize of output 224 [2022-11-22 01:38:12,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:12,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:12,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 219 [2022-11-22 01:38:12,887 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:12,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:12,890 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:12,890 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:12,891 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:12,960 INFO L321 Elim1Store]: treesize reduction 66, result has 32.0 percent of original size [2022-11-22 01:38:12,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 375 treesize of output 403 [2022-11-22 01:38:12,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:12,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:13,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 240 treesize of output 231 [2022-11-22 01:38:13,025 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:13,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:13,029 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:13,030 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:13,084 INFO L321 Elim1Store]: treesize reduction 74, result has 34.5 percent of original size [2022-11-22 01:38:13,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 362 treesize of output 386 [2022-11-22 01:38:13,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:13,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:13,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 383 treesize of output 330 [2022-11-22 01:38:13,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-22 01:38:13,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:13,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 310 treesize of output 296 [2022-11-22 01:38:13,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 54 [2022-11-22 01:38:13,229 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:13,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 17 [2022-11-22 01:38:13,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-22 01:38:13,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:13,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:13,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:13,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:13,396 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-22 01:38:13,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 346 treesize of output 301 [2022-11-22 01:38:13,568 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-22 01:38:13,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 01:38:13,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:13,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:13,611 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:13,611 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:13,666 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-22 01:38:13,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 185 [2022-11-22 01:38:13,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:13,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:13,697 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:13,736 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-22 01:38:13,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 159 [2022-11-22 01:38:13,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:13,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:13,775 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-22 01:38:13,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:13,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 11 [2022-11-22 01:38:13,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 67 [2022-11-22 01:38:13,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:13,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:13,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 45 [2022-11-22 01:38:13,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2022-11-22 01:38:13,929 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-22 01:38:13,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 169 treesize of output 144 [2022-11-22 01:38:13,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:13,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:13,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 92 [2022-11-22 01:38:13,977 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-22 01:38:13,984 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-22 01:38:14,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:38:14,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:38:14,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:38:14,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:38:14,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:38:14,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:38:14,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:38:14,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:38:14,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:38:14,316 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:38:15,262 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1277#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= 1 |ULTIMATE.start_dll_create_~data#1|) (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_dll_get_data_at_#in~index#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 |ULTIMATE.start_dll_create_#in~len#1|) (<= |ULTIMATE.start_dll_create_#res#1.offset| 0) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_dll_get_data_at_~head#1.base|) |ULTIMATE.start_dll_get_data_at_~head#1.offset|) |ULTIMATE.start_dll_get_data_at_#res#1|) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.base| |ULTIMATE.start_dll_get_data_at_~head#1.base|) (<= 0 (+ |ULTIMATE.start_dll_get_data_at_#res#1| 2147483648)) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.offset| |ULTIMATE.start_dll_get_data_at_~head#1.offset|) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_dll_get_data_at_#res#1| 2147483647) (<= |ULTIMATE.start_dll_create_~data#1| 1) (= |ULTIMATE.start_dll_get_data_at_~index#1| |ULTIMATE.start_dll_get_data_at_#in~index#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_dll_create_#in~len#1| 2) (<= |ULTIMATE.start_dll_create_~len#1| 0) (<= 1 |ULTIMATE.start_dll_create_#in~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= |ULTIMATE.start_dll_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_create_#res#1.offset|) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (not (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_get_data_at_#res#1|)) (= |#NULL.base| 0))' at error location [2022-11-22 01:38:15,262 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 01:38:15,262 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:38:15,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2022-11-22 01:38:15,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895683978] [2022-11-22 01:38:15,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:38:15,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 01:38:15,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:38:15,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 01:38:15,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2022-11-22 01:38:15,263 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:38:15,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:38:15,384 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2022-11-22 01:38:15,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 01:38:15,384 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-22 01:38:15,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:38:15,385 INFO L225 Difference]: With dead ends: 43 [2022-11-22 01:38:15,385 INFO L226 Difference]: Without dead ends: 35 [2022-11-22 01:38:15,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2022-11-22 01:38:15,386 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 60 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:38:15,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 18 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:38:15,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-22 01:38:15,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2022-11-22 01:38:15,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:38:15,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2022-11-22 01:38:15,399 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 19 [2022-11-22 01:38:15,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:38:15,399 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-11-22 01:38:15,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:38:15,400 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-11-22 01:38:15,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 01:38:15,400 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:38:15,400 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:38:15,410 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-22 01:38:15,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:38:15,606 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:38:15,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:38:15,607 INFO L85 PathProgramCache]: Analyzing trace with hash 428634211, now seen corresponding path program 1 times [2022-11-22 01:38:15,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:38:15,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501743971] [2022-11-22 01:38:15,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:38:15,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:38:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:38:15,689 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-22 01:38:15,689 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:38:15,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501743971] [2022-11-22 01:38:15,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501743971] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:38:15,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:38:15,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:38:15,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724501780] [2022-11-22 01:38:15,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:38:15,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:38:15,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:38:15,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:38:15,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:38:15,691 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:38:15,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:38:15,773 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-11-22 01:38:15,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:38:15,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-22 01:38:15,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:38:15,774 INFO L225 Difference]: With dead ends: 36 [2022-11-22 01:38:15,774 INFO L226 Difference]: Without dead ends: 31 [2022-11-22 01:38:15,774 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-22 01:38:15,775 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 9 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:38:15,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 20 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:38:15,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-22 01:38:15,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2022-11-22 01:38:15,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:38:15,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2022-11-22 01:38:15,788 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 19 [2022-11-22 01:38:15,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:38:15,789 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2022-11-22 01:38:15,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:38:15,789 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-11-22 01:38:15,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-22 01:38:15,789 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:38:15,789 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:38:15,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-22 01:38:15,790 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:38:15,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:38:15,790 INFO L85 PathProgramCache]: Analyzing trace with hash 993692610, now seen corresponding path program 1 times [2022-11-22 01:38:15,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:38:15,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605323415] [2022-11-22 01:38:15,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:38:15,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:38:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:38:15,895 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-22 01:38:15,895 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:38:15,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605323415] [2022-11-22 01:38:15,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605323415] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:38:15,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010647160] [2022-11-22 01:38:15,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:38:15,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:38:15,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:38:15,897 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:38:15,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-22 01:38:16,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:38:16,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 01:38:16,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:38:16,103 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-22 01:38:16,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:38:16,126 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-22 01:38:16,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010647160] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:38:16,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1076195688] [2022-11-22 01:38:16,128 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-22 01:38:16,129 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:38:16,129 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:38:16,129 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:38:16,129 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:38:16,172 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-22 01:38:16,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-22 01:38:16,220 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-22 01:38:16,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-22 01:38:16,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:16,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:16,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-22 01:38:16,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:16,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:16,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-22 01:38:16,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:16,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:16,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2022-11-22 01:38:16,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:16,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:16,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-22 01:38:16,393 INFO L321 Elim1Store]: treesize reduction 54, result has 27.0 percent of original size [2022-11-22 01:38:16,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 227 treesize of output 235 [2022-11-22 01:38:16,470 INFO L321 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2022-11-22 01:38:16,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 230 treesize of output 245 [2022-11-22 01:38:16,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:16,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:16,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:16,939 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-22 01:38:16,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 235 treesize of output 221 [2022-11-22 01:38:16,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:16,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:17,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:17,034 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-22 01:38:17,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 239 treesize of output 224 [2022-11-22 01:38:17,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:17,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:17,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 219 [2022-11-22 01:38:17,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:17,094 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:17,095 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:17,096 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:17,186 INFO L321 Elim1Store]: treesize reduction 66, result has 32.0 percent of original size [2022-11-22 01:38:17,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 375 treesize of output 398 [2022-11-22 01:38:17,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:17,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 306 treesize of output 297 [2022-11-22 01:38:17,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:17,256 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:17,257 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:17,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 440 treesize of output 475 [2022-11-22 01:38:17,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:17,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:17,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:17,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:17,336 INFO L321 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2022-11-22 01:38:17,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 367 treesize of output 322 [2022-11-22 01:38:17,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 65 [2022-11-22 01:38:17,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:17,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-22 01:38:17,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-11-22 01:38:17,684 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-22 01:38:17,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 657 treesize of output 572 [2022-11-22 01:38:17,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 554 treesize of output 430 [2022-11-22 01:38:17,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 516 treesize of output 512 [2022-11-22 01:38:17,799 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-22 01:38:17,806 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-22 01:38:17,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:17,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:17,857 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:17,859 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:17,898 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-22 01:38:17,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 180 [2022-11-22 01:38:17,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:17,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:17,936 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:17,975 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-22 01:38:17,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 164 [2022-11-22 01:38:18,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:18,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:18,017 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-22 01:38:18,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:18,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 11 [2022-11-22 01:38:18,110 INFO L321 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2022-11-22 01:38:18,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 142 treesize of output 101 [2022-11-22 01:38:18,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:18,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:18,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 71 [2022-11-22 01:38:18,147 INFO L321 Elim1Store]: treesize reduction 35, result has 2.8 percent of original size [2022-11-22 01:38:18,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 194 treesize of output 145 [2022-11-22 01:38:18,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:18,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:18,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 91 [2022-11-22 01:38:18,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2022-11-22 01:38:18,201 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-22 01:38:18,207 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-22 01:38:18,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:38:18,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:38:18,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:38:18,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:38:18,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:38:18,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:38:18,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:38:18,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:38:18,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:38:18,574 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:38:20,157 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1643#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= 1 |ULTIMATE.start_dll_create_~data#1|) (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_dll_get_data_at_#in~index#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 |ULTIMATE.start_dll_create_#in~len#1|) (<= |ULTIMATE.start_dll_create_#res#1.offset| 0) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_dll_get_data_at_~head#1.base|) |ULTIMATE.start_dll_get_data_at_~head#1.offset|) |ULTIMATE.start_dll_get_data_at_#res#1|) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.base| |ULTIMATE.start_dll_get_data_at_~head#1.base|) (<= 0 (+ |ULTIMATE.start_dll_get_data_at_#res#1| 2147483648)) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.offset| |ULTIMATE.start_dll_get_data_at_~head#1.offset|) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_dll_get_data_at_#res#1| 2147483647) (<= |ULTIMATE.start_dll_create_~data#1| 1) (= |ULTIMATE.start_dll_get_data_at_~index#1| |ULTIMATE.start_dll_get_data_at_#in~index#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_dll_create_#in~len#1| 2) (<= |ULTIMATE.start_dll_create_~len#1| 0) (<= 1 |ULTIMATE.start_dll_create_#in~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= |ULTIMATE.start_dll_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_create_#res#1.offset|) (= |ULTIMATE.start_dll_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (not (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_get_data_at_#res#1|)) (= |#NULL.base| 0))' at error location [2022-11-22 01:38:20,157 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 01:38:20,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:38:20,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-11-22 01:38:20,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523016630] [2022-11-22 01:38:20,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:38:20,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 01:38:20,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:38:20,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 01:38:20,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-11-22 01:38:20,159 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:38:20,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:38:20,273 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-11-22 01:38:20,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:38:20,274 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-22 01:38:20,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:38:20,274 INFO L225 Difference]: With dead ends: 36 [2022-11-22 01:38:20,274 INFO L226 Difference]: Without dead ends: 31 [2022-11-22 01:38:20,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-11-22 01:38:20,275 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 20 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:38:20,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 21 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:38:20,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-22 01:38:20,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-11-22 01:38:20,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:38:20,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-11-22 01:38:20,289 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 21 [2022-11-22 01:38:20,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:38:20,290 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-11-22 01:38:20,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:38:20,290 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-11-22 01:38:20,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-22 01:38:20,291 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:38:20,291 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:38:20,301 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-22 01:38:20,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:38:20,497 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:38:20,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:38:20,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1880581264, now seen corresponding path program 4 times [2022-11-22 01:38:20,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:38:20,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702882303] [2022-11-22 01:38:20,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:38:20,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:38:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:38:20,671 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:38:20,672 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:38:20,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702882303] [2022-11-22 01:38:20,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702882303] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:38:20,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48893603] [2022-11-22 01:38:20,672 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-22 01:38:20,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:38:20,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:38:20,674 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:38:20,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-22 01:38:20,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:38:20,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 01:38:20,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:38:20,964 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-22 01:38:20,964 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:38:20,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48893603] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:38:20,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 01:38:20,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2022-11-22 01:38:20,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454847998] [2022-11-22 01:38:20,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:38:20,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 01:38:20,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:38:20,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 01:38:20,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-22 01:38:20,966 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:38:21,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:38:21,029 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-11-22 01:38:21,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 01:38:21,029 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-22 01:38:21,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:38:21,030 INFO L225 Difference]: With dead ends: 35 [2022-11-22 01:38:21,030 INFO L226 Difference]: Without dead ends: 23 [2022-11-22 01:38:21,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-22 01:38:21,031 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 13 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:38:21,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 12 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:38:21,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-22 01:38:21,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-22 01:38:21,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:38:21,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-11-22 01:38:21,042 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 21 [2022-11-22 01:38:21,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:38:21,042 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-11-22 01:38:21,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:38:21,043 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-11-22 01:38:21,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 01:38:21,043 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:38:21,043 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:38:21,050 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-22 01:38:21,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-22 01:38:21,249 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:38:21,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:38:21,250 INFO L85 PathProgramCache]: Analyzing trace with hash 738277921, now seen corresponding path program 1 times [2022-11-22 01:38:21,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:38:21,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473006657] [2022-11-22 01:38:21,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:38:21,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:38:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:38:22,724 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:38:22,724 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:38:22,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473006657] [2022-11-22 01:38:22,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473006657] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:38:22,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934240495] [2022-11-22 01:38:22,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:38:22,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:38:22,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:38:22,727 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:38:22,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-22 01:38:22,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:38:22,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 97 conjunts are in the unsatisfiable core [2022-11-22 01:38:22,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:38:22,970 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-22 01:38:23,060 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 01:38:23,060 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-22 01:38:23,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-11-22 01:38:23,142 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 01:38:23,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2022-11-22 01:38:23,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:23,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:23,349 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:38:23,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2022-11-22 01:38:23,617 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 01:38:23,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 72 [2022-11-22 01:38:23,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2022-11-22 01:38:23,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:23,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2022-11-22 01:38:23,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 37 [2022-11-22 01:38:23,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-11-22 01:38:24,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-22 01:38:24,100 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:38:24,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:38:24,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 64 [2022-11-22 01:38:24,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 64 [2022-11-22 01:38:24,615 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:38:24,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 43 [2022-11-22 01:38:24,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-11-22 01:38:25,111 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:38:25,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 89 [2022-11-22 01:38:25,150 INFO L321 Elim1Store]: treesize reduction 10, result has 70.6 percent of original size [2022-11-22 01:38:25,150 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-22 01:38:25,179 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:38:25,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 68 [2022-11-22 01:38:25,221 INFO L321 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2022-11-22 01:38:25,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 10 treesize of output 11 [2022-11-22 01:38:25,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-11-22 01:38:25,244 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:25,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-22 01:38:25,252 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:38:25,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 9 [2022-11-22 01:38:25,466 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:38:25,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934240495] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:38:25,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [377814489] [2022-11-22 01:38:25,469 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-22 01:38:25,469 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:38:25,470 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:38:25,470 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:38:25,470 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:38:25,517 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-22 01:38:25,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-22 01:38:25,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-22 01:38:25,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:25,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:25,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-22 01:38:25,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:25,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:25,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-22 01:38:25,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:25,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:25,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2022-11-22 01:38:25,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:25,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:25,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-22 01:38:25,737 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-22 01:38:25,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2022-11-22 01:38:25,771 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-22 01:38:25,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2022-11-22 01:38:25,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:25,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:26,028 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:26,131 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-22 01:38:26,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 243 treesize of output 229 [2022-11-22 01:38:26,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:26,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:26,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:26,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:26,206 INFO L321 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-11-22 01:38:26,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 247 treesize of output 232 [2022-11-22 01:38:26,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:26,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:26,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 227 [2022-11-22 01:38:26,286 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:26,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:26,288 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:26,416 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-22 01:38:26,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 383 treesize of output 406 [2022-11-22 01:38:26,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:26,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 314 treesize of output 305 [2022-11-22 01:38:26,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:26,478 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:26,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 448 treesize of output 478 [2022-11-22 01:38:26,596 INFO L321 Elim1Store]: treesize reduction 35, result has 2.8 percent of original size [2022-11-22 01:38:26,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 220 treesize of output 165 [2022-11-22 01:38:26,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 113 [2022-11-22 01:38:26,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 19 [2022-11-22 01:38:26,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:26,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:26,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:26,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:26,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:26,734 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:26,741 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-22 01:38:26,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 397 treesize of output 352 [2022-11-22 01:38:26,922 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-22 01:38:26,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 725 treesize of output 644 [2022-11-22 01:38:26,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 644 treesize of output 564 [2022-11-22 01:38:26,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 579 treesize of output 559 [2022-11-22 01:38:27,046 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-22 01:38:27,053 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-22 01:38:27,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:27,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:27,086 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:27,161 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-22 01:38:27,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 184 [2022-11-22 01:38:27,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:27,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:27,195 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:27,196 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:27,224 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-22 01:38:27,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 178 [2022-11-22 01:38:27,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:27,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-22 01:38:27,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:27,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-22 01:38:27,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:27,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 11 [2022-11-22 01:38:27,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 67 [2022-11-22 01:38:27,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:27,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:27,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 45 [2022-11-22 01:38:27,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2022-11-22 01:38:27,425 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-22 01:38:27,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 169 treesize of output 144 [2022-11-22 01:38:27,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:27,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:27,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 92 [2022-11-22 01:38:27,493 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-22 01:38:27,499 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-22 01:38:27,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:38:27,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:38:27,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:38:27,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:38:27,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:38:27,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:38:27,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:38:27,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:38:27,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:38:28,170 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:38:29,831 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2101#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_dll_get_data_at_#in~head#1.offset| 0) (<= 1 |ULTIMATE.start_dll_create_~data#1|) (<= 2 |ULTIMATE.start_dll_create_#in~len#1|) (<= |ULTIMATE.start_dll_create_#res#1.offset| 0) (<= 0 (+ |ULTIMATE.start_dll_get_data_at_#res#1| 2147483648)) (<= |ULTIMATE.start_dll_get_data_at_~index#1| 0) (<= |ULTIMATE.start_dll_get_data_at_#res#1| 2147483647) (<= |ULTIMATE.start_dll_create_~data#1| 1) (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |ULTIMATE.start_dll_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_dll_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_dll_get_data_at_#in~index#1|) (<= |ULTIMATE.start_dll_create_~len#1| 0) (<= 1 |ULTIMATE.start_dll_create_#in~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= |ULTIMATE.start_dll_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|) (<= 2 |ULTIMATE.start_main_~expected~0#1|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_create_#res#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-22 01:38:29,832 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 01:38:29,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:38:29,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 46 [2022-11-22 01:38:29,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259081207] [2022-11-22 01:38:29,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:38:29,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-22 01:38:29,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:38:29,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-22 01:38:29,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2645, Unknown=17, NotChecked=0, Total=2862 [2022-11-22 01:38:29,834 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 46 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:38:31,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:38:31,708 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-11-22 01:38:31,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-22 01:38:31,708 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-22 01:38:31,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:38:31,709 INFO L225 Difference]: With dead ends: 29 [2022-11-22 01:38:31,709 INFO L226 Difference]: Without dead ends: 26 [2022-11-22 01:38:31,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1073 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=517, Invalid=4296, Unknown=17, NotChecked=0, Total=4830 [2022-11-22 01:38:31,711 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 148 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-22 01:38:31,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 44 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-22 01:38:31,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-22 01:38:31,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2022-11-22 01:38:31,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:38:31,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-11-22 01:38:31,721 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2022-11-22 01:38:31,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:38:31,722 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-11-22 01:38:31,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:38:31,722 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-11-22 01:38:31,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-22 01:38:31,722 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:38:31,722 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:38:31,728 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-22 01:38:31,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-22 01:38:31,927 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:38:31,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:38:31,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1410357154, now seen corresponding path program 2 times [2022-11-22 01:38:31,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:38:31,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494964857] [2022-11-22 01:38:31,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:38:31,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:38:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:38:32,038 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-22 01:38:32,039 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:38:32,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494964857] [2022-11-22 01:38:32,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494964857] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:38:32,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771423933] [2022-11-22 01:38:32,039 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:38:32,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:38:32,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:38:32,041 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:38:32,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-22 01:38:32,251 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-22 01:38:32,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:38:32,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 01:38:32,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:38:32,297 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-22 01:38:32,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:38:32,347 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-22 01:38:32,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771423933] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:38:32,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [928524349] [2022-11-22 01:38:32,349 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-22 01:38:32,349 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:38:32,349 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:38:32,349 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:38:32,349 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:38:32,393 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-22 01:38:32,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-22 01:38:32,436 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-22 01:38:32,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-22 01:38:32,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:32,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:32,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-22 01:38:32,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:32,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:32,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-22 01:38:32,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:32,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:32,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2022-11-22 01:38:32,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:32,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:32,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-22 01:38:32,675 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-22 01:38:32,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2022-11-22 01:38:32,717 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-22 01:38:32,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2022-11-22 01:38:32,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:32,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:33,060 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:33,152 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-22 01:38:33,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 243 treesize of output 229 [2022-11-22 01:38:33,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:33,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:33,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:33,223 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:33,231 INFO L321 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-11-22 01:38:33,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 247 treesize of output 232 [2022-11-22 01:38:33,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:33,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:33,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 227 [2022-11-22 01:38:33,291 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:33,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:33,293 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:33,390 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-22 01:38:33,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 383 treesize of output 401 [2022-11-22 01:38:33,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:33,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 314 treesize of output 305 [2022-11-22 01:38:33,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:33,449 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:33,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 448 treesize of output 483 [2022-11-22 01:38:33,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:33,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:33,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:33,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:33,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:33,516 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:33,522 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-22 01:38:33,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 397 treesize of output 352 [2022-11-22 01:38:33,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 65 [2022-11-22 01:38:33,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-22 01:38:33,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2022-11-22 01:38:33,694 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-22 01:38:33,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 561 treesize of output 488 [2022-11-22 01:38:33,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 470 treesize of output 386 [2022-11-22 01:38:33,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 356 treesize of output 326 [2022-11-22 01:38:33,908 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-22 01:38:33,914 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-22 01:38:33,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:33,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:33,951 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:34,012 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-22 01:38:34,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 184 [2022-11-22 01:38:34,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:34,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:34,042 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:34,043 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:38:34,086 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-22 01:38:34,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 173 [2022-11-22 01:38:34,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:34,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:34,133 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-22 01:38:34,180 INFO L321 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2022-11-22 01:38:34,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 30 [2022-11-22 01:38:34,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:34,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:34,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-11-22 01:38:34,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:34,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 11 [2022-11-22 01:38:34,253 INFO L321 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2022-11-22 01:38:34,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 142 treesize of output 101 [2022-11-22 01:38:34,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:34,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:38:34,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 71 [2022-11-22 01:38:34,342 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-22 01:38:34,348 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-22 01:38:34,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:38:34,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:38:34,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:38:34,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:38:34,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:38:34,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:38:34,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:38:34,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:38:34,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:38:35,026 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:38:36,063 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2366#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_dll_get_data_at_#in~head#1.offset| 0) (<= 1 |ULTIMATE.start_dll_create_~data#1|) (<= 2 |ULTIMATE.start_dll_create_#in~len#1|) (<= |ULTIMATE.start_dll_create_#res#1.offset| 0) (<= 0 (+ |ULTIMATE.start_dll_get_data_at_#res#1| 2147483648)) (<= |ULTIMATE.start_dll_get_data_at_~index#1| 0) (<= |ULTIMATE.start_dll_get_data_at_#res#1| 2147483647) (<= |ULTIMATE.start_dll_create_~data#1| 1) (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |ULTIMATE.start_dll_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_dll_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_dll_get_data_at_#in~index#1|) (<= |ULTIMATE.start_dll_create_~len#1| 0) (<= 1 |ULTIMATE.start_dll_create_#in~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= |ULTIMATE.start_dll_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|) (<= 2 |ULTIMATE.start_main_~expected~0#1|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_create_#res#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-22 01:38:36,064 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 01:38:36,064 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:38:36,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 7 [2022-11-22 01:38:36,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531331481] [2022-11-22 01:38:36,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:38:36,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 01:38:36,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:38:36,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 01:38:36,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-11-22 01:38:36,065 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:38:36,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:38:36,168 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-11-22 01:38:36,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 01:38:36,169 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-22 01:38:36,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:38:36,169 INFO L225 Difference]: With dead ends: 24 [2022-11-22 01:38:36,169 INFO L226 Difference]: Without dead ends: 0 [2022-11-22 01:38:36,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2022-11-22 01:38:36,170 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 12 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:38:36,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 11 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:38:36,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-22 01:38:36,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-22 01:38:36,171 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-22 01:38:36,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-22 01:38:36,172 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2022-11-22 01:38:36,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:38:36,172 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-22 01:38:36,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:38:36,172 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-22 01:38:36,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-22 01:38:36,175 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-22 01:38:36,181 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-22 01:38:36,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:38:36,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-22 01:38:41,158 INFO L902 garLoopResultBuilder]: At program point myexitENTRY(lines 572 574) the Hoare annotation is: true [2022-11-22 01:38:41,159 INFO L902 garLoopResultBuilder]: At program point L573(line 573) the Hoare annotation is: true [2022-11-22 01:38:41,159 INFO L899 garLoopResultBuilder]: For program point myexitEXIT(lines 572 574) no Hoare annotation was computed. [2022-11-22 01:38:41,159 INFO L899 garLoopResultBuilder]: For program point L589(lines 589 591) no Hoare annotation was computed. [2022-11-22 01:38:41,159 INFO L899 garLoopResultBuilder]: For program point L589-1(lines 589 591) no Hoare annotation was computed. [2022-11-22 01:38:41,159 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-22 01:38:41,159 INFO L902 garLoopResultBuilder]: At program point L590(line 590) the Hoare annotation is: true [2022-11-22 01:38:41,159 INFO L895 garLoopResultBuilder]: At program point L633-3(lines 633 638) the Hoare annotation is: (let ((.cse33 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse35 (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse31 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) .cse35)) (.cse30 (select .cse33 .cse35)) (.cse32 (+ |ULTIMATE.start_main_~len~0#1| 1)) (.cse34 (select .cse33 4))) (let ((.cse0 (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)) (.cse1 (<= 1 |ULTIMATE.start_dll_create_~data#1|)) (.cse2 (not (= 0 .cse34))) (.cse3 (<= 2 |ULTIMATE.start_dll_create_#in~len#1|)) (.cse4 (not (= |ULTIMATE.start_main_~s~0#1.base| .cse34))) (.cse5 (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))) (.cse6 (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)) (.cse7 (= .cse32 |ULTIMATE.start_dll_update_at_~data#1|)) (.cse8 (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)) (.cse9 (<= |ULTIMATE.start_dll_create_~len#1| 2)) (.cse10 (<= |#NULL.offset| 0)) (.cse11 (<= |ULTIMATE.start_dll_create_~data#1| 1)) (.cse12 (<= |ULTIMATE.start_dll_update_at_~index#1| 0)) (.cse13 (<= 0 |ULTIMATE.start_main_~i~0#1|)) (.cse14 (= .cse30 |ULTIMATE.start_dll_update_at_~head#1.base|)) (.cse15 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse16 (<= |ULTIMATE.start_dll_create_#in~len#1| 2)) (.cse17 (<= 1 |ULTIMATE.start_dll_create_#in~data#1|)) (.cse18 (= (select .cse33 8) 0)) (.cse19 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse20 (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))) (.cse21 (<= |ULTIMATE.start_dll_create_#in~data#1| 1)) (.cse22 (<= |ULTIMATE.start_dll_create_~head~0#1.offset| 0)) (.cse23 (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|)) (.cse24 (= |ULTIMATE.start_dll_update_at_~head#1.offset| .cse31)) (.cse25 (<= 0 |#NULL.offset|)) (.cse26 (<= 0 |#StackHeapBarrier|)) (.cse27 (= (select (select |#memory_int| .cse30) .cse31) .cse32)) (.cse28 (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse29 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |ULTIMATE.start_main_~i~0#1| 1) .cse10 (<= |ULTIMATE.start_dll_get_data_at_~index#1| 0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse29) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~i~0#1| 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~len~0#1|) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29))))) [2022-11-22 01:38:41,159 INFO L902 garLoopResultBuilder]: At program point L642(lines 624 643) the Hoare annotation is: true [2022-11-22 01:38:41,160 INFO L895 garLoopResultBuilder]: At program point L618-2(lines 618 621) the Hoare annotation is: (let ((.cse14 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse34 (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse35 (select .cse34 4)) (.cse30 (select .cse14 4))) (let ((.cse6 (= (+ |ULTIMATE.start_main_~len~0#1| 1) |ULTIMATE.start_dll_update_at_~data#1|)) (.cse9 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse13 (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~len~0#1|)) (.cse0 (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)) (.cse1 (<= 1 |ULTIMATE.start_dll_create_~data#1|)) (.cse29 (not (= 0 .cse30))) (.cse2 (<= 2 |ULTIMATE.start_dll_create_#in~len#1|)) (.cse3 (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))) (.cse4 (not (= |ULTIMATE.start_dll_create_~head~0#1.base| .cse35))) (.cse31 (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_update_at_~head#1.base|)) (.cse5 (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)) (.cse7 (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)) (.cse8 (<= |ULTIMATE.start_dll_create_~len#1| 2)) (.cse10 (<= |#NULL.offset| 0)) (.cse11 (<= |ULTIMATE.start_dll_create_~data#1| 1)) (.cse12 (not (= .cse35 0))) (.cse16 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse17 (<= |ULTIMATE.start_dll_create_#in~len#1| 2)) (.cse18 (<= 1 |ULTIMATE.start_dll_create_#in~data#1|)) (.cse19 (= (select .cse14 8) 0)) (.cse20 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse21 (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))) (.cse22 (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0)) (.cse23 (<= |ULTIMATE.start_dll_create_#in~data#1| 1)) (.cse24 (= (select .cse34 8) 0)) (.cse25 (<= 0 |#NULL.offset|)) (.cse32 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_update_at_~head#1.offset|)) (.cse26 (<= 0 |#StackHeapBarrier|)) (.cse27 (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse28 (= |#NULL.base| 0))) (or (let ((.cse15 (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= |ULTIMATE.start_dll_update_at_~index#1| 0) (= (select .cse14 .cse15) |ULTIMATE.start_dll_update_at_~head#1.base|) .cse16 (forall ((v_ArrVal_650 (Array Int Int))) (<= |ULTIMATE.start_main_~len~0#1| (select (select (store |#memory_int| |ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_650) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (not (= |ULTIMATE.start_dll_update_at_~head#1.base| 0)) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (= |ULTIMATE.start_dll_update_at_~head#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) .cse15)) .cse24 .cse25 .cse26 .cse27 .cse28)) (and .cse0 .cse1 (<= 1 |ULTIMATE.start_dll_update_at_~index#1|) .cse29 .cse2 (not (= |ULTIMATE.start_main_~s~0#1.base| .cse30)) .cse3 .cse4 .cse31 .cse5 .cse6 .cse7 (<= |ULTIMATE.start_dll_update_at_~index#1| 1) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse32 .cse26 .cse27 .cse28) (let ((.cse33 (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|))) (and .cse0 .cse1 .cse29 (= |ULTIMATE.start_main_~i~0#1| 0) .cse2 .cse3 .cse4 .cse31 .cse5 .cse7 .cse8 .cse10 .cse11 .cse12 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) 4) |ULTIMATE.start_dll_update_at_~head#1.base|)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (<= |ULTIMATE.start_dll_update_at_~data#1| .cse33) .cse24 .cse25 .cse32 .cse26 (<= .cse33 |ULTIMATE.start_dll_update_at_~data#1|) (= |ULTIMATE.start_dll_update_at_~index#1| 0) .cse27 .cse28)))))) [2022-11-22 01:38:41,160 INFO L899 garLoopResultBuilder]: For program point L635(lines 635 637) no Hoare annotation was computed. [2022-11-22 01:38:41,160 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 641) no Hoare annotation was computed. [2022-11-22 01:38:41,161 INFO L895 garLoopResultBuilder]: At program point L611-2(lines 611 614) the Hoare annotation is: (let ((.cse42 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse44 (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse40 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) .cse44)) (.cse39 (select .cse42 .cse44)) (.cse41 (+ |ULTIMATE.start_main_~len~0#1| 1)) (.cse43 (select .cse42 4)) (.cse38 (select (select |#memory_int| |ULTIMATE.start_dll_get_data_at_~head#1.base|) |ULTIMATE.start_dll_get_data_at_~head#1.offset|))) (let ((.cse15 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse0 (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)) (.cse1 (<= 1 |ULTIMATE.start_dll_create_~data#1|)) (.cse37 (= .cse38 |ULTIMATE.start_main_~expected~0#1|)) (.cse2 (not (= 0 .cse43))) (.cse3 (<= 2 |ULTIMATE.start_dll_create_#in~len#1|)) (.cse5 (not (= |ULTIMATE.start_main_~s~0#1.base| .cse43))) (.cse6 (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))) (.cse7 (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)) (.cse9 (= .cse41 |ULTIMATE.start_dll_update_at_~data#1|)) (.cse10 (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)) (.cse12 (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|)) (.cse13 (= |ULTIMATE.start_dll_get_data_at_~head#1.offset| 0)) (.cse14 (<= |ULTIMATE.start_dll_create_~len#1| 2)) (.cse16 (<= |#NULL.offset| 0)) (.cse17 (<= |ULTIMATE.start_dll_create_~data#1| 1)) (.cse18 (<= |ULTIMATE.start_dll_update_at_~index#1| 0)) (.cse19 (<= 0 |ULTIMATE.start_main_~i~0#1|)) (.cse20 (= .cse39 |ULTIMATE.start_dll_update_at_~head#1.base|)) (.cse21 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse22 (<= |ULTIMATE.start_dll_create_#in~len#1| 2)) (.cse23 (<= 1 |ULTIMATE.start_dll_create_#in~data#1|)) (.cse24 (= (select .cse42 8) 0)) (.cse25 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse26 (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))) (.cse27 (<= |ULTIMATE.start_dll_create_#in~data#1| 1)) (.cse28 (<= |ULTIMATE.start_dll_create_~head~0#1.offset| 0)) (.cse29 (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|)) (.cse30 (= |ULTIMATE.start_dll_update_at_~head#1.offset| .cse40)) (.cse31 (<= 0 |#NULL.offset|)) (.cse32 (<= 0 |#StackHeapBarrier|)) (.cse33 (= (select (select |#memory_int| .cse39) .cse40) .cse41)) (.cse34 (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse35 (= |#NULL.base| 0))) (or (let ((.cse11 (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_get_data_at_~head#1.base|))) (let ((.cse4 (let ((.cse36 (+ |ULTIMATE.start_dll_get_data_at_~head#1.offset| 4))) (select (select |#memory_int| (select .cse11 .cse36)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_get_data_at_~head#1.base|) .cse36)))) (.cse8 (select .cse11 4))) (and .cse0 (<= 1 |ULTIMATE.start_dll_get_data_at_~index#1|) .cse1 .cse2 .cse3 (= .cse4 |ULTIMATE.start_main_~expected~0#1|) .cse5 .cse6 (= .cse4 3) .cse7 (not (= |ULTIMATE.start_dll_get_data_at_~head#1.base| .cse8)) .cse9 .cse10 (= (select .cse11 8) 0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (<= |ULTIMATE.start_dll_get_data_at_~index#1| 1) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 (not (= 0 .cse8)) .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35))) (and .cse0 .cse1 .cse37 .cse2 .cse3 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 (<= |ULTIMATE.start_dll_get_data_at_~index#1| 0) .cse17 .cse18 .cse19 .cse20 (= 3 .cse38) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 (not (= |ULTIMATE.start_dll_get_data_at_~head#1.base| 0)) .cse33 .cse34 .cse35) (and .cse0 .cse1 .cse37 .cse2 (= |ULTIMATE.start_main_~i~0#1| 0) .cse3 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 .cse14 .cse16 .cse17 (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~len~0#1|) .cse18 .cse19 .cse20 .cse21 .cse22 (= 2 .cse38) (= |ULTIMATE.start_dll_get_data_at_~index#1| 0) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35))))) [2022-11-22 01:38:41,161 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-22 01:38:41,161 INFO L895 garLoopResultBuilder]: At program point L636(lines 624 643) the Hoare annotation is: false [2022-11-22 01:38:41,161 INFO L895 garLoopResultBuilder]: At program point L587-2(lines 587 600) the Hoare annotation is: (let ((.cse9 (<= |ULTIMATE.start_dll_create_~head~0#1.offset| 0)) (.cse10 (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|)) (.cse14 (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)) (.cse0 (<= 1 |ULTIMATE.start_dll_create_~data#1|)) (.cse1 (<= 2 |ULTIMATE.start_dll_create_#in~len#1|)) (.cse15 (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))) (.cse16 (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)) (.cse17 (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)) (.cse18 (<= |ULTIMATE.start_dll_create_~len#1| 2)) (.cse2 (<= |#NULL.offset| 0)) (.cse3 (<= |ULTIMATE.start_dll_create_~data#1| 1)) (.cse4 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse5 (<= |ULTIMATE.start_dll_create_#in~len#1| 2)) (.cse6 (<= 1 |ULTIMATE.start_dll_create_#in~data#1|)) (.cse7 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse19 (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))) (.cse8 (<= |ULTIMATE.start_dll_create_#in~data#1| 1)) (.cse11 (<= 0 |#NULL.offset|)) (.cse12 (<= 0 |#StackHeapBarrier|)) (.cse13 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_dll_create_~len#1|) .cse13) (and .cse14 .cse0 .cse1 .cse15 .cse16 .cse17 .cse18 .cse2 .cse3 (<= 1 |ULTIMATE.start_dll_create_~len#1|) .cse4 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (let ((.cse21 (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse20 (select .cse21 4))) (and .cse14 .cse0 .cse1 .cse15 (not (= |ULTIMATE.start_dll_create_~head~0#1.base| .cse20)) .cse16 .cse17 .cse18 .cse2 .cse3 (not (= .cse20 0)) .cse4 .cse5 .cse6 .cse7 .cse19 (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) .cse8 (= (select .cse21 8) 0) .cse11 .cse12 .cse13))))) [2022-11-22 01:38:41,161 INFO L902 garLoopResultBuilder]: At program point L604-2(lines 604 608) the Hoare annotation is: true [2022-11-22 01:38:41,162 INFO L895 garLoopResultBuilder]: At program point L629-3(lines 629 632) the Hoare annotation is: (let ((.cse29 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse33 (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse34 (select .cse33 4)) (.cse35 (select .cse29 4))) (let ((.cse2 (not (= 0 .cse35))) (.cse4 (not (= |ULTIMATE.start_main_~s~0#1.base| .cse35))) (.cse9 (<= |ULTIMATE.start_dll_create_~len#1| 2)) (.cse12 (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~len~0#1|)) (.cse17 (= (select .cse29 8) 0)) (.cse21 (<= |ULTIMATE.start_dll_create_~head~0#1.offset| 0)) (.cse22 (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|)) (.cse0 (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)) (.cse1 (<= 1 |ULTIMATE.start_dll_create_~data#1|)) (.cse3 (<= 2 |ULTIMATE.start_dll_create_#in~len#1|)) (.cse5 (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))) (.cse30 (not (= |ULTIMATE.start_dll_create_~head~0#1.base| .cse34))) (.cse6 (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)) (.cse8 (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)) (.cse10 (<= |#NULL.offset| 0)) (.cse11 (<= |ULTIMATE.start_dll_create_~data#1| 1)) (.cse31 (not (= .cse34 0))) (.cse14 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse15 (<= |ULTIMATE.start_dll_create_#in~len#1| 2)) (.cse16 (<= 1 |ULTIMATE.start_dll_create_#in~data#1|)) (.cse18 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse19 (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))) (.cse20 (<= |ULTIMATE.start_dll_create_#in~data#1| 1)) (.cse32 (= (select .cse33 8) 0)) (.cse24 (<= 0 |#NULL.offset|)) (.cse25 (<= 0 |#StackHeapBarrier|)) (.cse26 (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse27 (= |#NULL.base| 0))) (or (let ((.cse28 (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse13 (select .cse29 .cse28)) (.cse23 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) .cse28)) (.cse7 (+ |ULTIMATE.start_main_~len~0#1| 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= .cse7 |ULTIMATE.start_dll_update_at_~data#1|) .cse8 .cse9 .cse10 .cse11 .cse12 (<= |ULTIMATE.start_dll_update_at_~index#1| 0) (= .cse13 |ULTIMATE.start_dll_update_at_~head#1.base|) (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (= |ULTIMATE.start_dll_update_at_~head#1.offset| .cse23) .cse24 .cse25 (= (select (select |#memory_int| .cse13) .cse23) .cse7) .cse26 .cse27))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 1 |ULTIMATE.start_main_~i~0#1|) .cse30 (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_update_at_~head#1.base|) .cse6 .cse8 .cse9 .cse10 .cse11 .cse31 .cse12 (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_dll_update_at_~data#1|) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse32 .cse24 (<= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_update_at_~head#1.offset|) .cse25 (= |ULTIMATE.start_dll_update_at_~index#1| 0) .cse26 .cse27) (and .cse0 .cse1 (= |ULTIMATE.start_main_~i~0#1| 0) .cse3 .cse5 .cse30 .cse6 .cse8 .cse10 .cse11 .cse31 (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_#res#1.base|) (= |ULTIMATE.start_dll_create_#res#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) .cse14 .cse15 (<= |ULTIMATE.start_dll_create_~len#1| 0) .cse16 .cse18 .cse19 (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) .cse20 (= |ULTIMATE.start_dll_create_#res#1.base| |ULTIMATE.start_main_~s~0#1.base|) .cse32 .cse24 .cse25 .cse26 .cse27))))) [2022-11-22 01:38:41,164 INFO L444 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1] [2022-11-22 01:38:41,166 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 01:38:41,173 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,174 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,175 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,175 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,175 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,175 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,176 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,176 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,176 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,177 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,177 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,177 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,178 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,178 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,190 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,194 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,195 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,196 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,196 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,196 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,196 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,197 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,198 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,198 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,200 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,201 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,201 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,201 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,204 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,205 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,205 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,206 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,206 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,206 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,207 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,207 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,207 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,208 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,208 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,208 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,208 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,208 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,209 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,209 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,209 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,210 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,210 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,210 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,211 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,211 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,211 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,212 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,212 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,212 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,212 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,213 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,215 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,216 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,216 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,217 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,217 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,217 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,218 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,218 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,218 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,219 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,219 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,219 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,219 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,220 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,220 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,220 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,221 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,221 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,221 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,221 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,222 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,222 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,222 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,222 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,223 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,223 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,223 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,224 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,227 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,227 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,228 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,229 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,229 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,230 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,231 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,231 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,232 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,232 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,232 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,233 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,233 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,233 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,233 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,234 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,234 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,234 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,235 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,235 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,235 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,236 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,238 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,238 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,239 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,239 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,239 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,239 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,240 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,240 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,240 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,241 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,241 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,241 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,241 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,242 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,242 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,242 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,245 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,246 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,246 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,247 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_650,QUANTIFIED] [2022-11-22 01:38:41,247 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,247 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,248 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,248 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,248 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,248 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,249 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,249 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,249 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,250 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,250 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,250 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,250 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,251 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,251 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,253 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,254 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,254 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,254 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_650,QUANTIFIED] [2022-11-22 01:38:41,254 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,255 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,255 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,255 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,255 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,256 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,256 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,256 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,257 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,257 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,257 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,258 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,258 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,258 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,258 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:38:41 BoogieIcfgContainer [2022-11-22 01:38:41,261 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 01:38:41,261 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 01:38:41,261 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 01:38:41,262 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 01:38:41,262 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:37:42" (3/4) ... [2022-11-22 01:38:41,265 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-22 01:38:41,271 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2022-11-22 01:38:41,275 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2022-11-22 01:38:41,275 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2022-11-22 01:38:41,276 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-22 01:38:41,276 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-22 01:38:41,310 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((1 <= data && 2 <= \old(len)) && #NULL <= 0) && data <= 1) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && len == 2) && \old(data) <= 1) && head <= 0) && 0 <= head) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && len == len) && #NULL == 0) || ((((((((((((((((((((new_head == 0 && 1 <= data) && 2 <= \old(len)) && !(head == 0)) && \valid[head] == 1) && \valid[new_head] == 1) && len <= 2) && #NULL <= 0) && data <= 1) && 1 <= len) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && len == 2) && !(new_head == 0)) && \old(data) <= 1) && head <= 0) && 0 <= head) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || (((((((((((((((((((((new_head == 0 && 1 <= data) && 2 <= \old(len)) && !(head == 0)) && !(head == #memory_$Pointer$[head][4])) && \valid[head] == 1) && \valid[new_head] == 1) && len <= 2) && #NULL <= 0) && data <= 1) && !(#memory_$Pointer$[head][4] == 0)) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && len == 2) && !(new_head == 0)) && head == 0) && \old(data) <= 1) && #memory_$Pointer$[head][8] == 0) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) [2022-11-22 01:38:41,311 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((new_head == 0 && 1 <= data) && !(0 == #memory_$Pointer$[s][4])) && 2 <= \old(len)) && !(s == #memory_$Pointer$[s][4])) && !(head == 0)) && \valid[head] == 1) && len + 1 == data) && \valid[new_head] == 1) && len <= 2) && #NULL <= 0) && data <= 1) && unknown-#memory_int-unknown[s][s] == len) && index <= 0) && #memory_$Pointer$[s][s + 4] == head) && 2 <= i) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && #memory_$Pointer$[s][8] == 0) && len == 2) && !(new_head == 0)) && \old(data) <= 1) && head <= 0) && 0 <= head) && head == #memory_$Pointer$[s][s + 4]) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) && #NULL == 0) || (((((((((((((((((((((((((((((((((new_head == 0 && 1 <= data) && !(0 == #memory_$Pointer$[s][4])) && 2 <= \old(len)) && !(s == #memory_$Pointer$[s][4])) && !(head == 0)) && 1 <= i) && !(head == #memory_$Pointer$[head][4])) && s == head) && \valid[head] == 1) && \valid[new_head] == 1) && len <= 2) && #NULL <= 0) && data <= 1) && !(#memory_$Pointer$[head][4] == 0)) && unknown-#memory_int-unknown[s][s] == len) && len == data) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && #memory_$Pointer$[s][8] == 0) && len == 2) && !(new_head == 0)) && \old(data) <= 1) && head <= 0) && 0 <= head) && #memory_$Pointer$[head][8] == 0) && 0 <= #NULL) && i <= 1) && s == head) && 0 <= unknown-#StackHeapBarrier-unknown) && index == 0) && s == 0) && #NULL == 0)) || ((((((((((((((((((((((((((new_head == 0 && 1 <= data) && i == 0) && 2 <= \old(len)) && !(head == 0)) && !(head == #memory_$Pointer$[head][4])) && \valid[head] == 1) && \valid[new_head] == 1) && #NULL <= 0) && data <= 1) && !(#memory_$Pointer$[head][4] == 0)) && head == \result) && \result == s) && data == 1) && \old(len) <= 2) && len <= 0) && 1 <= \old(data)) && len == 2) && !(new_head == 0)) && head == 0) && \old(data) <= 1) && \result == s) && #memory_$Pointer$[head][8] == 0) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && s == 0) && #NULL == 0) [2022-11-22 01:38:41,311 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((new_head == 0 && 1 <= data) && !(0 == #memory_$Pointer$[s][4])) && 2 <= \old(len)) && !(s == #memory_$Pointer$[s][4])) && !(head == 0)) && \valid[head] == 1) && len + 1 == data) && \valid[new_head] == 1) && len <= 2) && i == 1) && #NULL <= 0) && index <= 0) && data <= 1) && index <= 0) && 0 <= i) && #memory_$Pointer$[s][s + 4] == head) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && #memory_$Pointer$[s][8] == 0) && len == 2) && !(new_head == 0)) && \old(data) <= 1) && head <= 0) && 0 <= head) && head == #memory_$Pointer$[s][s + 4]) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) && #NULL == 0) || ((((((((((((((((((((((new_head == 0 && 1 <= data) && 2 <= \old(len)) && !(head == 0)) && \valid[head] == 1) && \valid[new_head] == 1) && len <= 2) && #NULL <= 0) && data <= 1) && index <= 0) && 0 <= i) && 2 <= i) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && len == 2) && !(new_head == 0)) && \old(data) <= 1) && head <= 0) && 0 <= head) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || (((((((((((((((((((((((((((((((new_head == 0 && 1 <= data) && !(0 == #memory_$Pointer$[s][4])) && i == 0) && 2 <= \old(len)) && !(s == #memory_$Pointer$[s][4])) && !(head == 0)) && \valid[head] == 1) && len + 1 == data) && \valid[new_head] == 1) && len <= 2) && #NULL <= 0) && data <= 1) && unknown-#memory_int-unknown[s][s] == len) && index <= 0) && 0 <= i) && #memory_$Pointer$[s][s + 4] == head) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && #memory_$Pointer$[s][8] == 0) && len == 2) && !(new_head == 0)) && \old(data) <= 1) && head <= 0) && 0 <= head) && head == #memory_$Pointer$[s][s + 4]) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) && #NULL == 0) [2022-11-22 01:38:41,312 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((new_head == 0 && 1 <= data) && 2 <= \old(len)) && !(head == 0)) && !(head == #memory_$Pointer$[head][4])) && \valid[head] == 1) && len + 1 == data) && \valid[new_head] == 1) && len <= 2) && i == 1) && #NULL <= 0) && data <= 1) && !(#memory_$Pointer$[head][4] == 0)) && unknown-#memory_int-unknown[s][s] == len) && index <= 0) && #memory_$Pointer$[s][s + 4] == head) && data == 1) && (forall v_ArrVal_650 : [int]int :: len <= unknown-#memory_int-unknown[head := v_ArrVal_650][s][s])) && !(head == 0)) && \old(len) <= 2) && 1 <= \old(data)) && #memory_$Pointer$[s][8] == 0) && len == 2) && !(new_head == 0)) && head == 0) && \old(data) <= 1) && head == #memory_$Pointer$[s][s + 4]) && #memory_$Pointer$[head][8] == 0) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && s == 0) && #NULL == 0) || ((((((((((((((((((((((((((((((((new_head == 0 && 1 <= data) && 1 <= index) && !(0 == #memory_$Pointer$[s][4])) && 2 <= \old(len)) && !(s == #memory_$Pointer$[s][4])) && !(head == 0)) && !(head == #memory_$Pointer$[head][4])) && s == head) && \valid[head] == 1) && len + 1 == data) && \valid[new_head] == 1) && index <= 1) && len <= 2) && i == 1) && #NULL <= 0) && data <= 1) && !(#memory_$Pointer$[head][4] == 0)) && unknown-#memory_int-unknown[s][s] == len) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && #memory_$Pointer$[s][8] == 0) && len == 2) && !(new_head == 0)) && head == 0) && \old(data) <= 1) && #memory_$Pointer$[head][8] == 0) && 0 <= #NULL) && s == head) && 0 <= unknown-#StackHeapBarrier-unknown) && s == 0) && #NULL == 0)) || (((((((((((((((((((((((((((((((new_head == 0 && 1 <= data) && !(0 == #memory_$Pointer$[s][4])) && i == 0) && 2 <= \old(len)) && !(head == 0)) && !(head == #memory_$Pointer$[head][4])) && s == head) && \valid[head] == 1) && \valid[new_head] == 1) && len <= 2) && #NULL <= 0) && data <= 1) && !(#memory_$Pointer$[head][4] == 0)) && !(#memory_$Pointer$[head][4] == head)) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && #memory_$Pointer$[s][8] == 0) && len == 2) && !(new_head == 0)) && head == 0) && \old(data) <= 1) && data <= len + i) && #memory_$Pointer$[head][8] == 0) && 0 <= #NULL) && s == head) && 0 <= unknown-#StackHeapBarrier-unknown) && len + i <= data) && index == 0) && s == 0) && #NULL == 0) [2022-11-22 01:38:41,313 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((new_head == 0 && 1 <= index) && 1 <= data) && !(0 == #memory_$Pointer$[s][4])) && 2 <= \old(len)) && unknown-#memory_int-unknown[#memory_$Pointer$[head][head + 4]][#memory_$Pointer$[head][head + 4]] == expected) && !(s == #memory_$Pointer$[s][4])) && !(head == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[head][head + 4]][#memory_$Pointer$[head][head + 4]] == 3) && \valid[head] == 1) && !(head == #memory_$Pointer$[head][4])) && len + 1 == data) && \valid[new_head] == 1) && #memory_$Pointer$[head][8] == 0) && i + 1 <= len) && head == 0) && len <= 2) && i == 1) && #NULL <= 0) && data <= 1) && index <= 1) && index <= 0) && 0 <= i) && #memory_$Pointer$[s][s + 4] == head) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && #memory_$Pointer$[s][8] == 0) && len == 2) && !(new_head == 0)) && \old(data) <= 1) && head <= 0) && !(0 == #memory_$Pointer$[head][4])) && 0 <= head) && head == #memory_$Pointer$[s][s + 4]) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) && #NULL == 0) || (((((((((((((((((((((((((((((((((((new_head == 0 && 1 <= data) && unknown-#memory_int-unknown[head][head] == expected) && !(0 == #memory_$Pointer$[s][4])) && 2 <= \old(len)) && !(s == #memory_$Pointer$[s][4])) && !(head == 0)) && \valid[head] == 1) && len + 1 == data) && \valid[new_head] == 1) && i + 1 <= len) && len <= 2) && i == 1) && #NULL <= 0) && index <= 0) && data <= 1) && index <= 0) && 0 <= i) && #memory_$Pointer$[s][s + 4] == head) && 3 == unknown-#memory_int-unknown[head][head]) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && #memory_$Pointer$[s][8] == 0) && len == 2) && !(new_head == 0)) && \old(data) <= 1) && head <= 0) && 0 <= head) && head == #memory_$Pointer$[s][s + 4]) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && !(head == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) && #NULL == 0)) || ((((((((((((((((((((((((((((((((((((new_head == 0 && 1 <= data) && unknown-#memory_int-unknown[head][head] == expected) && !(0 == #memory_$Pointer$[s][4])) && i == 0) && 2 <= \old(len)) && !(s == #memory_$Pointer$[s][4])) && !(head == 0)) && \valid[head] == 1) && len + 1 == data) && \valid[new_head] == 1) && i + 1 <= len) && head == 0) && len <= 2) && #NULL <= 0) && data <= 1) && unknown-#memory_int-unknown[s][s] == len) && index <= 0) && 0 <= i) && #memory_$Pointer$[s][s + 4] == head) && data == 1) && \old(len) <= 2) && 2 == unknown-#memory_int-unknown[head][head]) && index == 0) && 1 <= \old(data)) && #memory_$Pointer$[s][8] == 0) && len == 2) && !(new_head == 0)) && \old(data) <= 1) && head <= 0) && 0 <= head) && head == #memory_$Pointer$[s][s + 4]) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) && #NULL == 0) [2022-11-22 01:38:41,332 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/witness.graphml [2022-11-22 01:38:41,332 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 01:38:41,333 INFO L158 Benchmark]: Toolchain (without parser) took 59726.96ms. Allocated memory was 140.5MB in the beginning and 432.0MB in the end (delta: 291.5MB). Free memory was 109.4MB in the beginning and 149.0MB in the end (delta: -39.7MB). Peak memory consumption was 251.4MB. Max. memory is 16.1GB. [2022-11-22 01:38:41,334 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory is still 88.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 01:38:41,334 INFO L158 Benchmark]: CACSL2BoogieTranslator took 526.45ms. Allocated memory is still 140.5MB. Free memory was 109.4MB in the beginning and 91.9MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-22 01:38:41,334 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.19ms. Allocated memory is still 140.5MB. Free memory was 91.9MB in the beginning and 89.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 01:38:41,334 INFO L158 Benchmark]: Boogie Preprocessor took 41.84ms. Allocated memory is still 140.5MB. Free memory was 89.8MB in the beginning and 88.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 01:38:41,334 INFO L158 Benchmark]: RCFGBuilder took 611.24ms. Allocated memory is still 140.5MB. Free memory was 87.8MB in the beginning and 99.3MB in the end (delta: -11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-22 01:38:41,335 INFO L158 Benchmark]: TraceAbstraction took 58396.79ms. Allocated memory was 140.5MB in the beginning and 432.0MB in the end (delta: 291.5MB). Free memory was 98.8MB in the beginning and 152.2MB in the end (delta: -53.4MB). Peak memory consumption was 253.9MB. Max. memory is 16.1GB. [2022-11-22 01:38:41,335 INFO L158 Benchmark]: Witness Printer took 71.24ms. Allocated memory is still 432.0MB. Free memory was 152.2MB in the beginning and 149.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-22 01:38:41,336 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.17ms. Allocated memory is still 113.2MB. Free memory is still 88.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 526.45ms. Allocated memory is still 140.5MB. Free memory was 109.4MB in the beginning and 91.9MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.19ms. Allocated memory is still 140.5MB. Free memory was 91.9MB in the beginning and 89.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.84ms. Allocated memory is still 140.5MB. Free memory was 89.8MB in the beginning and 88.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 611.24ms. Allocated memory is still 140.5MB. Free memory was 87.8MB in the beginning and 99.3MB in the end (delta: -11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 58396.79ms. Allocated memory was 140.5MB in the beginning and 432.0MB in the end (delta: 291.5MB). Free memory was 98.8MB in the beginning and 152.2MB in the end (delta: -53.4MB). Peak memory consumption was 253.9MB. Max. memory is 16.1GB. * Witness Printer took 71.24ms. Allocated memory is still 432.0MB. Free memory was 152.2MB in the beginning and 149.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_650,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_650,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 641]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 58.2s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 15 mSolverCounterUnknown, 577 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 577 mSDsluCounter, 341 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 70 IncrementalHoareTripleChecker+Unchecked, 261 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1216 IncrementalHoareTripleChecker+Invalid, 1366 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 80 mSDtfsCounter, 1216 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 604 GetRequests, 337 SyntacticMatches, 23 SemanticMatches, 244 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2332 ImplicationChecksByTransitivity, 17.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=10, InterpolantAutomatonStates: 102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 60 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 13 PreInvPairs, 30 NumberOfFragments, 1979 HoareAnnotationTreeSize, 13 FomulaSimplifications, 2133 FormulaSimplificationTreeSizeReduction, 2.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 39065 FormulaSimplificationTreeSizeReductionInter, 2.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 401 NumberOfCodeBlocks, 384 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 526 ConstructedInterpolants, 13 QuantifiedInterpolants, 3452 SizeOfPredicates, 85 NumberOfNonLiveVariables, 2554 ConjunctsInSsa, 227 ConjunctsInUnsatCore, 32 InterpolantComputations, 4 PerfectInterpolantSequences, 225/344 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 3.4s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 1, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 5, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 14, TOOLS_POST_TIME: 3.2s, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 14, TOOLS_QUANTIFIERELIM_TIME: 3.2s, TOOLS_QUANTIFIERELIM_MAX_TIME: 1.6s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 27, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 0, DOMAIN_JOIN_TIME: 0.0s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 2, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 3, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 5, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME: 3.3s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 3.3s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 3, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 62, DAG_COMPRESSION_RETAINED_NODES: 28, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 633]: Loop Invariant [2022-11-22 01:38:41,358 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,359 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,359 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,359 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,360 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,360 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,360 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,360 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,361 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,361 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,361 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,361 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,362 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,362 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,363 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,363 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,364 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,364 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,364 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,365 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,365 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,365 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,365 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,366 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,366 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,366 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,366 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,366 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((((((((((((((((((((new_head == 0 && 1 <= data) && !(0 == #memory_$Pointer$[s][4])) && 2 <= \old(len)) && !(s == #memory_$Pointer$[s][4])) && !(head == 0)) && \valid[head] == 1) && len + 1 == data) && \valid[new_head] == 1) && len <= 2) && i == 1) && #NULL <= 0) && index <= 0) && data <= 1) && index <= 0) && 0 <= i) && #memory_$Pointer$[s][s + 4] == head) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && #memory_$Pointer$[s][8] == 0) && len == 2) && !(new_head == 0)) && \old(data) <= 1) && head <= 0) && 0 <= head) && head == #memory_$Pointer$[s][s + 4]) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) && #NULL == 0) || ((((((((((((((((((((((new_head == 0 && 1 <= data) && 2 <= \old(len)) && !(head == 0)) && \valid[head] == 1) && \valid[new_head] == 1) && len <= 2) && #NULL <= 0) && data <= 1) && index <= 0) && 0 <= i) && 2 <= i) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && len == 2) && !(new_head == 0)) && \old(data) <= 1) && head <= 0) && 0 <= head) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || (((((((((((((((((((((((((((((((new_head == 0 && 1 <= data) && !(0 == #memory_$Pointer$[s][4])) && i == 0) && 2 <= \old(len)) && !(s == #memory_$Pointer$[s][4])) && !(head == 0)) && \valid[head] == 1) && len + 1 == data) && \valid[new_head] == 1) && len <= 2) && #NULL <= 0) && data <= 1) && unknown-#memory_int-unknown[s][s] == len) && index <= 0) && 0 <= i) && #memory_$Pointer$[s][s + 4] == head) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && #memory_$Pointer$[s][8] == 0) && len == 2) && !(new_head == 0)) && \old(data) <= 1) && head <= 0) && 0 <= head) && head == #memory_$Pointer$[s][s + 4]) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) && #NULL == 0) - InvariantResult [Line: 611]: Loop Invariant [2022-11-22 01:38:41,368 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,368 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,369 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,369 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,369 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,369 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,370 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,370 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,379 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,379 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,380 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,380 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,380 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,380 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,380 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,381 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,381 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,381 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,381 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,382 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,382 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,382 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,382 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,383 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,383 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,383 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,383 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,384 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,385 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,385 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,386 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,386 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,386 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,387 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,387 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,387 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,387 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,388 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,388 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,388 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,388 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,388 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,389 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,389 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,389 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,389 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,390 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,390 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,390 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,390 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,391 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,391 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,391 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,391 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,392 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,392 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((new_head == 0 && 1 <= index) && 1 <= data) && !(0 == #memory_$Pointer$[s][4])) && 2 <= \old(len)) && unknown-#memory_int-unknown[#memory_$Pointer$[head][head + 4]][#memory_$Pointer$[head][head + 4]] == expected) && !(s == #memory_$Pointer$[s][4])) && !(head == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[head][head + 4]][#memory_$Pointer$[head][head + 4]] == 3) && \valid[head] == 1) && !(head == #memory_$Pointer$[head][4])) && len + 1 == data) && \valid[new_head] == 1) && #memory_$Pointer$[head][8] == 0) && i + 1 <= len) && head == 0) && len <= 2) && i == 1) && #NULL <= 0) && data <= 1) && index <= 1) && index <= 0) && 0 <= i) && #memory_$Pointer$[s][s + 4] == head) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && #memory_$Pointer$[s][8] == 0) && len == 2) && !(new_head == 0)) && \old(data) <= 1) && head <= 0) && !(0 == #memory_$Pointer$[head][4])) && 0 <= head) && head == #memory_$Pointer$[s][s + 4]) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) && #NULL == 0) || (((((((((((((((((((((((((((((((((((new_head == 0 && 1 <= data) && unknown-#memory_int-unknown[head][head] == expected) && !(0 == #memory_$Pointer$[s][4])) && 2 <= \old(len)) && !(s == #memory_$Pointer$[s][4])) && !(head == 0)) && \valid[head] == 1) && len + 1 == data) && \valid[new_head] == 1) && i + 1 <= len) && len <= 2) && i == 1) && #NULL <= 0) && index <= 0) && data <= 1) && index <= 0) && 0 <= i) && #memory_$Pointer$[s][s + 4] == head) && 3 == unknown-#memory_int-unknown[head][head]) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && #memory_$Pointer$[s][8] == 0) && len == 2) && !(new_head == 0)) && \old(data) <= 1) && head <= 0) && 0 <= head) && head == #memory_$Pointer$[s][s + 4]) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && !(head == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) && #NULL == 0)) || ((((((((((((((((((((((((((((((((((((new_head == 0 && 1 <= data) && unknown-#memory_int-unknown[head][head] == expected) && !(0 == #memory_$Pointer$[s][4])) && i == 0) && 2 <= \old(len)) && !(s == #memory_$Pointer$[s][4])) && !(head == 0)) && \valid[head] == 1) && len + 1 == data) && \valid[new_head] == 1) && i + 1 <= len) && head == 0) && len <= 2) && #NULL <= 0) && data <= 1) && unknown-#memory_int-unknown[s][s] == len) && index <= 0) && 0 <= i) && #memory_$Pointer$[s][s + 4] == head) && data == 1) && \old(len) <= 2) && 2 == unknown-#memory_int-unknown[head][head]) && index == 0) && 1 <= \old(data)) && #memory_$Pointer$[s][8] == 0) && len == 2) && !(new_head == 0)) && \old(data) <= 1) && head <= 0) && 0 <= head) && head == #memory_$Pointer$[s][s + 4]) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) && #NULL == 0) - InvariantResult [Line: 624]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 587]: Loop Invariant [2022-11-22 01:38:41,394 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,394 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,394 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,395 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,395 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,396 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((1 <= data && 2 <= \old(len)) && #NULL <= 0) && data <= 1) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && len == 2) && \old(data) <= 1) && head <= 0) && 0 <= head) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && len == len) && #NULL == 0) || ((((((((((((((((((((new_head == 0 && 1 <= data) && 2 <= \old(len)) && !(head == 0)) && \valid[head] == 1) && \valid[new_head] == 1) && len <= 2) && #NULL <= 0) && data <= 1) && 1 <= len) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && len == 2) && !(new_head == 0)) && \old(data) <= 1) && head <= 0) && 0 <= head) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || (((((((((((((((((((((new_head == 0 && 1 <= data) && 2 <= \old(len)) && !(head == 0)) && !(head == #memory_$Pointer$[head][4])) && \valid[head] == 1) && \valid[new_head] == 1) && len <= 2) && #NULL <= 0) && data <= 1) && !(#memory_$Pointer$[head][4] == 0)) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && len == 2) && !(new_head == 0)) && head == 0) && \old(data) <= 1) && #memory_$Pointer$[head][8] == 0) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 604]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 629]: Loop Invariant [2022-11-22 01:38:41,397 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,397 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,397 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,398 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,398 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,398 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,398 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,398 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,399 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,399 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,399 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,399 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,400 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,400 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,400 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,400 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,402 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,402 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,402 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,402 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,403 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,403 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,403 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,403 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,403 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,404 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,404 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,404 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,405 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,405 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,405 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,405 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((((((((((((new_head == 0 && 1 <= data) && !(0 == #memory_$Pointer$[s][4])) && 2 <= \old(len)) && !(s == #memory_$Pointer$[s][4])) && !(head == 0)) && \valid[head] == 1) && len + 1 == data) && \valid[new_head] == 1) && len <= 2) && #NULL <= 0) && data <= 1) && unknown-#memory_int-unknown[s][s] == len) && index <= 0) && #memory_$Pointer$[s][s + 4] == head) && 2 <= i) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && #memory_$Pointer$[s][8] == 0) && len == 2) && !(new_head == 0)) && \old(data) <= 1) && head <= 0) && 0 <= head) && head == #memory_$Pointer$[s][s + 4]) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) && #NULL == 0) || (((((((((((((((((((((((((((((((((new_head == 0 && 1 <= data) && !(0 == #memory_$Pointer$[s][4])) && 2 <= \old(len)) && !(s == #memory_$Pointer$[s][4])) && !(head == 0)) && 1 <= i) && !(head == #memory_$Pointer$[head][4])) && s == head) && \valid[head] == 1) && \valid[new_head] == 1) && len <= 2) && #NULL <= 0) && data <= 1) && !(#memory_$Pointer$[head][4] == 0)) && unknown-#memory_int-unknown[s][s] == len) && len == data) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && #memory_$Pointer$[s][8] == 0) && len == 2) && !(new_head == 0)) && \old(data) <= 1) && head <= 0) && 0 <= head) && #memory_$Pointer$[head][8] == 0) && 0 <= #NULL) && i <= 1) && s == head) && 0 <= unknown-#StackHeapBarrier-unknown) && index == 0) && s == 0) && #NULL == 0)) || ((((((((((((((((((((((((((new_head == 0 && 1 <= data) && i == 0) && 2 <= \old(len)) && !(head == 0)) && !(head == #memory_$Pointer$[head][4])) && \valid[head] == 1) && \valid[new_head] == 1) && #NULL <= 0) && data <= 1) && !(#memory_$Pointer$[head][4] == 0)) && head == \result) && \result == s) && data == 1) && \old(len) <= 2) && len <= 0) && 1 <= \old(data)) && len == 2) && !(new_head == 0)) && head == 0) && \old(data) <= 1) && \result == s) && #memory_$Pointer$[head][8] == 0) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && s == 0) && #NULL == 0) - InvariantResult [Line: 573]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 624]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 618]: Loop Invariant [2022-11-22 01:38:41,407 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,407 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,408 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,408 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_650,QUANTIFIED] [2022-11-22 01:38:41,408 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,408 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,409 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,409 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,409 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,410 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,410 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,410 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,410 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,410 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,411 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,411 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,411 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,411 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,412 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,413 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,413 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,413 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,414 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_650,QUANTIFIED] [2022-11-22 01:38:41,414 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,414 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 01:38:41,414 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,415 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,415 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,415 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,415 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,416 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,416 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,416 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,416 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,416 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,417 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,417 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 01:38:41,417 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((((((((((((new_head == 0 && 1 <= data) && 2 <= \old(len)) && !(head == 0)) && !(head == #memory_$Pointer$[head][4])) && \valid[head] == 1) && len + 1 == data) && \valid[new_head] == 1) && len <= 2) && i == 1) && #NULL <= 0) && data <= 1) && !(#memory_$Pointer$[head][4] == 0)) && unknown-#memory_int-unknown[s][s] == len) && index <= 0) && #memory_$Pointer$[s][s + 4] == head) && data == 1) && (forall v_ArrVal_650 : [int]int :: len <= unknown-#memory_int-unknown[head := v_ArrVal_650][s][s])) && !(head == 0)) && \old(len) <= 2) && 1 <= \old(data)) && #memory_$Pointer$[s][8] == 0) && len == 2) && !(new_head == 0)) && head == 0) && \old(data) <= 1) && head == #memory_$Pointer$[s][s + 4]) && #memory_$Pointer$[head][8] == 0) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && s == 0) && #NULL == 0) || ((((((((((((((((((((((((((((((((new_head == 0 && 1 <= data) && 1 <= index) && !(0 == #memory_$Pointer$[s][4])) && 2 <= \old(len)) && !(s == #memory_$Pointer$[s][4])) && !(head == 0)) && !(head == #memory_$Pointer$[head][4])) && s == head) && \valid[head] == 1) && len + 1 == data) && \valid[new_head] == 1) && index <= 1) && len <= 2) && i == 1) && #NULL <= 0) && data <= 1) && !(#memory_$Pointer$[head][4] == 0)) && unknown-#memory_int-unknown[s][s] == len) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && #memory_$Pointer$[s][8] == 0) && len == 2) && !(new_head == 0)) && head == 0) && \old(data) <= 1) && #memory_$Pointer$[head][8] == 0) && 0 <= #NULL) && s == head) && 0 <= unknown-#StackHeapBarrier-unknown) && s == 0) && #NULL == 0)) || (((((((((((((((((((((((((((((((new_head == 0 && 1 <= data) && !(0 == #memory_$Pointer$[s][4])) && i == 0) && 2 <= \old(len)) && !(head == 0)) && !(head == #memory_$Pointer$[head][4])) && s == head) && \valid[head] == 1) && \valid[new_head] == 1) && len <= 2) && #NULL <= 0) && data <= 1) && !(#memory_$Pointer$[head][4] == 0)) && !(#memory_$Pointer$[head][4] == head)) && data == 1) && \old(len) <= 2) && 1 <= \old(data)) && #memory_$Pointer$[s][8] == 0) && len == 2) && !(new_head == 0)) && head == 0) && \old(data) <= 1) && data <= len + i) && #memory_$Pointer$[head][8] == 0) && 0 <= #NULL) && s == head) && 0 <= unknown-#StackHeapBarrier-unknown) && len + i <= data) && index == 0) && s == 0) && #NULL == 0) RESULT: Ultimate proved your program to be correct! [2022-11-22 01:38:41,437 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55431dc4-1c78-4428-8f35-9f09cb8dbeff/bin/utaipan-g80aRyZoba/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