./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-regression/ex3_forlist.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-regression/ex3_forlist.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI --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 ddbd4e73adf4663f87721f5aa250c32f7b058621a618ab1d03544a940de1ce0e --- 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-5e519f3 [2022-11-03 02:32:52,690 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:32:52,692 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:32:52,744 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:32:52,744 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:32:52,749 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:32:52,750 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:32:52,752 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:32:52,754 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:32:52,755 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:32:52,757 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:32:52,758 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:32:52,759 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:32:52,760 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:32:52,770 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:32:52,774 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:32:52,776 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:32:52,785 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:32:52,790 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:32:52,793 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:32:52,795 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:32:52,801 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:32:52,806 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:32:52,808 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:32:52,814 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:32:52,815 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:32:52,815 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:32:52,816 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:32:52,817 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:32:52,818 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:32:52,819 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:32:52,820 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:32:52,821 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:32:52,822 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:32:52,824 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:32:52,824 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:32:52,825 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:32:52,826 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:32:52,826 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:32:52,827 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:32:52,828 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:32:52,829 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 02:32:52,857 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:32:52,857 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:32:52,858 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:32:52,858 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:32:52,859 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:32:52,860 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:32:52,860 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:32:52,861 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:32:52,861 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:32:52,861 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:32:52,862 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:32:52,862 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:32:52,862 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:32:52,863 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:32:52,863 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:32:52,863 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:32:52,864 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:32:52,864 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:32:52,865 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:32:52,865 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:32:52,866 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:32:52,866 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:32:52,866 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:32:52,867 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:32:52,867 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:32:52,867 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:32:52,867 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:32:52,868 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:32:52,868 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:32:52,868 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:32:52,869 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:32:52,869 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:32:52,869 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:32:52,870 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:32:52,870 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:32:52,870 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:32:52,871 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:32:52,871 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:32:52,871 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:32:52,872 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:32:52,872 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:32:52,872 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_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/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_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI 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 -> ddbd4e73adf4663f87721f5aa250c32f7b058621a618ab1d03544a940de1ce0e [2022-11-03 02:32:53,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:32:53,285 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:32:53,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:32:53,291 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:32:53,292 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:32:53,294 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/ldv-regression/ex3_forlist.i [2022-11-03 02:32:53,385 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/data/1b8c5bef8/973f935916f04ea6b49bff7748cecd0e/FLAGcf7ad3309 [2022-11-03 02:32:53,987 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:32:53,988 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/sv-benchmarks/c/ldv-regression/ex3_forlist.i [2022-11-03 02:32:53,997 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/data/1b8c5bef8/973f935916f04ea6b49bff7748cecd0e/FLAGcf7ad3309 [2022-11-03 02:32:54,305 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/data/1b8c5bef8/973f935916f04ea6b49bff7748cecd0e [2022-11-03 02:32:54,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:32:54,310 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:32:54,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:32:54,312 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:32:54,316 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:32:54,317 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:32:54" (1/1) ... [2022-11-03 02:32:54,319 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66198c9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:32:54, skipping insertion in model container [2022-11-03 02:32:54,319 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:32:54" (1/1) ... [2022-11-03 02:32:54,328 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:32:54,351 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:32:54,536 WARN L230 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_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/sv-benchmarks/c/ldv-regression/ex3_forlist.i[293,306] [2022-11-03 02:32:54,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:32:54,615 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:32:54,626 WARN L230 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_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/sv-benchmarks/c/ldv-regression/ex3_forlist.i[293,306] [2022-11-03 02:32:54,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:32:54,654 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:32:54,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:32:54 WrapperNode [2022-11-03 02:32:54,655 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:32:54,656 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:32:54,656 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:32:54,657 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:32:54,671 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:32:54" (1/1) ... [2022-11-03 02:32:54,697 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:32:54" (1/1) ... [2022-11-03 02:32:54,736 INFO L138 Inliner]: procedures = 19, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 70 [2022-11-03 02:32:54,737 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:32:54,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:32:54,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:32:54,739 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:32:54,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:32:54" (1/1) ... [2022-11-03 02:32:54,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:32:54" (1/1) ... [2022-11-03 02:32:54,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:32:54" (1/1) ... [2022-11-03 02:32:54,760 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:32:54" (1/1) ... [2022-11-03 02:32:54,785 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:32:54" (1/1) ... [2022-11-03 02:32:54,790 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:32:54" (1/1) ... [2022-11-03 02:32:54,793 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:32:54" (1/1) ... [2022-11-03 02:32:54,808 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:32:54" (1/1) ... [2022-11-03 02:32:54,811 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:32:54,812 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:32:54,812 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:32:54,812 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:32:54,814 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:32:54" (1/1) ... [2022-11-03 02:32:54,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:32:54,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:32:54,862 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:32:54,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:32:54,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 02:32:54,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-03 02:32:54,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:32:54,935 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-11-03 02:32:54,935 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-11-03 02:32:54,936 INFO L130 BoogieDeclarations]: Found specification of procedure g [2022-11-03 02:32:54,936 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2022-11-03 02:32:54,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:32:54,936 INFO L130 BoogieDeclarations]: Found specification of procedure fake_malloc [2022-11-03 02:32:54,936 INFO L138 BoogieDeclarations]: Found implementation of procedure fake_malloc [2022-11-03 02:32:54,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 02:32:54,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 02:32:54,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:32:54,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:32:54,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 02:32:55,064 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:32:55,066 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:32:55,402 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:32:55,456 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:32:55,456 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-03 02:32:55,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:32:55 BoogieIcfgContainer [2022-11-03 02:32:55,460 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:32:55,462 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:32:55,462 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:32:55,467 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:32:55,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:32:54" (1/3) ... [2022-11-03 02:32:55,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d7a0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:32:55, skipping insertion in model container [2022-11-03 02:32:55,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:32:54" (2/3) ... [2022-11-03 02:32:55,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d7a0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:32:55, skipping insertion in model container [2022-11-03 02:32:55,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:32:55" (3/3) ... [2022-11-03 02:32:55,471 INFO L112 eAbstractionObserver]: Analyzing ICFG ex3_forlist.i [2022-11-03 02:32:55,505 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:32:55,505 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 02:32:55,576 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:32:55,585 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;@5e301c20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:32:55,585 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 02:32:55,599 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-03 02:32:55,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-03 02:32:55,611 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:32:55,611 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:32:55,613 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:32:55,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:32:55,624 INFO L85 PathProgramCache]: Analyzing trace with hash -55632847, now seen corresponding path program 1 times [2022-11-03 02:32:55,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:32:55,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867792794] [2022-11-03 02:32:55,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:32:55,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:32:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:32:56,101 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:32:56,102 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:32:56,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867792794] [2022-11-03 02:32:56,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867792794] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:32:56,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:32:56,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:32:56,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607176950] [2022-11-03 02:32:56,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:32:56,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:32:56,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:32:56,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:32:56,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:32:56,156 INFO L87 Difference]: Start difference. First operand has 30 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-03 02:32:56,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:32:56,225 INFO L93 Difference]: Finished difference Result 59 states and 79 transitions. [2022-11-03 02:32:56,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:32:56,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 27 [2022-11-03 02:32:56,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:32:56,239 INFO L225 Difference]: With dead ends: 59 [2022-11-03 02:32:56,240 INFO L226 Difference]: Without dead ends: 28 [2022-11-03 02:32:56,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:32:56,248 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:32:56,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:32:56,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-03 02:32:56,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-11-03 02:32:56,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-03 02:32:56,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2022-11-03 02:32:56,301 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 27 [2022-11-03 02:32:56,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:32:56,302 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-11-03 02:32:56,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-03 02:32:56,303 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-11-03 02:32:56,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 02:32:56,306 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:32:56,306 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:32:56,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 02:32:56,307 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:32:56,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:32:56,308 INFO L85 PathProgramCache]: Analyzing trace with hash 617919719, now seen corresponding path program 1 times [2022-11-03 02:32:56,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:32:56,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440785197] [2022-11-03 02:32:56,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:32:56,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:32:56,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:32:56,496 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:32:56,497 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:32:56,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440785197] [2022-11-03 02:32:56,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440785197] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:32:56,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586682538] [2022-11-03 02:32:56,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:32:56,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:32:56,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:32:56,503 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:32:56,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 02:32:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:32:56,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 02:32:56,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:32:56,757 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 02:32:56,760 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:32:56,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586682538] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:32:56,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:32:56,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-03 02:32:56,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283734133] [2022-11-03 02:32:56,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:32:56,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:32:56,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:32:56,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:32:56,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:32:56,774 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-03 02:32:56,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:32:56,841 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2022-11-03 02:32:56,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:32:56,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-11-03 02:32:56,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:32:56,845 INFO L225 Difference]: With dead ends: 49 [2022-11-03 02:32:56,847 INFO L226 Difference]: Without dead ends: 32 [2022-11-03 02:32:56,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:32:56,850 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 3 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:32:56,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 49 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:32:56,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-03 02:32:56,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2022-11-03 02:32:56,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-03 02:32:56,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-11-03 02:32:56,870 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 28 [2022-11-03 02:32:56,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:32:56,871 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-11-03 02:32:56,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-03 02:32:56,871 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-11-03 02:32:56,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 02:32:56,873 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:32:56,874 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:32:56,921 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 02:32:57,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-11-03 02:32:57,114 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:32:57,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:32:57,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1353941435, now seen corresponding path program 1 times [2022-11-03 02:32:57,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:32:57,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572113496] [2022-11-03 02:32:57,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:32:57,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:32:57,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:32:57,430 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 02:32:57,431 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:32:57,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572113496] [2022-11-03 02:32:57,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572113496] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:32:57,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322381843] [2022-11-03 02:32:57,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:32:57,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:32:57,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:32:57,436 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:32:57,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 02:32:57,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:32:57,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:32:57,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:32:57,711 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 02:32:57,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:32:57,791 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 02:32:57,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322381843] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:32:57,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [207464733] [2022-11-03 02:32:57,824 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2022-11-03 02:32:57,825 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:32:57,831 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:32:57,837 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:32:57,837 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:32:58,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:58,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 58 treesize of output 50 [2022-11-03 02:32:58,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:58,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 23 [2022-11-03 02:32:58,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:58,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 23 [2022-11-03 02:32:58,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:58,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:58,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:58,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 317 treesize of output 286 [2022-11-03 02:32:58,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:58,400 INFO L356 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-03 02:32:58,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 343 treesize of output 300 [2022-11-03 02:32:58,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:58,515 INFO L356 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-03 02:32:58,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 308 treesize of output 298 [2022-11-03 02:32:58,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:58,578 INFO L356 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-03 02:32:58,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 343 treesize of output 300 [2022-11-03 02:32:58,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 12 [2022-11-03 02:32:58,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2022-11-03 02:32:58,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 12 [2022-11-03 02:32:58,943 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:32:58,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 23 [2022-11-03 02:32:58,985 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-11-03 02:32:58,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 31 [2022-11-03 02:32:59,023 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:32:59,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 23 [2022-11-03 02:32:59,274 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:32:59,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:32:59,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:32:59,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:32:59,440 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:32:59,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:32:59,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:32:59,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:32:59,660 INFO L197 IcfgInterpreter]: Interpreting procedure fake_malloc with input of size 49 for LOIs [2022-11-03 02:32:59,680 INFO L197 IcfgInterpreter]: Interpreting procedure g with input of size 67 for LOIs [2022-11-03 02:32:59,740 INFO L197 IcfgInterpreter]: Interpreting procedure f with input of size 20 for LOIs [2022-11-03 02:32:59,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 59 treesize of output 15 [2022-11-03 02:32:59,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-11-03 02:32:59,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 59 treesize of output 15 [2022-11-03 02:32:59,791 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:33:02,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [207464733] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:33:02,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:33:02,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [4, 3, 4] total 24 [2022-11-03 02:33:02,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544305694] [2022-11-03 02:33:02,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:33:02,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-03 02:33:02,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:33:02,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-03 02:33:02,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2022-11-03 02:33:02,188 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 21 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 13 states have internal predecessors, (16), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 02:33:02,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:33:02,855 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2022-11-03 02:33:02,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-03 02:33:02,857 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 13 states have internal predecessors, (16), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 30 [2022-11-03 02:33:02,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:33:02,859 INFO L225 Difference]: With dead ends: 59 [2022-11-03 02:33:02,859 INFO L226 Difference]: Without dead ends: 49 [2022-11-03 02:33:02,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2022-11-03 02:33:02,860 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 24 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:33:02,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 51 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 02:33:02,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-03 02:33:02,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2022-11-03 02:33:02,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 30 states have internal predecessors, (38), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2022-11-03 02:33:02,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2022-11-03 02:33:02,877 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 30 [2022-11-03 02:33:02,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:33:02,878 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2022-11-03 02:33:02,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 13 states have internal predecessors, (16), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 02:33:02,878 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2022-11-03 02:33:02,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 02:33:02,879 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:33:02,880 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:33:02,921 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-03 02:33:03,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:33:03,105 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:33:03,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:33:03,105 INFO L85 PathProgramCache]: Analyzing trace with hash 99688085, now seen corresponding path program 1 times [2022-11-03 02:33:03,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:33:03,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851634326] [2022-11-03 02:33:03,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:03,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:33:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:03,182 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-03 02:33:03,182 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:33:03,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851634326] [2022-11-03 02:33:03,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851634326] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:33:03,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326659368] [2022-11-03 02:33:03,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:03,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:33:03,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:33:03,197 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:33:03,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 02:33:03,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:03,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:33:03,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:33:03,337 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-03 02:33:03,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:33:03,415 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-03 02:33:03,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326659368] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:33:03,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [423886205] [2022-11-03 02:33:03,419 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2022-11-03 02:33:03,420 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:33:03,420 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:33:03,420 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:33:03,421 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:33:03,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:03,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 58 treesize of output 50 [2022-11-03 02:33:03,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:03,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 23 [2022-11-03 02:33:03,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:03,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 23 [2022-11-03 02:33:03,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:03,637 INFO L356 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-03 02:33:03,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 343 treesize of output 300 [2022-11-03 02:33:03,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:03,685 INFO L356 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-03 02:33:03,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 343 treesize of output 300 [2022-11-03 02:33:03,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:03,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:03,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:03,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 317 treesize of output 286 [2022-11-03 02:33:03,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:03,755 INFO L356 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-03 02:33:03,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 308 treesize of output 298 [2022-11-03 02:33:03,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 12 [2022-11-03 02:33:03,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2022-11-03 02:33:03,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 12 [2022-11-03 02:33:03,958 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:33:03,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 19 [2022-11-03 02:33:03,979 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:33:03,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 19 [2022-11-03 02:33:04,005 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-11-03 02:33:04,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 31 [2022-11-03 02:33:04,125 INFO L197 IcfgInterpreter]: Interpreting procedure fake_malloc with input of size 49 for LOIs [2022-11-03 02:33:04,155 INFO L197 IcfgInterpreter]: Interpreting procedure g with input of size 36 for LOIs [2022-11-03 02:33:04,188 INFO L197 IcfgInterpreter]: Interpreting procedure f with input of size 55 for LOIs [2022-11-03 02:33:04,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 11 [2022-11-03 02:33:04,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 11 [2022-11-03 02:33:04,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-11-03 02:33:04,336 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:33:05,686 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '887#(and (= 5 |~#pstate~0.base|) (not (= |g_#t~mem9#1| 1)) (= |g_#in~pointer#1.base| 0) (= |~#pstate~0.offset| 0) (= |g_~i~2#1| 0) (= |#memory_int| |old(#memory_int)|) (not (= |g_#in~pointer#1.offset| 0)) (= |g_~pointer#1.base| (select (select |#memory_$Pointer$.base| |~#pp~0.base|) (+ |~#pp~0.offset| (* |g_~i~2#1| 4)))) (= |g_~pointer#1.offset| (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) (+ |~#pp~0.offset| (* |g_~i~2#1| 4)))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |g_~pointer#1.offset| |g_#in~pointer#1.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (select (select |#memory_int| |~#pstate~0.base|) (+ |~#pstate~0.offset| (* |g_~i~2#1| 4))) |g_#t~mem9#1|) (= |~#pp~0.offset| 0) (= |#NULL.offset| 0) (not (= ~counter~0 1)) (= 4 |~#pp~0.base|) (= |g_~pointer#1.base| |g_#in~pointer#1.base|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-03 02:33:05,687 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:33:05,687 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:33:05,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 5 [2022-11-03 02:33:05,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459091591] [2022-11-03 02:33:05,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:33:05,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:33:05,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:33:05,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:33:05,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2022-11-03 02:33:05,689 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-11-03 02:33:05,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:33:05,728 INFO L93 Difference]: Finished difference Result 82 states and 108 transitions. [2022-11-03 02:33:05,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:33:05,733 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 31 [2022-11-03 02:33:05,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:33:05,734 INFO L225 Difference]: With dead ends: 82 [2022-11-03 02:33:05,734 INFO L226 Difference]: Without dead ends: 43 [2022-11-03 02:33:05,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 71 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2022-11-03 02:33:05,736 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:33:05,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:33:05,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-03 02:33:05,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-11-03 02:33:05,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 31 states have internal predecessors, (39), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2022-11-03 02:33:05,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 56 transitions. [2022-11-03 02:33:05,757 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 56 transitions. Word has length 31 [2022-11-03 02:33:05,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:33:05,757 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 56 transitions. [2022-11-03 02:33:05,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-11-03 02:33:05,758 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 56 transitions. [2022-11-03 02:33:05,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-03 02:33:05,762 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:33:05,762 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:33:05,799 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-03 02:33:05,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:33:05,977 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:33:05,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:33:05,977 INFO L85 PathProgramCache]: Analyzing trace with hash -74486709, now seen corresponding path program 2 times [2022-11-03 02:33:05,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:33:05,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227496743] [2022-11-03 02:33:05,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:05,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:33:06,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:06,060 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:33:06,060 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:33:06,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227496743] [2022-11-03 02:33:06,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227496743] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:33:06,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548668647] [2022-11-03 02:33:06,061 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:33:06,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:33:06,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:33:06,068 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:33:06,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 02:33:06,191 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 02:33:06,191 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:33:06,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:33:06,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:33:06,233 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:33:06,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:33:06,272 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:33:06,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548668647] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:33:06,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [350967616] [2022-11-03 02:33:06,275 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2022-11-03 02:33:06,276 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:33:06,276 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:33:06,276 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:33:06,277 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:33:06,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:06,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:06,312 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:33:06,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 28 [2022-11-03 02:33:06,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:06,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:06,329 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:33:06,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 28 [2022-11-03 02:33:06,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:06,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:06,352 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:33:06,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 73 treesize of output 60 [2022-11-03 02:33:06,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:06,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:06,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:06,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:06,480 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 02:33:06,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 332 treesize of output 308 [2022-11-03 02:33:06,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:06,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:06,551 INFO L356 Elim1Store]: treesize reduction 49, result has 29.0 percent of original size [2022-11-03 02:33:06,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 358 treesize of output 325 [2022-11-03 02:33:06,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:06,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:06,613 INFO L356 Elim1Store]: treesize reduction 52, result has 24.6 percent of original size [2022-11-03 02:33:06,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 354 treesize of output 318 [2022-11-03 02:33:06,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:06,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:06,677 INFO L356 Elim1Store]: treesize reduction 52, result has 24.6 percent of original size [2022-11-03 02:33:06,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 319 treesize of output 316 [2022-11-03 02:33:06,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 12 [2022-11-03 02:33:06,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2022-11-03 02:33:06,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 12 [2022-11-03 02:33:06,960 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:33:06,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 19 [2022-11-03 02:33:06,992 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:33:06,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 19 [2022-11-03 02:33:07,029 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-11-03 02:33:07,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 31 [2022-11-03 02:33:07,158 INFO L197 IcfgInterpreter]: Interpreting procedure fake_malloc with input of size 49 for LOIs [2022-11-03 02:33:07,176 INFO L197 IcfgInterpreter]: Interpreting procedure g with input of size 36 for LOIs [2022-11-03 02:33:07,195 INFO L197 IcfgInterpreter]: Interpreting procedure f with input of size 55 for LOIs [2022-11-03 02:33:07,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 11 [2022-11-03 02:33:07,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 11 [2022-11-03 02:33:07,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-11-03 02:33:07,349 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:33:08,909 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1277#(and (= 5 |~#pstate~0.base|) (not (= |g_#t~mem9#1| 1)) (= |g_#in~pointer#1.base| 0) (= |~#pstate~0.offset| 0) (= |g_~i~2#1| 0) (= |#memory_int| |old(#memory_int)|) (not (= |g_#in~pointer#1.offset| 0)) (= |g_~pointer#1.base| (select (select |#memory_$Pointer$.base| |~#pp~0.base|) (+ |~#pp~0.offset| (* |g_~i~2#1| 4)))) (= |g_~pointer#1.offset| (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) (+ |~#pp~0.offset| (* |g_~i~2#1| 4)))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |g_~pointer#1.offset| |g_#in~pointer#1.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (select (select |#memory_int| |~#pstate~0.base|) (+ |~#pstate~0.offset| (* |g_~i~2#1| 4))) |g_#t~mem9#1|) (= |~#pp~0.offset| 0) (= |#NULL.offset| 0) (not (= ~counter~0 1)) (= 4 |~#pp~0.base|) (= |g_~pointer#1.base| |g_#in~pointer#1.base|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-03 02:33:08,909 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:33:08,909 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:33:08,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-03 02:33:08,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40739374] [2022-11-03 02:33:08,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:33:08,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:33:08,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:33:08,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:33:08,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2022-11-03 02:33:08,912 INFO L87 Difference]: Start difference. First operand 43 states and 56 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-03 02:33:08,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:33:08,969 INFO L93 Difference]: Finished difference Result 77 states and 103 transitions. [2022-11-03 02:33:08,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:33:08,969 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 32 [2022-11-03 02:33:08,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:33:08,971 INFO L225 Difference]: With dead ends: 77 [2022-11-03 02:33:08,971 INFO L226 Difference]: Without dead ends: 46 [2022-11-03 02:33:08,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 74 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2022-11-03 02:33:08,973 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:33:08,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 74 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:33:08,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-03 02:33:08,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2022-11-03 02:33:08,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 32 states have internal predecessors, (40), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2022-11-03 02:33:08,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 57 transitions. [2022-11-03 02:33:08,986 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 57 transitions. Word has length 32 [2022-11-03 02:33:08,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:33:08,987 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 57 transitions. [2022-11-03 02:33:08,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-03 02:33:08,987 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 57 transitions. [2022-11-03 02:33:08,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 02:33:08,989 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:33:08,989 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:33:09,039 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 02:33:09,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:33:09,209 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:33:09,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:33:09,209 INFO L85 PathProgramCache]: Analyzing trace with hash -586610002, now seen corresponding path program 1 times [2022-11-03 02:33:09,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:33:09,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409305822] [2022-11-03 02:33:09,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:09,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:33:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:10,339 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 02:33:10,339 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:33:10,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409305822] [2022-11-03 02:33:10,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409305822] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:33:10,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508272732] [2022-11-03 02:33:10,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:10,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:33:10,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:33:10,345 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:33:10,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 02:33:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:10,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-03 02:33:10,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:33:10,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:33:10,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:33:11,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:11,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:11,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 23 [2022-11-03 02:33:11,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:11,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 22 [2022-11-03 02:33:11,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:33:11,199 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 02:33:11,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:33:11,328 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_428 (Array Int Int)) (v_f_~i~1_52 Int) (v_ArrVal_427 Int)) (or (< v_f_~i~1_52 1) (= (select (store (select (store |c_#memory_int| |c_~#pp~0.base| v_ArrVal_428) |c_~#pstate~0.base|) (+ (* v_f_~i~1_52 4) |c_~#pstate~0.offset|) v_ArrVal_427) |c_~#pstate~0.offset|) 1))) is different from false [2022-11-03 02:33:11,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508272732] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:33:11,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1009749081] [2022-11-03 02:33:11,334 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2022-11-03 02:33:11,334 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:33:11,334 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:33:11,335 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:33:11,335 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:33:11,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:11,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 58 treesize of output 50 [2022-11-03 02:33:11,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:11,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 23 [2022-11-03 02:33:11,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:11,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 23 [2022-11-03 02:33:11,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:11,522 INFO L356 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-03 02:33:11,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 343 treesize of output 300 [2022-11-03 02:33:11,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:11,582 INFO L356 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-03 02:33:11,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 343 treesize of output 300 [2022-11-03 02:33:11,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:11,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:11,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:11,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 317 treesize of output 286 [2022-11-03 02:33:11,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:11,686 INFO L356 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-03 02:33:11,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 308 treesize of output 298 [2022-11-03 02:33:11,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 12 [2022-11-03 02:33:11,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2022-11-03 02:33:11,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 12 [2022-11-03 02:33:11,883 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:33:11,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 19 [2022-11-03 02:33:11,909 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:33:11,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 19 [2022-11-03 02:33:11,939 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-11-03 02:33:11,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 31 [2022-11-03 02:33:12,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-11-03 02:33:12,111 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:33:12,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-11-03 02:33:12,211 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:33:12,370 INFO L197 IcfgInterpreter]: Interpreting procedure fake_malloc with input of size 49 for LOIs [2022-11-03 02:33:12,392 INFO L197 IcfgInterpreter]: Interpreting procedure g with input of size 59 for LOIs [2022-11-03 02:33:12,453 INFO L197 IcfgInterpreter]: Interpreting procedure f with input of size 20 for LOIs [2022-11-03 02:33:12,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:12,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-11-03 02:33:12,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:12,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 11 [2022-11-03 02:33:12,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:12,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 11 [2022-11-03 02:33:12,565 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:33:15,548 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1613#(and (not (= |g_#t~mem9#1| 1)) (= |g_#in~pointer#1.base| 0) (= |g_~i~2#1| 0) (= |#memory_int| |old(#memory_int)|) (not (= |g_#in~pointer#1.offset| 0)) (= |g_~pointer#1.base| (select (select |#memory_$Pointer$.base| |~#pp~0.base|) (+ |~#pp~0.offset| (* |g_~i~2#1| 4)))) (= |g_~pointer#1.offset| (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) (+ |~#pp~0.offset| (* |g_~i~2#1| 4)))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |g_~pointer#1.offset| |g_#in~pointer#1.offset|) (<= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (select (select |old(#memory_int)| |~#pstate~0.base|) (+ |~#pstate~0.offset| 4)) 1) (= (select (select |#memory_int| |~#pstate~0.base|) (+ |~#pstate~0.offset| (* |g_~i~2#1| 4))) |g_#t~mem9#1|) (<= |~#pp~0.base| 4) (<= 5 |~#pstate~0.base|) (<= |~#pstate~0.base| 5) (= |~#pp~0.offset| 0) (<= 0 |~#pstate~0.offset|) (<= |~#pstate~0.offset| 0) (not (= ~counter~0 1)) (<= 0 |#NULL.offset|) (= |g_~pointer#1.base| |g_#in~pointer#1.base|) (<= 4 |~#pp~0.base|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-03 02:33:15,548 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:33:15,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:33:15,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2022-11-03 02:33:15,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157098579] [2022-11-03 02:33:15,549 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:33:15,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-03 02:33:15,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:33:15,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-03 02:33:15,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1677, Unknown=12, NotChecked=84, Total=1980 [2022-11-03 02:33:15,551 INFO L87 Difference]: Start difference. First operand 44 states and 57 transitions. Second operand has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 18 states have internal predecessors, (42), 6 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-03 02:33:17,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:33:17,809 INFO L93 Difference]: Finished difference Result 156 states and 201 transitions. [2022-11-03 02:33:17,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-03 02:33:17,810 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 18 states have internal predecessors, (42), 6 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) Word has length 33 [2022-11-03 02:33:17,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:33:17,812 INFO L225 Difference]: With dead ends: 156 [2022-11-03 02:33:17,812 INFO L226 Difference]: Without dead ends: 146 [2022-11-03 02:33:17,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1456 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=614, Invalid=4309, Unknown=51, NotChecked=138, Total=5112 [2022-11-03 02:33:17,816 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 188 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:33:17,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 329 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 490 Invalid, 0 Unknown, 83 Unchecked, 0.7s Time] [2022-11-03 02:33:17,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-03 02:33:17,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 70. [2022-11-03 02:33:17,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 54 states have internal predecessors, (67), 10 states have call successors, (10), 6 states have call predecessors, (10), 10 states have return successors, (15), 9 states have call predecessors, (15), 8 states have call successors, (15) [2022-11-03 02:33:17,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2022-11-03 02:33:17,846 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 92 transitions. Word has length 33 [2022-11-03 02:33:17,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:33:17,846 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 92 transitions. [2022-11-03 02:33:17,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 18 states have internal predecessors, (42), 6 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-03 02:33:17,847 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 92 transitions. [2022-11-03 02:33:17,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-03 02:33:17,848 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:33:17,848 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:33:17,900 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 02:33:18,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-03 02:33:18,065 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:33:18,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:33:18,065 INFO L85 PathProgramCache]: Analyzing trace with hash -698965959, now seen corresponding path program 1 times [2022-11-03 02:33:18,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:33:18,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71501536] [2022-11-03 02:33:18,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:18,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:33:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:18,727 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:33:18,727 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:33:18,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71501536] [2022-11-03 02:33:18,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71501536] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:33:18,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733651741] [2022-11-03 02:33:18,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:18,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:33:18,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:33:18,729 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:33:18,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 02:33:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:18,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-03 02:33:18,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:33:19,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-03 02:33:19,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:19,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-03 02:33:19,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:33:19,458 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 02:33:19,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:33:19,690 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:33:19,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 20 [2022-11-03 02:33:19,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 25 [2022-11-03 02:33:19,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-03 02:33:19,788 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:33:19,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-11-03 02:33:19,791 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:33:19,797 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:33:19,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 21 treesize of output 19 [2022-11-03 02:33:20,038 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 02:33:20,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733651741] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:33:20,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [475089606] [2022-11-03 02:33:20,045 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-03 02:33:20,047 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:33:20,048 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:33:20,048 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:33:20,049 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:33:20,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:20,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:20,082 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:33:20,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 28 [2022-11-03 02:33:20,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:20,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:20,103 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:33:20,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 73 treesize of output 60 [2022-11-03 02:33:20,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:20,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:20,122 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:33:20,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 28 [2022-11-03 02:33:20,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:20,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:20,342 INFO L356 Elim1Store]: treesize reduction 52, result has 24.6 percent of original size [2022-11-03 02:33:20,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 358 treesize of output 322 [2022-11-03 02:33:20,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:20,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:20,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:20,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:20,398 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 02:33:20,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 332 treesize of output 308 [2022-11-03 02:33:20,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:20,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:20,456 INFO L356 Elim1Store]: treesize reduction 49, result has 29.0 percent of original size [2022-11-03 02:33:20,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 358 treesize of output 325 [2022-11-03 02:33:20,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:20,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:20,517 INFO L356 Elim1Store]: treesize reduction 49, result has 29.0 percent of original size [2022-11-03 02:33:20,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 319 treesize of output 319 [2022-11-03 02:33:20,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 12 [2022-11-03 02:33:20,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2022-11-03 02:33:20,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 12 [2022-11-03 02:33:20,859 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:33:20,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 23 [2022-11-03 02:33:20,891 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-11-03 02:33:20,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 31 [2022-11-03 02:33:20,922 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:33:20,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 23 [2022-11-03 02:33:21,067 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:33:21,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:33:21,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:33:21,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:33:21,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:33:21,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:33:21,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:33:21,267 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:33:21,449 INFO L197 IcfgInterpreter]: Interpreting procedure fake_malloc with input of size 49 for LOIs [2022-11-03 02:33:21,466 INFO L197 IcfgInterpreter]: Interpreting procedure g with input of size 67 for LOIs [2022-11-03 02:33:21,626 INFO L197 IcfgInterpreter]: Interpreting procedure f with input of size 20 for LOIs [2022-11-03 02:33:21,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 59 treesize of output 15 [2022-11-03 02:33:21,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-11-03 02:33:21,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 59 treesize of output 15 [2022-11-03 02:33:21,670 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:33:24,891 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2238#(and (= 5 |~#pstate~0.base|) (or (and (<= 0 |g_~pointer#1.base|) (<= |g_~i~2#1| 2) (<= 1 |g_~i~2#1|) (<= |g_~pointer#1.base| 0) (<= 0 |#StackHeapBarrier|)) (and (<= 0 |g_~pointer#1.base|) (<= 0 |g_~i~2#1|) (<= |g_~pointer#1.base| 0) (<= |g_~i~2#1| 0) (<= 0 |#StackHeapBarrier|))) (not (= |g_#t~mem9#1| 1)) (= |g_#in~pointer#1.base| 0) (= |~#pstate~0.offset| 0) (= (select (select |#memory_int| |~#pstate~0.base|) (+ |~#pstate~0.offset| (* |g_~i~2#1| 4))) |g_#t~mem9#1|) (= |~#pp~0.offset| 0) (= |#NULL.offset| 0) (= 4 |~#pp~0.base|) (= |#NULL.base| 0))' at error location [2022-11-03 02:33:24,892 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:33:24,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:33:24,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 40 [2022-11-03 02:33:24,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402567197] [2022-11-03 02:33:24,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:33:24,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-03 02:33:24,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:33:24,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-03 02:33:24,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=3247, Unknown=0, NotChecked=0, Total=3540 [2022-11-03 02:33:24,896 INFO L87 Difference]: Start difference. First operand 70 states and 92 transitions. Second operand has 40 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 29 states have internal predecessors, (54), 11 states have call successors, (13), 8 states have call predecessors, (13), 11 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-11-03 02:33:26,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:33:26,644 INFO L93 Difference]: Finished difference Result 134 states and 167 transitions. [2022-11-03 02:33:26,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-03 02:33:26,645 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 29 states have internal predecessors, (54), 11 states have call successors, (13), 8 states have call predecessors, (13), 11 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 34 [2022-11-03 02:33:26,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:33:26,646 INFO L225 Difference]: With dead ends: 134 [2022-11-03 02:33:26,646 INFO L226 Difference]: Without dead ends: 107 [2022-11-03 02:33:26,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1514 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=544, Invalid=5308, Unknown=0, NotChecked=0, Total=5852 [2022-11-03 02:33:26,649 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 172 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1210 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 02:33:26,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 57 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1210 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-03 02:33:26,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-03 02:33:26,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 95. [2022-11-03 02:33:26,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 73 states have internal predecessors, (91), 13 states have call successors, (13), 9 states have call predecessors, (13), 14 states have return successors, (18), 12 states have call predecessors, (18), 9 states have call successors, (18) [2022-11-03 02:33:26,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 122 transitions. [2022-11-03 02:33:26,676 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 122 transitions. Word has length 34 [2022-11-03 02:33:26,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:33:26,676 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 122 transitions. [2022-11-03 02:33:26,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 29 states have internal predecessors, (54), 11 states have call successors, (13), 8 states have call predecessors, (13), 11 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-11-03 02:33:26,677 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 122 transitions. [2022-11-03 02:33:26,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-03 02:33:26,678 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:33:26,678 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:33:26,721 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 02:33:26,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-03 02:33:26,889 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:33:26,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:33:26,889 INFO L85 PathProgramCache]: Analyzing trace with hash -386286515, now seen corresponding path program 2 times [2022-11-03 02:33:26,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:33:26,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93973246] [2022-11-03 02:33:26,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:26,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:33:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:27,659 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 02:33:27,659 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:33:27,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93973246] [2022-11-03 02:33:27,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93973246] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:33:27,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362466521] [2022-11-03 02:33:27,659 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:33:27,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:33:27,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:33:27,660 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:33:27,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 02:33:27,811 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 02:33:27,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:33:27,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 92 conjunts are in the unsatisfiable core [2022-11-03 02:33:27,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:33:27,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-03 02:33:27,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:27,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-03 02:33:27,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:27,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-03 02:33:27,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:27,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-03 02:33:28,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:33:28,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 [2022-11-03 02:33:28,745 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-03 02:33:28,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 34 [2022-11-03 02:33:28,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:28,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 31 [2022-11-03 02:33:28,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:33:28,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:33:29,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:29,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:29,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 65 treesize of output 60 [2022-11-03 02:33:29,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:29,421 INFO L356 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2022-11-03 02:33:29,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 61 treesize of output 70 [2022-11-03 02:33:29,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:29,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 71 treesize of output 67 [2022-11-03 02:33:29,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:29,456 INFO L356 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2022-11-03 02:33:29,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 47 treesize of output 64 [2022-11-03 02:33:29,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:29,874 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:33:29,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 42 treesize of output 22 [2022-11-03 02:33:29,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:33:29,974 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 02:33:29,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:33:30,259 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_722 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_f_~i~1_71 Int) (v_ArrVal_723 Int)) (let ((.cse0 (* v_f_~i~1_71 4))) (or (= (select (store (select (store |c_#memory_int| |c_~#pp~0.base| v_ArrVal_722) |c_~#pstate~0.base|) (+ .cse0 |c_~#pstate~0.offset|) v_ArrVal_723) |c_~#pstate~0.offset|) 1) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| .cse0) |c_ULTIMATE.start_main_~b~0#1.offset|)) |c_~#pstate~0.base| v_ArrVal_724) |c_~#pp~0.base|) |c_~#pp~0.offset|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 1 v_f_~i~1_71))))) is different from false [2022-11-03 02:33:30,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362466521] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:33:30,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1644006283] [2022-11-03 02:33:30,264 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2022-11-03 02:33:30,264 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:33:30,265 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:33:30,265 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:33:30,265 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:33:30,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:30,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:30,289 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:33:30,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 28 [2022-11-03 02:33:30,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:30,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:30,306 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:33:30,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 73 treesize of output 60 [2022-11-03 02:33:30,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:30,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:30,320 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:33:30,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 28 [2022-11-03 02:33:30,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:30,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:30,462 INFO L356 Elim1Store]: treesize reduction 52, result has 24.6 percent of original size [2022-11-03 02:33:30,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 358 treesize of output 322 [2022-11-03 02:33:30,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:30,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:30,517 INFO L356 Elim1Store]: treesize reduction 52, result has 24.6 percent of original size [2022-11-03 02:33:30,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 358 treesize of output 322 [2022-11-03 02:33:30,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:30,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:30,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:30,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:30,552 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 02:33:30,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 332 treesize of output 308 [2022-11-03 02:33:30,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:30,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:30,597 INFO L356 Elim1Store]: treesize reduction 52, result has 24.6 percent of original size [2022-11-03 02:33:30,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 323 treesize of output 320 [2022-11-03 02:33:30,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2022-11-03 02:33:30,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 12 [2022-11-03 02:33:30,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 12 [2022-11-03 02:33:30,766 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-11-03 02:33:30,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 31 [2022-11-03 02:33:30,789 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:33:30,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 19 [2022-11-03 02:33:30,817 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:33:30,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 19 [2022-11-03 02:33:30,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-11-03 02:33:30,932 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:33:31,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-11-03 02:33:31,033 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:33:31,129 INFO L197 IcfgInterpreter]: Interpreting procedure fake_malloc with input of size 49 for LOIs [2022-11-03 02:33:31,142 INFO L197 IcfgInterpreter]: Interpreting procedure g with input of size 59 for LOIs [2022-11-03 02:33:31,185 INFO L197 IcfgInterpreter]: Interpreting procedure f with input of size 20 for LOIs [2022-11-03 02:33:31,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:31,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-11-03 02:33:31,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:31,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 11 [2022-11-03 02:33:31,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:31,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 11 [2022-11-03 02:33:31,270 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:33:34,770 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2784#(and (not (= |g_#t~mem9#1| 1)) (= |g_#in~pointer#1.base| 0) (= |g_~i~2#1| 0) (= |#memory_int| |old(#memory_int)|) (not (= |g_#in~pointer#1.offset| 0)) (= |g_~pointer#1.base| (select (select |#memory_$Pointer$.base| |~#pp~0.base|) (+ |~#pp~0.offset| (* |g_~i~2#1| 4)))) (= |g_~pointer#1.offset| (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) (+ |~#pp~0.offset| (* |g_~i~2#1| 4)))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |g_~pointer#1.offset| |g_#in~pointer#1.offset|) (<= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (select (select |old(#memory_int)| |~#pstate~0.base|) (+ |~#pstate~0.offset| 4)) 1) (= (select (select |#memory_int| |~#pstate~0.base|) (+ |~#pstate~0.offset| (* |g_~i~2#1| 4))) |g_#t~mem9#1|) (<= |~#pp~0.base| 4) (<= 5 |~#pstate~0.base|) (<= |~#pstate~0.base| 5) (= |~#pp~0.offset| 0) (<= 0 |~#pstate~0.offset|) (<= |~#pstate~0.offset| 0) (not (= ~counter~0 1)) (<= 0 |#NULL.offset|) (= |g_~pointer#1.base| |g_#in~pointer#1.base|) (<= 4 |~#pp~0.base|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-03 02:33:34,770 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:33:34,770 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:33:34,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 24] total 41 [2022-11-03 02:33:34,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470861486] [2022-11-03 02:33:34,771 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:33:34,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-03 02:33:34,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:33:34,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-03 02:33:34,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=3736, Unknown=50, NotChecked=124, Total=4160 [2022-11-03 02:33:34,778 INFO L87 Difference]: Start difference. First operand 95 states and 122 transitions. Second operand has 41 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 30 states have internal predecessors, (49), 10 states have call successors, (10), 7 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-03 02:33:37,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:33:37,595 INFO L93 Difference]: Finished difference Result 143 states and 182 transitions. [2022-11-03 02:33:37,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-03 02:33:37,596 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 30 states have internal predecessors, (49), 10 states have call successors, (10), 7 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 35 [2022-11-03 02:33:37,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:33:37,598 INFO L225 Difference]: With dead ends: 143 [2022-11-03 02:33:37,598 INFO L226 Difference]: Without dead ends: 126 [2022-11-03 02:33:37,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1782 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=473, Invalid=7289, Unknown=74, NotChecked=174, Total=8010 [2022-11-03 02:33:37,601 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 76 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 281 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:33:37,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 384 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 791 Invalid, 0 Unknown, 281 Unchecked, 0.7s Time] [2022-11-03 02:33:37,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-03 02:33:37,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 95. [2022-11-03 02:33:37,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.3432835820895523) internal successors, (90), 73 states have internal predecessors, (90), 13 states have call successors, (13), 9 states have call predecessors, (13), 14 states have return successors, (18), 12 states have call predecessors, (18), 9 states have call successors, (18) [2022-11-03 02:33:37,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 121 transitions. [2022-11-03 02:33:37,628 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 121 transitions. Word has length 35 [2022-11-03 02:33:37,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:33:37,628 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 121 transitions. [2022-11-03 02:33:37,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 30 states have internal predecessors, (49), 10 states have call successors, (10), 7 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-03 02:33:37,629 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 121 transitions. [2022-11-03 02:33:37,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 02:33:37,630 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:33:37,630 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:33:37,673 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 02:33:37,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-03 02:33:37,856 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:33:37,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:33:37,856 INFO L85 PathProgramCache]: Analyzing trace with hash 796674089, now seen corresponding path program 3 times [2022-11-03 02:33:37,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:33:37,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143656487] [2022-11-03 02:33:37,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:37,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:33:37,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:38,641 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 02:33:38,641 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:33:38,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143656487] [2022-11-03 02:33:38,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143656487] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:33:38,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072325215] [2022-11-03 02:33:38,642 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:33:38,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:33:38,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:33:38,645 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:33:38,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 02:33:38,782 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:33:38,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:33:38,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-03 02:33:38,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:33:38,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 10 treesize of output 4 [2022-11-03 02:33:38,893 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:33:38,997 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 02:33:38,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:33:39,342 INFO L356 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-11-03 02:33:39,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 25 [2022-11-03 02:33:39,348 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 02:33:39,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 12 [2022-11-03 02:33:39,373 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 02:33:39,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072325215] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:33:39,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1898097559] [2022-11-03 02:33:39,376 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2022-11-03 02:33:39,376 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:33:39,377 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:33:39,377 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:33:39,377 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:33:39,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:39,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 23 [2022-11-03 02:33:39,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:39,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 23 [2022-11-03 02:33:39,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:39,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 58 treesize of output 50 [2022-11-03 02:33:39,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:39,540 INFO L356 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-03 02:33:39,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 343 treesize of output 300 [2022-11-03 02:33:39,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:39,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:39,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:39,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 317 treesize of output 286 [2022-11-03 02:33:39,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:39,611 INFO L356 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-03 02:33:39,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 308 treesize of output 298 [2022-11-03 02:33:39,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:39,648 INFO L356 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-03 02:33:39,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 343 treesize of output 300 [2022-11-03 02:33:39,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2022-11-03 02:33:39,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 12 [2022-11-03 02:33:39,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 12 [2022-11-03 02:33:39,814 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-11-03 02:33:39,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 31 [2022-11-03 02:33:39,835 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:33:39,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 19 [2022-11-03 02:33:39,860 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:33:39,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 19 [2022-11-03 02:33:39,925 INFO L197 IcfgInterpreter]: Interpreting procedure fake_malloc with input of size 49 for LOIs [2022-11-03 02:33:39,939 INFO L197 IcfgInterpreter]: Interpreting procedure g with input of size 36 for LOIs [2022-11-03 02:33:39,952 INFO L197 IcfgInterpreter]: Interpreting procedure f with input of size 55 for LOIs [2022-11-03 02:33:40,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:40,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 11 [2022-11-03 02:33:40,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:40,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 11 [2022-11-03 02:33:40,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:40,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-11-03 02:33:40,094 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:33:42,005 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3423#(and (= 5 |~#pstate~0.base|) (not (= |g_#t~mem9#1| 1)) (= |g_#in~pointer#1.base| 0) (= |~#pstate~0.offset| 0) (= |g_~i~2#1| 0) (= |#memory_int| |old(#memory_int)|) (not (= |g_#in~pointer#1.offset| 0)) (= |g_~pointer#1.base| (select (select |#memory_$Pointer$.base| |~#pp~0.base|) (+ |~#pp~0.offset| (* |g_~i~2#1| 4)))) (= |g_~pointer#1.offset| (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) (+ |~#pp~0.offset| (* |g_~i~2#1| 4)))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |g_~pointer#1.offset| |g_#in~pointer#1.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (select (select |#memory_int| |~#pstate~0.base|) (+ |~#pstate~0.offset| (* |g_~i~2#1| 4))) |g_#t~mem9#1|) (= |~#pp~0.offset| 0) (= |#NULL.offset| 0) (not (= ~counter~0 1)) (= 4 |~#pp~0.base|) (= |g_~pointer#1.base| |g_#in~pointer#1.base|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-03 02:33:42,005 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:33:42,005 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:33:42,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2022-11-03 02:33:42,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078829161] [2022-11-03 02:33:42,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:33:42,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-03 02:33:42,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:33:42,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-03 02:33:42,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1356, Unknown=0, NotChecked=0, Total=1482 [2022-11-03 02:33:42,008 INFO L87 Difference]: Start difference. First operand 95 states and 121 transitions. Second operand has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-03 02:33:43,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:33:43,360 INFO L93 Difference]: Finished difference Result 158 states and 197 transitions. [2022-11-03 02:33:43,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-03 02:33:43,361 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 36 [2022-11-03 02:33:43,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:33:43,363 INFO L225 Difference]: With dead ends: 158 [2022-11-03 02:33:43,363 INFO L226 Difference]: Without dead ends: 81 [2022-11-03 02:33:43,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 78 SyntacticMatches, 9 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=254, Invalid=2398, Unknown=0, NotChecked=0, Total=2652 [2022-11-03 02:33:43,370 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 80 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:33:43,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 285 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 02:33:43,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-03 02:33:43,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2022-11-03 02:33:43,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 51 states have (on average 1.2549019607843137) internal successors, (64), 54 states have internal predecessors, (64), 10 states have call successors, (10), 8 states have call predecessors, (10), 10 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) [2022-11-03 02:33:43,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 85 transitions. [2022-11-03 02:33:43,420 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 85 transitions. Word has length 36 [2022-11-03 02:33:43,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:33:43,421 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 85 transitions. [2022-11-03 02:33:43,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-03 02:33:43,421 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2022-11-03 02:33:43,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 02:33:43,431 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:33:43,432 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:33:43,465 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 02:33:43,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:33:43,641 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:33:43,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:33:43,641 INFO L85 PathProgramCache]: Analyzing trace with hash 32219533, now seen corresponding path program 4 times [2022-11-03 02:33:43,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:33:43,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291290764] [2022-11-03 02:33:43,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:43,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:33:43,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:45,259 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 02:33:45,259 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:33:45,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291290764] [2022-11-03 02:33:45,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291290764] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:33:45,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854278672] [2022-11-03 02:33:45,260 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 02:33:45,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:33:45,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:33:45,262 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:33:45,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 02:33:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:45,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-03 02:33:45,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:33:45,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 19 treesize of output 19 [2022-11-03 02:33:45,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:45,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 21 [2022-11-03 02:33:45,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:45,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-03 02:33:45,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:45,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-03 02:33:45,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:33:46,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:46,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-03 02:33:46,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:46,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 23 [2022-11-03 02:33:46,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:46,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 7 [2022-11-03 02:33:46,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 10 [2022-11-03 02:33:46,660 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 02:33:46,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:33:46,925 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_932 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) |c_~#pstate~0.base| v_ArrVal_932) |c_~#pp~0.base|) |c_~#pp~0.offset|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-11-03 02:33:46,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854278672] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:33:46,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1217327580] [2022-11-03 02:33:46,929 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2022-11-03 02:33:46,929 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:33:46,930 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:33:46,930 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:33:46,931 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:33:46,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:46,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:46,966 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:33:46,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 28 [2022-11-03 02:33:46,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:46,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:46,994 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:33:46,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 73 treesize of output 60 [2022-11-03 02:33:47,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:47,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:47,012 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:33:47,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 28 [2022-11-03 02:33:47,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:47,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:47,144 INFO L356 Elim1Store]: treesize reduction 49, result has 29.0 percent of original size [2022-11-03 02:33:47,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 358 treesize of output 325 [2022-11-03 02:33:47,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:47,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:47,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:47,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:47,184 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 02:33:47,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 328 treesize of output 304 [2022-11-03 02:33:47,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:47,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:47,244 INFO L356 Elim1Store]: treesize reduction 52, result has 24.6 percent of original size [2022-11-03 02:33:47,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 319 treesize of output 316 [2022-11-03 02:33:47,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:47,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:47,292 INFO L356 Elim1Store]: treesize reduction 52, result has 24.6 percent of original size [2022-11-03 02:33:47,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 354 treesize of output 318 [2022-11-03 02:33:47,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2022-11-03 02:33:47,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 12 [2022-11-03 02:33:47,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 12 [2022-11-03 02:33:47,494 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:33:47,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 19 [2022-11-03 02:33:47,526 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-11-03 02:33:47,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 31 [2022-11-03 02:33:47,550 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:33:47,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 19 [2022-11-03 02:33:47,671 INFO L197 IcfgInterpreter]: Interpreting procedure fake_malloc with input of size 49 for LOIs [2022-11-03 02:33:47,686 INFO L197 IcfgInterpreter]: Interpreting procedure g with input of size 36 for LOIs [2022-11-03 02:33:47,703 INFO L197 IcfgInterpreter]: Interpreting procedure f with input of size 55 for LOIs [2022-11-03 02:33:47,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:47,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 11 [2022-11-03 02:33:47,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:47,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 11 [2022-11-03 02:33:47,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:47,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-11-03 02:33:47,863 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:33:50,325 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3989#(and (= 5 |~#pstate~0.base|) (not (= |g_#t~mem9#1| 1)) (= |g_#in~pointer#1.base| 0) (= |~#pstate~0.offset| 0) (= |g_~i~2#1| 0) (= |#memory_int| |old(#memory_int)|) (not (= |g_#in~pointer#1.offset| 0)) (= |g_~pointer#1.base| (select (select |#memory_$Pointer$.base| |~#pp~0.base|) (+ |~#pp~0.offset| (* |g_~i~2#1| 4)))) (= |g_~pointer#1.offset| (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) (+ |~#pp~0.offset| (* |g_~i~2#1| 4)))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |g_~pointer#1.offset| |g_#in~pointer#1.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (select (select |#memory_int| |~#pstate~0.base|) (+ |~#pstate~0.offset| (* |g_~i~2#1| 4))) |g_#t~mem9#1|) (= |~#pp~0.offset| 0) (= |#NULL.offset| 0) (not (= ~counter~0 1)) (= 4 |~#pp~0.base|) (= |g_~pointer#1.base| |g_#in~pointer#1.base|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-03 02:33:50,325 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:33:50,328 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:33:50,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 36 [2022-11-03 02:33:50,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517884874] [2022-11-03 02:33:50,329 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:33:50,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-03 02:33:50,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:33:50,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-03 02:33:50,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=2942, Unknown=18, NotChecked=110, Total=3306 [2022-11-03 02:33:50,334 INFO L87 Difference]: Start difference. First operand 72 states and 85 transitions. Second operand has 36 states, 32 states have (on average 1.53125) internal successors, (49), 29 states have internal predecessors, (49), 6 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-03 02:33:52,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:33:52,284 INFO L93 Difference]: Finished difference Result 132 states and 156 transitions. [2022-11-03 02:33:52,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-03 02:33:52,285 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 32 states have (on average 1.53125) internal successors, (49), 29 states have internal predecessors, (49), 6 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 36 [2022-11-03 02:33:52,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:33:52,286 INFO L225 Difference]: With dead ends: 132 [2022-11-03 02:33:52,286 INFO L226 Difference]: Without dead ends: 111 [2022-11-03 02:33:52,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 44 SyntacticMatches, 11 SemanticMatches, 77 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1924 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=485, Invalid=5498, Unknown=27, NotChecked=152, Total=6162 [2022-11-03 02:33:52,289 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 188 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 02:33:52,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 362 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 798 Invalid, 0 Unknown, 48 Unchecked, 0.8s Time] [2022-11-03 02:33:52,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-11-03 02:33:52,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 82. [2022-11-03 02:33:52,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 61 states have (on average 1.2622950819672132) internal successors, (77), 63 states have internal predecessors, (77), 10 states have call successors, (10), 9 states have call predecessors, (10), 10 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) [2022-11-03 02:33:52,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 97 transitions. [2022-11-03 02:33:52,314 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 97 transitions. Word has length 36 [2022-11-03 02:33:52,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:33:52,314 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 97 transitions. [2022-11-03 02:33:52,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 32 states have (on average 1.53125) internal successors, (49), 29 states have internal predecessors, (49), 6 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-03 02:33:52,315 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 97 transitions. [2022-11-03 02:33:52,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 02:33:52,316 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:33:52,316 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:33:52,353 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-03 02:33:52,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-03 02:33:52,533 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:33:52,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:33:52,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1216094842, now seen corresponding path program 1 times [2022-11-03 02:33:52,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:33:52,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539780852] [2022-11-03 02:33:52,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:52,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:33:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:53,906 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 02:33:53,906 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:33:53,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539780852] [2022-11-03 02:33:53,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539780852] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:33:53,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865763997] [2022-11-03 02:33:53,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:53,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:33:53,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:33:53,909 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:33:53,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 02:33:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:54,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-03 02:33:54,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:33:54,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:33:54,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-11-03 02:33:54,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:54,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:54,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2022-11-03 02:33:54,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:54,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 24 [2022-11-03 02:33:54,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:33:54,733 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 02:33:54,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:33:54,882 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1072 Int) (v_f_~i~1_121 Int)) (or (= (select (store (select (store |c_#memory_int| |c_~#pp~0.base| v_ArrVal_1071) |c_~#pstate~0.base|) (+ (* v_f_~i~1_121 4) |c_~#pstate~0.offset|) v_ArrVal_1072) (+ |c_~#pstate~0.offset| 4)) 1) (not (<= v_f_~i~1_121 0)))) is different from false [2022-11-03 02:33:54,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865763997] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:33:54,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [35786990] [2022-11-03 02:33:54,886 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-03 02:33:54,886 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:33:54,887 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:33:54,887 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:33:54,887 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:33:54,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:54,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 23 [2022-11-03 02:33:54,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:54,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 58 treesize of output 50 [2022-11-03 02:33:54,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:54,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 23 [2022-11-03 02:33:55,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:55,077 INFO L356 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-03 02:33:55,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 343 treesize of output 300 [2022-11-03 02:33:55,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:55,141 INFO L356 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-03 02:33:55,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 343 treesize of output 300 [2022-11-03 02:33:55,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:55,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:55,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:55,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 317 treesize of output 286 [2022-11-03 02:33:55,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:55,209 INFO L356 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-03 02:33:55,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 308 treesize of output 298 [2022-11-03 02:33:55,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 12 [2022-11-03 02:33:55,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2022-11-03 02:33:55,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 12 [2022-11-03 02:33:55,356 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:33:55,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 19 [2022-11-03 02:33:55,384 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-11-03 02:33:55,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 31 [2022-11-03 02:33:55,422 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:33:55,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 19 [2022-11-03 02:33:55,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 3 [2022-11-03 02:33:55,579 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:33:55,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 3 [2022-11-03 02:33:55,690 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:33:55,838 INFO L197 IcfgInterpreter]: Interpreting procedure fake_malloc with input of size 49 for LOIs [2022-11-03 02:33:55,853 INFO L197 IcfgInterpreter]: Interpreting procedure g with input of size 70 for LOIs [2022-11-03 02:33:56,131 INFO L197 IcfgInterpreter]: Interpreting procedure f with input of size 20 for LOIs [2022-11-03 02:33:56,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:56,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 11 [2022-11-03 02:33:56,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:56,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-11-03 02:33:56,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:56,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 11 [2022-11-03 02:33:56,228 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:33:59,389 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4516#(and (= 5 |~#pstate~0.base|) (not (= |g_#t~mem9#1| 1)) (= |g_#in~pointer#1.base| 0) (<= 0 |g_~pointer#1.base|) (<= |g_~i~2#1| 2) (<= 0 |g_~i~2#1|) (= (select (select |#memory_int| |~#pstate~0.base|) (+ |~#pstate~0.offset| (* |g_~i~2#1| 4))) |g_#t~mem9#1|) (= |~#pp~0.offset| 0) (= |#NULL.offset| 0) (<= |g_~pointer#1.base| 0) (<= 0 |~#pstate~0.offset|) (<= |~#pstate~0.offset| 0) (= 4 |~#pp~0.base|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-03 02:33:59,389 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:33:59,389 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:33:59,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 30 [2022-11-03 02:33:59,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734531045] [2022-11-03 02:33:59,390 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:33:59,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-03 02:33:59,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:33:59,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-03 02:33:59,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=2427, Unknown=26, NotChecked=100, Total=2756 [2022-11-03 02:33:59,393 INFO L87 Difference]: Start difference. First operand 82 states and 97 transitions. Second operand has 30 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 22 states have internal predecessors, (48), 8 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-03 02:34:03,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:34:03,248 INFO L93 Difference]: Finished difference Result 184 states and 222 transitions. [2022-11-03 02:34:03,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-03 02:34:03,248 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 22 states have internal predecessors, (48), 8 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) Word has length 36 [2022-11-03 02:34:03,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:34:03,250 INFO L225 Difference]: With dead ends: 184 [2022-11-03 02:34:03,250 INFO L226 Difference]: Without dead ends: 151 [2022-11-03 02:34:03,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 91 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2277 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=785, Invalid=7531, Unknown=60, NotChecked=180, Total=8556 [2022-11-03 02:34:03,253 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 259 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 02:34:03,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 391 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 772 Invalid, 0 Unknown, 111 Unchecked, 0.8s Time] [2022-11-03 02:34:03,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-03 02:34:03,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 98. [2022-11-03 02:34:03,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 76 states have (on average 1.2763157894736843) internal successors, (97), 77 states have internal predecessors, (97), 11 states have call successors, (11), 10 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2022-11-03 02:34:03,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2022-11-03 02:34:03,277 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 36 [2022-11-03 02:34:03,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:34:03,278 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2022-11-03 02:34:03,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 22 states have internal predecessors, (48), 8 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-03 02:34:03,278 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2022-11-03 02:34:03,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 02:34:03,279 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:34:03,279 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:34:03,315 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-03 02:34:03,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:34:03,501 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:34:03,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:34:03,501 INFO L85 PathProgramCache]: Analyzing trace with hash 934057722, now seen corresponding path program 2 times [2022-11-03 02:34:03,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:34:03,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219537807] [2022-11-03 02:34:03,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:34:03,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:34:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:34:04,342 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 02:34:04,342 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:34:04,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219537807] [2022-11-03 02:34:04,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219537807] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:34:04,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384848222] [2022-11-03 02:34:04,343 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:34:04,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:34:04,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:34:04,345 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:34:04,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 02:34:04,534 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 02:34:04,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:34:04,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-03 02:34:04,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:34:04,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:34:04,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-11-03 02:34:04,737 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:34:04,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:34:04,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 14 [2022-11-03 02:34:04,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 16 [2022-11-03 02:34:04,874 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:34:04,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384848222] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:34:04,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [119527307] [2022-11-03 02:34:04,876 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-03 02:34:04,877 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:34:04,877 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:34:04,877 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:34:04,877 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:34:04,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:04,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 23 [2022-11-03 02:34:04,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:04,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 23 [2022-11-03 02:34:04,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:04,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 58 treesize of output 50 [2022-11-03 02:34:04,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:05,040 INFO L356 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-03 02:34:05,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 343 treesize of output 300 [2022-11-03 02:34:05,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:05,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:05,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:05,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 317 treesize of output 286 [2022-11-03 02:34:05,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:05,108 INFO L356 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-03 02:34:05,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 308 treesize of output 298 [2022-11-03 02:34:05,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:05,147 INFO L356 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-03 02:34:05,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 343 treesize of output 300 [2022-11-03 02:34:05,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 12 [2022-11-03 02:34:05,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 12 [2022-11-03 02:34:05,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2022-11-03 02:34:05,318 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:34:05,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 19 [2022-11-03 02:34:05,340 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:34:05,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 19 [2022-11-03 02:34:05,365 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-11-03 02:34:05,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 31 [2022-11-03 02:34:05,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-11-03 02:34:05,527 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:34:05,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:34:05,615 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:34:05,732 INFO L197 IcfgInterpreter]: Interpreting procedure fake_malloc with input of size 49 for LOIs [2022-11-03 02:34:05,749 INFO L197 IcfgInterpreter]: Interpreting procedure g with input of size 59 for LOIs [2022-11-03 02:34:05,903 INFO L197 IcfgInterpreter]: Interpreting procedure f with input of size 20 for LOIs [2022-11-03 02:34:05,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:05,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-11-03 02:34:05,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:05,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 11 [2022-11-03 02:34:05,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:05,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 11 [2022-11-03 02:34:06,034 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:34:08,716 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5238#(and (= 5 |~#pstate~0.base|) (not (= |g_#t~mem9#1| 1)) (= |g_#in~pointer#1.base| 0) (<= 0 |g_~pointer#1.base|) (<= |g_~i~2#1| 2) (<= 0 |g_~i~2#1|) (= (select (select |#memory_int| |~#pstate~0.base|) (+ |~#pstate~0.offset| (* |g_~i~2#1| 4))) |g_#t~mem9#1|) (= |~#pp~0.offset| 0) (= |#NULL.offset| 0) (<= |g_~pointer#1.base| 0) (<= 0 |~#pstate~0.offset|) (<= |~#pstate~0.offset| 0) (= 4 |~#pp~0.base|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-03 02:34:08,716 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:34:08,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:34:08,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 8, 8] total 28 [2022-11-03 02:34:08,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771217389] [2022-11-03 02:34:08,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:34:08,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-03 02:34:08,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:34:08,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-03 02:34:08,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=2036, Unknown=0, NotChecked=0, Total=2162 [2022-11-03 02:34:08,719 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 28 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 22 states have internal predecessors, (52), 6 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-03 02:34:10,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:34:10,476 INFO L93 Difference]: Finished difference Result 176 states and 218 transitions. [2022-11-03 02:34:10,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-03 02:34:10,476 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 22 states have internal predecessors, (52), 6 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) Word has length 36 [2022-11-03 02:34:10,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:34:10,478 INFO L225 Difference]: With dead ends: 176 [2022-11-03 02:34:10,478 INFO L226 Difference]: Without dead ends: 153 [2022-11-03 02:34:10,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=322, Invalid=4370, Unknown=0, NotChecked=0, Total=4692 [2022-11-03 02:34:10,481 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 157 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 02:34:10,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 24 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-03 02:34:10,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-11-03 02:34:10,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 120. [2022-11-03 02:34:10,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 96 states have (on average 1.28125) internal successors, (123), 96 states have internal predecessors, (123), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 11 states have call predecessors, (11), 7 states have call successors, (11) [2022-11-03 02:34:10,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2022-11-03 02:34:10,518 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 36 [2022-11-03 02:34:10,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:34:10,518 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2022-11-03 02:34:10,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 22 states have internal predecessors, (52), 6 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-03 02:34:10,519 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-11-03 02:34:10,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-03 02:34:10,519 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:34:10,520 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:34:10,553 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-03 02:34:10,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-03 02:34:10,729 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:34:10,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:34:10,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1587090793, now seen corresponding path program 1 times [2022-11-03 02:34:10,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:34:10,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379457218] [2022-11-03 02:34:10,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:34:10,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:34:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:34:10,815 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-03 02:34:10,816 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:34:10,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379457218] [2022-11-03 02:34:10,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379457218] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:34:10,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517177851] [2022-11-03 02:34:10,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:34:10,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:34:10,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:34:10,819 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:34:10,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-03 02:34:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:34:11,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 02:34:11,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:34:11,050 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-03 02:34:11,050 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:34:11,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517177851] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:34:11,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:34:11,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-11-03 02:34:11,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842579924] [2022-11-03 02:34:11,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:34:11,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:34:11,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:34:11,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:34:11,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:34:11,053 INFO L87 Difference]: Start difference. First operand 120 states and 146 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-03 02:34:11,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:34:11,142 INFO L93 Difference]: Finished difference Result 198 states and 245 transitions. [2022-11-03 02:34:11,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:34:11,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2022-11-03 02:34:11,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:34:11,146 INFO L225 Difference]: With dead ends: 198 [2022-11-03 02:34:11,146 INFO L226 Difference]: Without dead ends: 109 [2022-11-03 02:34:11,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:34:11,148 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 13 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:34:11,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 53 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:34:11,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-03 02:34:11,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 104. [2022-11-03 02:34:11,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 82 states have (on average 1.1585365853658536) internal successors, (95), 82 states have internal predecessors, (95), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2022-11-03 02:34:11,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2022-11-03 02:34:11,180 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 41 [2022-11-03 02:34:11,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:34:11,180 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2022-11-03 02:34:11,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-03 02:34:11,181 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2022-11-03 02:34:11,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:34:11,182 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:34:11,182 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:34:11,226 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-03 02:34:11,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-03 02:34:11,400 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:34:11,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:34:11,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1300079823, now seen corresponding path program 1 times [2022-11-03 02:34:11,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:34:11,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356224763] [2022-11-03 02:34:11,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:34:11,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:34:11,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:34:12,708 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 02:34:12,709 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:34:12,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356224763] [2022-11-03 02:34:12,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356224763] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:34:12,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445190023] [2022-11-03 02:34:12,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:34:12,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:34:12,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:34:12,712 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:34:12,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-03 02:34:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:34:12,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-03 02:34:12,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:34:13,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:13,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-03 02:34:13,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:34:13,796 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-03 02:34:13,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:34:13,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 25 [2022-11-03 02:34:13,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-03 02:34:14,087 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_~#pstate~0.base| |c_~#pp~0.base|) (forall ((v_ArrVal_1485 (Array Int Int))) (= |c_g_#in~pointer#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_~#pstate~0.base| v_ArrVal_1485) |c_~#pp~0.base|) |c_~#pp~0.offset|)))) is different from false [2022-11-03 02:34:14,157 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:34:14,164 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:34:14,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 20 treesize of output 18 [2022-11-03 02:34:14,556 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-03 02:34:14,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445190023] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:34:14,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1571695062] [2022-11-03 02:34:14,558 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-11-03 02:34:14,558 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:34:14,559 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:34:14,559 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:34:14,559 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:34:14,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:14,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 58 treesize of output 50 [2022-11-03 02:34:14,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:14,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 23 [2022-11-03 02:34:14,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:14,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 23 [2022-11-03 02:34:14,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:14,718 INFO L356 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-03 02:34:14,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 343 treesize of output 300 [2022-11-03 02:34:14,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:14,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:14,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:14,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 317 treesize of output 286 [2022-11-03 02:34:14,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:14,794 INFO L356 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-03 02:34:14,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 343 treesize of output 300 [2022-11-03 02:34:14,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:14,833 INFO L356 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-03 02:34:14,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 308 treesize of output 298 [2022-11-03 02:34:14,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 12 [2022-11-03 02:34:14,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2022-11-03 02:34:14,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 12 [2022-11-03 02:34:14,989 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:34:14,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 19 [2022-11-03 02:34:15,018 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:34:15,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 19 [2022-11-03 02:34:15,046 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-11-03 02:34:15,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 31 [2022-11-03 02:34:15,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-11-03 02:34:15,176 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:34:15,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:34:15,260 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:34:15,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-03 02:34:15,352 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:34:15,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2022-11-03 02:34:15,375 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:34:15,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2022-11-03 02:34:15,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-03 02:34:15,409 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:34:15,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2022-11-03 02:34:15,433 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:34:15,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2022-11-03 02:34:15,461 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:34:15,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2022-11-03 02:34:15,493 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:34:15,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2022-11-03 02:34:15,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-03 02:34:15,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:34:15,544 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:34:15,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:34:15,618 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:34:15,736 INFO L197 IcfgInterpreter]: Interpreting procedure fake_malloc with input of size 49 for LOIs [2022-11-03 02:34:15,752 INFO L197 IcfgInterpreter]: Interpreting procedure g with input of size 20 for LOIs [2022-11-03 02:34:15,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-03 02:34:15,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2022-11-03 02:34:15,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2022-11-03 02:34:15,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2022-11-03 02:34:15,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2022-11-03 02:34:15,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-03 02:34:15,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-03 02:34:15,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2022-11-03 02:34:15,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2022-11-03 02:34:15,996 INFO L197 IcfgInterpreter]: Interpreting procedure f with input of size 20 for LOIs [2022-11-03 02:34:16,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:16,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-11-03 02:34:16,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:16,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 11 [2022-11-03 02:34:16,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:16,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 11 [2022-11-03 02:34:16,080 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:34:20,625 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6589#(and (not (= |g_#t~mem9#1| 1)) (or (and (= |g_~pointer#1.base| (select (select |#memory_$Pointer$.base| |~#pp~0.base|) (+ |~#pp~0.offset| (* |g_~i~2#1| 4)))) (= |g_~pointer#1.offset| (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) (+ |~#pp~0.offset| (* |g_~i~2#1| 4)))) (= (select (select |#memory_int| |~#pstate~0.base|) (+ |~#pstate~0.offset| (* |g_~i~2#1| 4))) |g_#t~mem9#1|) (= |g_~i~2#1| 1)) (and (= |g_~pointer#1.base| (select (select |#memory_$Pointer$.base| |~#pp~0.base|) (+ |~#pp~0.offset| (* |g_~i~2#1| 4)))) (= |g_~pointer#1.offset| (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) (+ |~#pp~0.offset| (* |g_~i~2#1| 4)))) (= |g_~pointer#1.offset| |g_#in~pointer#1.offset|) (= (select (select |#memory_int| |~#pstate~0.base|) (+ |~#pstate~0.offset| (* |g_~i~2#1| 4))) |g_#t~mem9#1|))) (or (and (<= 0 |#NULL.base|) (<= |g_#in~pointer#1.base| 0) (<= 0 |~#pp~0.offset|) (<= 0 |g_~pointer#1.base|) (<= |#NULL.offset| 0) (<= |~#pp~0.offset| 0) (<= 0 |g_~i~2#1|) (<= 0 |g_#in~pointer#1.base|) (<= |~#pp~0.base| 4) (<= 5 |~#pstate~0.base|) (<= |#NULL.base| 0) (<= |~#pstate~0.base| 5) (<= |g_~pointer#1.base| 0) (<= 0 |~#pstate~0.offset|) (<= |~#pstate~0.offset| 0) (<= 0 |#NULL.offset|) (<= 4 |~#pp~0.base|) (<= |g_~i~2#1| 0) (<= 0 |#StackHeapBarrier|)) (and (<= 0 |#NULL.base|) (<= |g_~i~2#1| 1) (<= |g_#in~pointer#1.base| 0) (<= 0 |~#pp~0.offset|) (<= 0 |g_~pointer#1.base|) (<= |#NULL.offset| 0) (<= |~#pp~0.offset| 0) (<= 0 |g_#in~pointer#1.base|) (<= |~#pp~0.base| 4) (<= 5 |~#pstate~0.base|) (<= |#NULL.base| 0) (<= 1 |g_~i~2#1|) (<= |~#pstate~0.base| 5) (<= |g_~pointer#1.base| 0) (<= 0 |~#pstate~0.offset|) (<= |~#pstate~0.offset| 0) (<= 0 |#NULL.offset|) (<= 4 |~#pp~0.base|) (<= 0 |#StackHeapBarrier|))))' at error location [2022-11-03 02:34:20,625 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:34:20,627 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:34:20,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 17, 18] total 57 [2022-11-03 02:34:20,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215235838] [2022-11-03 02:34:20,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:34:20,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-11-03 02:34:20,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:34:20,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-11-03 02:34:20,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=5666, Unknown=2, NotChecked=152, Total=6162 [2022-11-03 02:34:20,629 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand has 57 states, 45 states have (on average 1.8222222222222222) internal successors, (82), 41 states have internal predecessors, (82), 12 states have call successors, (18), 10 states have call predecessors, (18), 13 states have return successors, (15), 11 states have call predecessors, (15), 10 states have call successors, (15) [2022-11-03 02:34:23,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:34:23,030 INFO L93 Difference]: Finished difference Result 137 states and 144 transitions. [2022-11-03 02:34:23,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-03 02:34:23,031 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 45 states have (on average 1.8222222222222222) internal successors, (82), 41 states have internal predecessors, (82), 12 states have call successors, (18), 10 states have call predecessors, (18), 13 states have return successors, (15), 11 states have call predecessors, (15), 10 states have call successors, (15) Word has length 45 [2022-11-03 02:34:23,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:34:23,032 INFO L225 Difference]: With dead ends: 137 [2022-11-03 02:34:23,032 INFO L226 Difference]: Without dead ends: 105 [2022-11-03 02:34:23,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 100 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2624 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=741, Invalid=9361, Unknown=2, NotChecked=198, Total=10302 [2022-11-03 02:34:23,034 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 151 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1731 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 1971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:34:23,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 23 Invalid, 1971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1731 Invalid, 0 Unknown, 120 Unchecked, 1.1s Time] [2022-11-03 02:34:23,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-03 02:34:23,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 87. [2022-11-03 02:34:23,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 67 states have internal predecessors, (73), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2022-11-03 02:34:23,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2022-11-03 02:34:23,057 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 45 [2022-11-03 02:34:23,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:34:23,058 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2022-11-03 02:34:23,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 45 states have (on average 1.8222222222222222) internal successors, (82), 41 states have internal predecessors, (82), 12 states have call successors, (18), 10 states have call predecessors, (18), 13 states have return successors, (15), 11 states have call predecessors, (15), 10 states have call successors, (15) [2022-11-03 02:34:23,058 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2022-11-03 02:34:23,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-03 02:34:23,058 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:34:23,058 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:34:23,089 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-03 02:34:23,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-03 02:34:23,259 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:34:23,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:34:23,260 INFO L85 PathProgramCache]: Analyzing trace with hash -2053128555, now seen corresponding path program 1 times [2022-11-03 02:34:23,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:34:23,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039888775] [2022-11-03 02:34:23,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:34:23,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:34:23,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:34:24,527 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 02:34:24,527 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:34:24,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039888775] [2022-11-03 02:34:24,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039888775] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:34:24,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816818554] [2022-11-03 02:34:24,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:34:24,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:34:24,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:34:24,530 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:34:24,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-03 02:34:24,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:34:24,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 76 conjunts are in the unsatisfiable core [2022-11-03 02:34:24,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:34:24,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 19 treesize of output 19 [2022-11-03 02:34:24,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:24,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 21 [2022-11-03 02:34:24,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:24,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-03 02:34:24,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:24,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-03 02:34:25,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:34:25,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:25,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-03 02:34:25,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:25,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 23 [2022-11-03 02:34:25,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:25,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 7 [2022-11-03 02:34:25,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:25,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 7 [2022-11-03 02:34:25,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 10 [2022-11-03 02:34:25,943 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 02:34:25,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:34:26,261 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1600 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) |c_~#pstate~0.base| v_ArrVal_1600) |c_~#pp~0.base|) |c_~#pp~0.offset|) |c_ULTIMATE.start_main_~b~0#1.offset|))) is different from false [2022-11-03 02:34:26,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816818554] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:34:26,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1688913671] [2022-11-03 02:34:26,264 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-11-03 02:34:26,265 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:34:26,265 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:34:26,265 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:34:26,265 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:34:26,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:26,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 23 [2022-11-03 02:34:26,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:26,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 23 [2022-11-03 02:34:26,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:26,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 58 treesize of output 50 [2022-11-03 02:34:26,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:26,424 INFO L356 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-03 02:34:26,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 343 treesize of output 300 [2022-11-03 02:34:26,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:26,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:26,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:26,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 317 treesize of output 286 [2022-11-03 02:34:26,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:26,499 INFO L356 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-03 02:34:26,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 308 treesize of output 298 [2022-11-03 02:34:26,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:26,539 INFO L356 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-03 02:34:26,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 343 treesize of output 300 [2022-11-03 02:34:26,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2022-11-03 02:34:26,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 12 [2022-11-03 02:34:26,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 12 [2022-11-03 02:34:26,677 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:34:26,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 19 [2022-11-03 02:34:26,701 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-11-03 02:34:26,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 31 [2022-11-03 02:34:26,732 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:34:26,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 19 [2022-11-03 02:34:26,857 INFO L197 IcfgInterpreter]: Interpreting procedure fake_malloc with input of size 49 for LOIs [2022-11-03 02:34:26,871 INFO L197 IcfgInterpreter]: Interpreting procedure g with input of size 55 for LOIs [2022-11-03 02:34:26,982 INFO L197 IcfgInterpreter]: Interpreting procedure f with input of size 55 for LOIs [2022-11-03 02:34:27,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:27,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 11 [2022-11-03 02:34:27,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:27,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 11 [2022-11-03 02:34:27,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:27,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-11-03 02:34:27,109 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:34:30,312 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7236#(and (= 5 |~#pstate~0.base|) (not (= |g_#t~mem9#1| 1)) (= |g_#in~pointer#1.base| 0) (<= 0 |g_~pointer#1.base|) (<= |g_~i~2#1| 2) (<= 0 |g_~i~2#1|) (= (select (select |#memory_int| |~#pstate~0.base|) (+ |~#pstate~0.offset| (* |g_~i~2#1| 4))) |g_#t~mem9#1|) (= |~#pp~0.offset| 0) (= |#NULL.offset| 0) (<= |g_~pointer#1.base| 0) (<= 0 |~#pstate~0.offset|) (<= |~#pstate~0.offset| 0) (= 4 |~#pp~0.base|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-03 02:34:30,312 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:34:30,312 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:34:30,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2022-11-03 02:34:30,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575844847] [2022-11-03 02:34:30,313 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:34:30,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-03 02:34:30,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:34:30,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-03 02:34:30,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=3442, Unknown=16, NotChecked=118, Total=3782 [2022-11-03 02:34:30,314 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand has 39 states, 32 states have (on average 1.875) internal successors, (60), 30 states have internal predecessors, (60), 7 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2022-11-03 02:34:32,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:34:32,464 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2022-11-03 02:34:32,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-03 02:34:32,465 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 32 states have (on average 1.875) internal successors, (60), 30 states have internal predecessors, (60), 7 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) Word has length 46 [2022-11-03 02:34:32,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:34:32,465 INFO L225 Difference]: With dead ends: 98 [2022-11-03 02:34:32,465 INFO L226 Difference]: Without dead ends: 88 [2022-11-03 02:34:32,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 73 SyntacticMatches, 10 SemanticMatches, 81 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1606 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=409, Invalid=6212, Unknown=25, NotChecked=160, Total=6806 [2022-11-03 02:34:32,467 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 51 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:34:32,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 403 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 947 Invalid, 0 Unknown, 91 Unchecked, 0.7s Time] [2022-11-03 02:34:32,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-03 02:34:32,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 82. [2022-11-03 02:34:32,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 64 states have (on average 1.078125) internal successors, (69), 64 states have internal predecessors, (69), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-03 02:34:32,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2022-11-03 02:34:32,485 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 46 [2022-11-03 02:34:32,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:34:32,486 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2022-11-03 02:34:32,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 32 states have (on average 1.875) internal successors, (60), 30 states have internal predecessors, (60), 7 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2022-11-03 02:34:32,486 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2022-11-03 02:34:32,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-03 02:34:32,487 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:34:32,487 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:34:32,510 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-03 02:34:32,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-03 02:34:32,690 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:34:32,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:34:32,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1600438534, now seen corresponding path program 1 times [2022-11-03 02:34:32,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:34:32,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351222707] [2022-11-03 02:34:32,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:34:32,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:34:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:34:33,682 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 02:34:33,682 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:34:33,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351222707] [2022-11-03 02:34:33,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351222707] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:34:33,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737882689] [2022-11-03 02:34:33,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:34:33,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:34:33,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:34:33,684 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:34:33,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-03 02:34:33,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:34:33,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 79 conjunts are in the unsatisfiable core [2022-11-03 02:34:33,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:34:33,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-03 02:34:33,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:33,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-03 02:34:33,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:33,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-03 02:34:33,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:33,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-03 02:34:34,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:34:34,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:34,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-03 02:34:34,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:34,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 25 [2022-11-03 02:34:34,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:34,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 7 [2022-11-03 02:34:34,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:34,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 7 [2022-11-03 02:34:34,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:34,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 25 [2022-11-03 02:34:35,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 12 [2022-11-03 02:34:35,158 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 27 refuted. 2 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:34:35,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:34:35,297 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1722 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_~#pstate~0.base| v_ArrVal_1722) |c_~#pp~0.base|) |c_~#pp~0.offset|) |c_ULTIMATE.start_main_~b~0#1.offset|))) is different from false [2022-11-03 02:34:35,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737882689] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:34:35,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2104464920] [2022-11-03 02:34:35,300 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-11-03 02:34:35,301 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:34:35,301 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:34:35,301 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:34:35,301 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:34:35,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:35,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:35,331 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:34:35,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 28 [2022-11-03 02:34:35,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:35,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:35,346 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:34:35,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 73 treesize of output 60 [2022-11-03 02:34:35,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:35,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:35,359 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:34:35,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 28 [2022-11-03 02:34:35,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:35,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:35,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:35,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:35,452 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 02:34:35,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 332 treesize of output 308 [2022-11-03 02:34:35,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:35,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:35,503 INFO L356 Elim1Store]: treesize reduction 52, result has 24.6 percent of original size [2022-11-03 02:34:35,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 358 treesize of output 322 [2022-11-03 02:34:35,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:35,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:35,546 INFO L356 Elim1Store]: treesize reduction 49, result has 29.0 percent of original size [2022-11-03 02:34:35,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 358 treesize of output 325 [2022-11-03 02:34:35,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:35,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:35,589 INFO L356 Elim1Store]: treesize reduction 49, result has 29.0 percent of original size [2022-11-03 02:34:35,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 319 treesize of output 319 [2022-11-03 02:34:35,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 12 [2022-11-03 02:34:35,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 12 [2022-11-03 02:34:35,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2022-11-03 02:34:35,806 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:34:35,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 19 [2022-11-03 02:34:35,831 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-11-03 02:34:35,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 31 [2022-11-03 02:34:35,853 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:34:35,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 19 [2022-11-03 02:34:35,940 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:34:35,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2022-11-03 02:34:35,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-03 02:34:35,965 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:34:35,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2022-11-03 02:34:35,994 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:34:35,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2022-11-03 02:34:36,013 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:34:36,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2022-11-03 02:34:36,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-03 02:34:36,044 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:34:36,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2022-11-03 02:34:36,063 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:34:36,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2022-11-03 02:34:36,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-03 02:34:36,125 INFO L197 IcfgInterpreter]: Interpreting procedure fake_malloc with input of size 49 for LOIs [2022-11-03 02:34:36,135 INFO L197 IcfgInterpreter]: Interpreting procedure g with input of size 55 for LOIs [2022-11-03 02:34:36,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2022-11-03 02:34:36,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2022-11-03 02:34:36,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-03 02:34:36,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2022-11-03 02:34:36,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2022-11-03 02:34:36,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-03 02:34:36,389 INFO L197 IcfgInterpreter]: Interpreting procedure f with input of size 55 for LOIs [2022-11-03 02:34:36,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 11 [2022-11-03 02:34:36,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 11 [2022-11-03 02:34:36,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-11-03 02:34:36,492 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:34:39,701 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7762#(and (= 5 |~#pstate~0.base|) (not (= |g_#t~mem9#1| 1)) (= |g_#in~pointer#1.base| 0) (<= |g_~i~2#1| 1) (<= 0 |g_~pointer#1.base|) (<= 0 |g_~i~2#1|) (= |~#pp~0.offset| 0) (= |#NULL.offset| 0) (<= |g_~pointer#1.base| 0) (<= 0 |~#pstate~0.offset|) (<= |~#pstate~0.offset| 0) (= 4 |~#pp~0.base|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-03 02:34:39,701 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:34:39,701 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:34:39,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 40 [2022-11-03 02:34:39,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407966600] [2022-11-03 02:34:39,701 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:34:39,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-03 02:34:39,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:34:39,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-03 02:34:39,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=3653, Unknown=36, NotChecked=122, Total=4032 [2022-11-03 02:34:39,709 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 40 states, 33 states have (on average 2.090909090909091) internal successors, (69), 32 states have internal predecessors, (69), 7 states have call successors, (12), 6 states have call predecessors, (12), 10 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2022-11-03 02:34:41,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:34:41,749 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2022-11-03 02:34:41,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-03 02:34:41,750 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 33 states have (on average 2.090909090909091) internal successors, (69), 32 states have internal predecessors, (69), 7 states have call successors, (12), 6 states have call predecessors, (12), 10 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) Word has length 48 [2022-11-03 02:34:41,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:34:41,751 INFO L225 Difference]: With dead ends: 96 [2022-11-03 02:34:41,751 INFO L226 Difference]: Without dead ends: 88 [2022-11-03 02:34:41,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 58 SyntacticMatches, 9 SemanticMatches, 82 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2064 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=409, Invalid=6337, Unknown=64, NotChecked=162, Total=6972 [2022-11-03 02:34:41,753 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 91 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 189 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 02:34:41,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 248 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1052 Invalid, 0 Unknown, 189 Unchecked, 0.8s Time] [2022-11-03 02:34:41,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-03 02:34:41,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 76. [2022-11-03 02:34:41,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 60 states have internal predecessors, (62), 8 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-03 02:34:41,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2022-11-03 02:34:41,776 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 48 [2022-11-03 02:34:41,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:34:41,776 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2022-11-03 02:34:41,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 33 states have (on average 2.090909090909091) internal successors, (69), 32 states have internal predecessors, (69), 7 states have call successors, (12), 6 states have call predecessors, (12), 10 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2022-11-03 02:34:41,777 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-11-03 02:34:41,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-03 02:34:41,778 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:34:41,778 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:34:41,807 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-03 02:34:41,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-03 02:34:41,981 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:34:41,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:34:41,982 INFO L85 PathProgramCache]: Analyzing trace with hash -650947566, now seen corresponding path program 2 times [2022-11-03 02:34:41,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:34:41,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499540100] [2022-11-03 02:34:41,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:34:41,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:34:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:34:44,111 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 02:34:44,111 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:34:44,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499540100] [2022-11-03 02:34:44,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499540100] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:34:44,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252463412] [2022-11-03 02:34:44,111 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:34:44,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:34:44,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:34:44,113 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:34:44,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-03 02:34:45,432 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-03 02:34:45,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:34:45,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-03 02:34:45,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:34:46,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 16 treesize of output 16 [2022-11-03 02:34:46,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:46,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-03 02:34:46,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-11-03 02:34:46,707 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 02:34:46,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:34:46,776 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_g_~i~2#1_89| Int) (v_ArrVal_1881 (Array Int Int))) (or (not (< |v_g_~i~2#1_89| 2)) (< |v_g_~i~2#1_89| 1) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_~#pstate~0.base| v_ArrVal_1881) |c_~#pp~0.base|) (+ |c_~#pp~0.offset| (* |v_g_~i~2#1_89| 4))) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-11-03 02:34:46,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252463412] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:34:46,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [532718245] [2022-11-03 02:34:46,779 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-11-03 02:34:46,779 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:34:46,780 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:34:46,780 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:34:46,780 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:34:46,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:46,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:46,802 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:34:46,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 28 [2022-11-03 02:34:46,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:46,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:46,818 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:34:46,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 73 treesize of output 60 [2022-11-03 02:34:46,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:46,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:46,831 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:34:46,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 28 [2022-11-03 02:34:46,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:46,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:46,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:46,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:46,926 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 02:34:46,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 332 treesize of output 308 [2022-11-03 02:34:46,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:46,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:46,979 INFO L356 Elim1Store]: treesize reduction 52, result has 24.6 percent of original size [2022-11-03 02:34:46,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 358 treesize of output 322 [2022-11-03 02:34:47,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:47,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:47,055 INFO L356 Elim1Store]: treesize reduction 49, result has 29.0 percent of original size [2022-11-03 02:34:47,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 358 treesize of output 325 [2022-11-03 02:34:47,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:47,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:47,097 INFO L356 Elim1Store]: treesize reduction 52, result has 24.6 percent of original size [2022-11-03 02:34:47,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 319 treesize of output 316 [2022-11-03 02:34:47,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 12 [2022-11-03 02:34:47,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 12 [2022-11-03 02:34:47,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2022-11-03 02:34:47,285 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-11-03 02:34:47,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 31 [2022-11-03 02:34:47,307 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:34:47,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 19 [2022-11-03 02:34:47,337 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:34:47,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 19 [2022-11-03 02:34:47,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 3 [2022-11-03 02:34:47,486 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:34:47,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 3 [2022-11-03 02:34:47,578 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:34:47,669 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:34:47,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2022-11-03 02:34:47,690 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:34:47,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2022-11-03 02:34:47,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-03 02:34:47,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-03 02:34:47,742 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:34:47,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2022-11-03 02:34:47,767 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:34:47,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2022-11-03 02:34:47,792 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:34:47,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2022-11-03 02:34:47,814 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:34:47,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2022-11-03 02:34:47,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-03 02:34:47,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 3 [2022-11-03 02:34:47,863 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:34:47,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 3 [2022-11-03 02:34:47,942 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:34:48,073 INFO L197 IcfgInterpreter]: Interpreting procedure fake_malloc with input of size 49 for LOIs [2022-11-03 02:34:48,085 INFO L197 IcfgInterpreter]: Interpreting procedure g with input of size 20 for LOIs [2022-11-03 02:34:48,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-03 02:34:48,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2022-11-03 02:34:48,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2022-11-03 02:34:48,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2022-11-03 02:34:48,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2022-11-03 02:34:48,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-03 02:34:48,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-03 02:34:48,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2022-11-03 02:34:48,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2022-11-03 02:34:48,288 INFO L197 IcfgInterpreter]: Interpreting procedure f with input of size 20 for LOIs [2022-11-03 02:34:48,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:48,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 11 [2022-11-03 02:34:48,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:48,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 11 [2022-11-03 02:34:48,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:48,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-11-03 02:34:48,375 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:34:53,080 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8295#(and (= 5 |~#pstate~0.base|) (not (= |g_#t~mem9#1| 1)) (= |g_#in~pointer#1.base| 0) (<= |g_~i~2#1| 1) (<= 0 |g_~pointer#1.base|) (<= 0 |g_~i~2#1|) (= |~#pp~0.offset| 0) (= |#NULL.offset| 0) (<= |g_~pointer#1.base| 0) (<= 0 |~#pstate~0.offset|) (<= |~#pstate~0.offset| 0) (= 4 |~#pp~0.base|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-03 02:34:53,081 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:34:53,081 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:34:53,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 21] total 49 [2022-11-03 02:34:53,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101376932] [2022-11-03 02:34:53,081 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:34:53,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-03 02:34:53,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:34:53,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-03 02:34:53,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=4727, Unknown=3, NotChecked=138, Total=5112 [2022-11-03 02:34:53,083 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand has 49 states, 40 states have (on average 1.85) internal successors, (74), 38 states have internal predecessors, (74), 10 states have call successors, (12), 8 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-03 02:34:56,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:34:56,857 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2022-11-03 02:34:56,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-03 02:34:56,858 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 40 states have (on average 1.85) internal successors, (74), 38 states have internal predecessors, (74), 10 states have call successors, (12), 8 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) Word has length 50 [2022-11-03 02:34:56,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:34:56,859 INFO L225 Difference]: With dead ends: 91 [2022-11-03 02:34:56,859 INFO L226 Difference]: Without dead ends: 57 [2022-11-03 02:34:56,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2041 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=511, Invalid=9778, Unknown=17, NotChecked=200, Total=10506 [2022-11-03 02:34:56,861 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 84 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1347 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 1637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 223 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:34:56,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 50 Invalid, 1637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1347 Invalid, 0 Unknown, 223 Unchecked, 1.1s Time] [2022-11-03 02:34:56,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-03 02:34:56,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2022-11-03 02:34:56,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 40 states have (on average 1.05) internal successors, (42), 40 states have internal predecessors, (42), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-03 02:34:56,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2022-11-03 02:34:56,879 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 50 [2022-11-03 02:34:56,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:34:56,879 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2022-11-03 02:34:56,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 40 states have (on average 1.85) internal successors, (74), 38 states have internal predecessors, (74), 10 states have call successors, (12), 8 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-03 02:34:56,880 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2022-11-03 02:34:56,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-03 02:34:56,880 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:34:56,881 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:34:56,912 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-03 02:34:57,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-03 02:34:57,097 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:34:57,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:34:57,097 INFO L85 PathProgramCache]: Analyzing trace with hash 178286382, now seen corresponding path program 2 times [2022-11-03 02:34:57,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:34:57,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044981811] [2022-11-03 02:34:57,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:34:57,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:34:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:34:58,556 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 14 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:34:58,556 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:34:58,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044981811] [2022-11-03 02:34:58,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044981811] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:34:58,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392063789] [2022-11-03 02:34:58,556 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:34:58,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:34:58,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:34:58,557 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:34:58,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-03 02:34:58,807 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 02:34:58,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:34:58,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-03 02:34:58,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:34:59,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 16 treesize of output 16 [2022-11-03 02:34:59,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:59,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-03 02:34:59,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-11-03 02:34:59,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-11-03 02:34:59,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:59,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2022-11-03 02:34:59,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 12 [2022-11-03 02:34:59,863 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 02:34:59,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:35:00,082 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1996 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_~#pstate~0.base| v_ArrVal_1996) |c_~#pp~0.base|) (+ |c_~#pp~0.offset| 4)) |c_ULTIMATE.start_main_~b~0#1.offset|))) is different from false [2022-11-03 02:35:00,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392063789] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:35:00,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [840149650] [2022-11-03 02:35:00,086 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-11-03 02:35:00,086 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:35:00,087 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:35:00,087 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:35:00,087 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:35:00,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:35:00,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:35:00,110 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:35:00,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 28 [2022-11-03 02:35:00,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:35:00,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:35:00,142 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:35:00,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 73 treesize of output 60 [2022-11-03 02:35:00,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:35:00,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:35:00,160 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:35:00,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 28 [2022-11-03 02:35:00,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:35:00,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:35:00,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:35:00,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:35:00,251 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 02:35:00,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 332 treesize of output 308 [2022-11-03 02:35:00,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:35:00,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:35:00,332 INFO L356 Elim1Store]: treesize reduction 52, result has 24.6 percent of original size [2022-11-03 02:35:00,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 358 treesize of output 322 [2022-11-03 02:35:00,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:35:00,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:35:00,392 INFO L356 Elim1Store]: treesize reduction 52, result has 24.6 percent of original size [2022-11-03 02:35:00,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 358 treesize of output 322 [2022-11-03 02:35:00,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:35:00,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:35:00,442 INFO L356 Elim1Store]: treesize reduction 52, result has 24.6 percent of original size [2022-11-03 02:35:00,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 323 treesize of output 320 [2022-11-03 02:35:00,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 12 [2022-11-03 02:35:00,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2022-11-03 02:35:00,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 12 [2022-11-03 02:35:00,622 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-11-03 02:35:00,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 31 [2022-11-03 02:35:00,646 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:35:00,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 19 [2022-11-03 02:35:00,677 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:35:00,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 19 [2022-11-03 02:35:00,777 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:35:00,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2022-11-03 02:35:00,802 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:35:00,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2022-11-03 02:35:00,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-03 02:35:00,840 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:35:00,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2022-11-03 02:35:00,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-03 02:35:00,869 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:35:00,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2022-11-03 02:35:00,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-03 02:35:00,902 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:35:00,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2022-11-03 02:35:00,926 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-11-03 02:35:00,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2022-11-03 02:35:00,984 INFO L197 IcfgInterpreter]: Interpreting procedure fake_malloc with input of size 49 for LOIs [2022-11-03 02:35:01,011 INFO L197 IcfgInterpreter]: Interpreting procedure g with input of size 55 for LOIs [2022-11-03 02:35:01,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2022-11-03 02:35:01,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-03 02:35:01,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2022-11-03 02:35:01,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2022-11-03 02:35:01,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-03 02:35:01,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2022-11-03 02:35:01,254 INFO L197 IcfgInterpreter]: Interpreting procedure f with input of size 55 for LOIs [2022-11-03 02:35:01,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 11 [2022-11-03 02:35:01,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-11-03 02:35:01,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 11 [2022-11-03 02:35:01,366 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:35:05,275 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8814#(and (= 5 |~#pstate~0.base|) (not (= |g_#t~mem9#1| 1)) (= |g_#in~pointer#1.base| 0) (<= |g_~i~2#1| 1) (<= 0 |g_~pointer#1.base|) (<= 0 |g_~i~2#1|) (= |~#pp~0.offset| 0) (= |#NULL.offset| 0) (<= |g_~pointer#1.base| 0) (<= 0 |~#pstate~0.offset|) (<= |~#pstate~0.offset| 0) (= 4 |~#pp~0.base|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-03 02:35:05,275 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:35:05,275 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:35:05,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 37 [2022-11-03 02:35:05,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393068974] [2022-11-03 02:35:05,275 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:35:05,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-03 02:35:05,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:35:05,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-03 02:35:05,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=3417, Unknown=34, NotChecked=118, Total=3782 [2022-11-03 02:35:05,277 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand has 37 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 28 states have internal predecessors, (72), 8 states have call successors, (12), 8 states have call predecessors, (12), 10 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-11-03 02:35:06,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:35:06,551 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2022-11-03 02:35:06,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 02:35:06,557 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 28 states have internal predecessors, (72), 8 states have call successors, (12), 8 states have call predecessors, (12), 10 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) Word has length 51 [2022-11-03 02:35:06,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:35:06,558 INFO L225 Difference]: With dead ends: 52 [2022-11-03 02:35:06,559 INFO L226 Difference]: Without dead ends: 0 [2022-11-03 02:35:06,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 70 SyntacticMatches, 7 SemanticMatches, 72 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1190 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=323, Invalid=4891, Unknown=46, NotChecked=142, Total=5402 [2022-11-03 02:35:06,561 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 14 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:35:06,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 8 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 389 Invalid, 0 Unknown, 16 Unchecked, 0.4s Time] [2022-11-03 02:35:06,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-03 02:35:06,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-03 02:35:06,562 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-03 02:35:06,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-03 02:35:06,563 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2022-11-03 02:35:06,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:35:06,563 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-03 02:35:06,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 28 states have internal predecessors, (72), 8 states have call successors, (12), 8 states have call predecessors, (12), 10 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-11-03 02:35:06,564 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-03 02:35:06,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-03 02:35:06,567 INFO L805 garLoopResultBuilder]: Registering result SAFE for location gErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-03 02:35:06,604 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-03 02:35:06,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-03 02:35:06,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-03 02:35:11,875 INFO L899 garLoopResultBuilder]: For program point L28(lines 28 32) no Hoare annotation was computed. [2022-11-03 02:35:11,876 INFO L895 garLoopResultBuilder]: At program point L27-3(lines 27 33) the Hoare annotation is: (let ((.cse15 (= |#memory_int| |old(#memory_int)|)) (.cse16 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (.cse17 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse18 (= |f_#in~pointer.offset| f_~pointer.offset)) (.cse13 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse20 (+ |~#pp~0.offset| 4)) (.cse19 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (let ((.cse0 (not (= |#NULL.offset| 0))) (.cse1 (not (= 5 |~#pstate~0.base|))) (.cse11 (select .cse19 |~#pp~0.offset|)) (.cse2 (not (<= 0 |~#pp~0.offset|))) (.cse3 (not (= (select .cse13 .cse20) 0))) (.cse4 (and (= f_~pointer.base |f_#in~pointer.base|) .cse15 .cse16 .cse17 (= f_~i~1 0) .cse18)) (.cse5 (not (= |#NULL.base| 0))) (.cse6 (not (= (select .cse19 .cse20) 0))) (.cse7 (not (= 4 |~#pp~0.base|))) (.cse8 (not (<= 0 |#StackHeapBarrier|))) (.cse9 (not (= |f_#in~pointer.base| 0))) (.cse10 (not (<= |~#pstate~0.offset| 0))) (.cse12 (not (<= 0 |~#pstate~0.offset|))) (.cse14 (not (<= |~#pp~0.offset| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= .cse11 0)) .cse12 (not (= (select .cse13 0) 0)) .cse14) (or (not (= (select (select |old(#memory_int)| |~#pstate~0.base|) 0) 1)) (and (= f_~i~1 1) .cse15 .cse16 .cse17 .cse18) .cse0 .cse1 (not (= .cse11 1)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14)))) [2022-11-03 02:35:11,876 INFO L899 garLoopResultBuilder]: For program point L27-4(lines 25 34) no Hoare annotation was computed. [2022-11-03 02:35:11,876 INFO L899 garLoopResultBuilder]: For program point fEXIT(lines 25 34) no Hoare annotation was computed. [2022-11-03 02:35:11,876 INFO L895 garLoopResultBuilder]: At program point fENTRY(lines 25 34) the Hoare annotation is: (let ((.cse13 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse16 (+ |~#pp~0.offset| 4)) (.cse15 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (let ((.cse0 (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (.cse1 (not (= |#NULL.offset| 0))) (.cse2 (not (= 5 |~#pstate~0.base|))) (.cse11 (select .cse15 |~#pp~0.offset|)) (.cse3 (not (<= 0 |~#pp~0.offset|))) (.cse4 (not (= (select .cse13 .cse16) 0))) (.cse5 (not (= |#NULL.base| 0))) (.cse6 (not (= (select .cse15 .cse16) 0))) (.cse7 (not (= 4 |~#pp~0.base|))) (.cse8 (not (<= 0 |#StackHeapBarrier|))) (.cse9 (not (= |f_#in~pointer.base| 0))) (.cse10 (not (<= |~#pstate~0.offset| 0))) (.cse12 (not (<= 0 |~#pstate~0.offset|))) (.cse14 (not (<= |~#pp~0.offset| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= .cse11 0)) .cse12 (not (= (select .cse13 0) 0)) .cse14) (or .cse0 (not (= (select (select |old(#memory_int)| |~#pstate~0.base|) 0) 1)) .cse1 .cse2 (not (= .cse11 1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14)))) [2022-11-03 02:35:11,876 INFO L899 garLoopResultBuilder]: For program point L38-2(lines 38 44) no Hoare annotation was computed. [2022-11-03 02:35:11,877 INFO L895 garLoopResultBuilder]: At program point L38-3(lines 38 44) the Hoare annotation is: (let ((.cse28 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse30 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (let ((.cse37 (@diff .cse28 .cse30)) (.cse23 (= .cse28 .cse30)) (.cse34 (select |#memory_int| |~#pstate~0.base|)) (.cse33 (+ |~#pstate~0.offset| 4))) (let ((.cse32 (select |old(#memory_int)| |~#pstate~0.base|)) (.cse27 (* |g_~i~2#1| 4)) (.cse29 (<= 2 |g_~i~2#1|)) (.cse22 (= (select .cse34 .cse33) 1)) (.cse24 (= |g_~i~2#1| 1)) (.cse11 (<= |~#pp~0.base| 4)) (.cse12 (<= 5 |~#pstate~0.base|)) (.cse13 (= |~#pp~0.offset| 0)) (.cse35 (or (and (<= (+ (div (+ |~#pp~0.offset| (- .cse37)) 4) 1) 0) (= (mod (+ |~#pp~0.offset| (* .cse37 3)) 4) 0)) .cse23)) (.cse36 (= (store .cse28 .cse37 (select .cse30 .cse37)) .cse30))) (let ((.cse2 (and .cse22 .cse24 .cse11 .cse12 .cse13 .cse35 .cse36)) (.cse5 (and .cse29 .cse11 .cse12 .cse13 .cse35 .cse36)) (.cse19 (= |g_~pointer#1.offset| 2)) (.cse21 (not (= 2 |g_#in~pointer#1.offset|))) (.cse9 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (.cse10 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse18 (+ |~#pp~0.offset| .cse27)) (.cse0 (not (= |~#pstate~0.offset| 0))) (.cse1 (not .cse13)) (.cse20 (select .cse28 |~#pp~0.offset|)) (.cse3 (not .cse12)) (.cse4 (not (= (select .cse32 |~#pstate~0.offset|) 1))) (.cse7 (= |g_~i~2#1| 0)) (.cse8 (= |#memory_int| |old(#memory_int)|)) (.cse14 (<= 0 |~#pstate~0.offset|)) (.cse15 (<= |~#pstate~0.offset| 0)) (.cse16 (= (select .cse34 0) 1)) (.cse6 (not .cse11)) (.cse17 (not (= (select .cse32 .cse33) 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) .cse17) (or (and .cse8 .cse9 .cse10 (= .cse18 0) .cse19) .cse1 .cse2 (not (= .cse20 1)) .cse3 .cse21 .cse5 .cse6 .cse17) (let ((.cse26 (= |f_#in~pointer.base| 0)) (.cse25 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|))) (or .cse0 (and .cse22 .cse23 .cse24 .cse13 (or (= .cse25 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (not .cse26))) (and .cse8 .cse9 .cse10 .cse19 (not (<= (+ |~#pp~0.offset| .cse27 1) 0))) .cse3 (not (<= 0 |~#pp~0.offset|)) .cse21 (not (= (select .cse28 (+ |~#pp~0.offset| 4)) 1)) .cse6 (and .cse29 .cse23 .cse13) (not (= .cse20 0)) (and .cse26 (= (select .cse25 0) 0)) .cse17 (not (<= |~#pp~0.offset| 0)))) (let ((.cse31 (= |g_~pointer#1.offset| |g_#in~pointer#1.offset|))) (or (= (select .cse28 4) |g_#in~pointer#1.offset|) (and .cse8 .cse9 .cse10 (not (= |g_~pointer#1.offset| (select .cse30 .cse18))) .cse24) .cse0 .cse1 (and .cse31 .cse24 (exists ((v_ArrVal_1878 (Array Int Int))) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |~#pstate~0.base| v_ArrVal_1878)))) (not (= |g_#in~pointer#1.offset| .cse20)) .cse3 .cse4 (and .cse7 .cse8 .cse31 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse22 .cse29 .cse23) .cse6 .cse17))))))) [2022-11-03 02:35:11,878 INFO L899 garLoopResultBuilder]: For program point gErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2022-11-03 02:35:11,878 INFO L899 garLoopResultBuilder]: For program point L41(line 41) no Hoare annotation was computed. [2022-11-03 02:35:11,878 INFO L899 garLoopResultBuilder]: For program point gEXIT(lines 36 45) no Hoare annotation was computed. [2022-11-03 02:35:11,878 INFO L899 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2022-11-03 02:35:11,878 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 43) no Hoare annotation was computed. [2022-11-03 02:35:11,878 INFO L899 garLoopResultBuilder]: For program point L41-2(line 41) no Hoare annotation was computed. [2022-11-03 02:35:11,879 INFO L895 garLoopResultBuilder]: At program point gENTRY(lines 36 45) the Hoare annotation is: (let ((.cse4 (select |old(#memory_int)| |~#pstate~0.base|)) (.cse9 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (let ((.cse2 (not (= |~#pp~0.offset| 0))) (.cse0 (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (.cse1 (not (= |~#pstate~0.offset| 0))) (.cse3 (not (<= 5 |~#pstate~0.base|))) (.cse8 (not (= 2 |g_#in~pointer#1.offset|))) (.cse5 (not (<= |~#pp~0.base| 4))) (.cse7 (select .cse9 |~#pp~0.offset|)) (.cse6 (not (= (select .cse4 (+ |~#pstate~0.offset| 4)) 1)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= (select .cse4 |~#pstate~0.offset|) 1)) .cse5 .cse6) (or .cse0 .cse2 (not (= .cse7 1)) .cse3 .cse8 .cse5 .cse6) (or .cse0 .cse1 .cse3 (not (<= 0 |~#pp~0.offset|)) .cse8 (not (= (select .cse9 (+ |~#pp~0.offset| 4)) 1)) .cse5 (not (= .cse7 0)) (and (= |f_#in~pointer.base| 0) (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) 0) 0)) .cse6 (not (<= |~#pp~0.offset| 0)))))) [2022-11-03 02:35:11,879 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-03 02:35:11,879 INFO L895 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: (let ((.cse3 (select |#memory_int| |~#pstate~0.base|)) (.cse4 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (let ((.cse0 (= 5 |~#pstate~0.base|)) (.cse16 (select .cse4 |~#pp~0.offset|)) (.cse1 (<= 2 |ULTIMATE.start_init_~i~0#1|)) (.cse2 (= |ULTIMATE.start_main_~a~0#1.base| 0)) (.cse5 (= |~#pstate~0.offset| 0)) (.cse6 (= (select .cse3 (+ |~#pstate~0.offset| 4)) 1)) (.cse7 (not (= |ULTIMATE.start_main_~b~0#1.offset| 0))) (.cse17 (= |ULTIMATE.start_main_~b~0#1.offset| 2)) (.cse8 (= ~counter~0 (+ |ULTIMATE.start_main_~b~0#1.offset| 1))) (.cse9 (= |~#pp~0.offset| 0)) (.cse10 (= |#NULL.offset| 0)) (.cse11 (= |ULTIMATE.start_main_~a~0#1.offset| 1)) (.cse12 (= 4 |~#pp~0.base|)) (.cse13 (= |ULTIMATE.start_main_~b~0#1.base| 0)) (.cse14 (<= 0 |#StackHeapBarrier|)) (.cse15 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 (= (select .cse3 |~#pstate~0.offset|) 1) (not (= |ULTIMATE.start_main_~a~0#1.offset| (select .cse4 4))) .cse5 .cse6 .cse7 (not (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~b~0#1.offset|)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 (= .cse16 0) .cse17 .cse8 (not (= (select (select |#memory_$Pointer$.base| |~#pp~0.base|) 0) |ULTIMATE.start_main_~b~0#1.base|)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= |ULTIMATE.start_main_~a~0#1.offset| (select .cse4 (+ |~#pp~0.offset| 4))) .cse15) (and .cse0 (= .cse16 1) .cse1 .cse2 .cse5 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15)))) [2022-11-03 02:35:11,880 INFO L895 garLoopResultBuilder]: At program point L62(line 62) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse1 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= 5 |~#pstate~0.base|) (<= 2 |ULTIMATE.start_init_~i~0#1|) (= |ULTIMATE.start_main_~a~0#1.base| 0) (= (select .cse0 0) 0) (= |~#pstate~0.offset| 0) (= (select .cse1 4) 0) (= (select .cse0 4) 0) (= (select .cse1 |~#pp~0.offset|) 0) (= |ULTIMATE.start_main_~b~0#1.offset| 2) (= ~counter~0 (+ |ULTIMATE.start_main_~b~0#1.offset| 1)) (= |~#pp~0.offset| 0) (= |#NULL.offset| 0) (= |ULTIMATE.start_main_~a~0#1.offset| 1) (= 4 |~#pp~0.base|) (= |ULTIMATE.start_main_~b~0#1.base| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-03 02:35:11,880 INFO L895 garLoopResultBuilder]: At program point L62-1(line 62) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= 5 |~#pstate~0.base|) (= (select .cse0 |~#pp~0.offset|) 1) (<= 2 |ULTIMATE.start_init_~i~0#1|) (= |ULTIMATE.start_main_~a~0#1.base| 0) (= |~#pstate~0.offset| 0) (= (select .cse0 4) 0) (= (select (select |#memory_$Pointer$.base| |~#pp~0.base|) 4) 0) (= |ULTIMATE.start_main_~b~0#1.offset| 2) (= ~counter~0 (+ |ULTIMATE.start_main_~b~0#1.offset| 1)) (= |~#pp~0.offset| 0) (= |#NULL.offset| 0) (= |ULTIMATE.start_main_~a~0#1.offset| 1) (= 4 |~#pp~0.base|) (= |ULTIMATE.start_main_~b~0#1.base| 0) (= (select (select |#memory_int| |~#pstate~0.base|) 0) 1) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-03 02:35:11,880 INFO L895 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse1 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= 5 |~#pstate~0.base|) (<= 2 |ULTIMATE.start_init_~i~0#1|) (= |ULTIMATE.start_main_~a~0#1.base| 0) (= (select .cse0 0) 0) (= |~#pstate~0.offset| 0) (= (select .cse1 4) 0) (= (select .cse0 4) 0) (= (select .cse1 |~#pp~0.offset|) 0) (= |~#pp~0.offset| 0) (= |#NULL.offset| 0) (= |ULTIMATE.start_main_~a~0#1.offset| 1) (= 4 |~#pp~0.base|) (<= 0 |#StackHeapBarrier|) (= ~counter~0 2) (= |#NULL.base| 0))) [2022-11-03 02:35:11,881 INFO L899 garLoopResultBuilder]: For program point L58-1(line 58) no Hoare annotation was computed. [2022-11-03 02:35:11,881 INFO L895 garLoopResultBuilder]: At program point L19-3(lines 19 22) the Hoare annotation is: (let ((.cse1 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse12 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (let ((.cse0 (= 5 |~#pstate~0.base|)) (.cse2 (= |~#pstate~0.offset| 0)) (.cse3 (= (select .cse12 4) 0)) (.cse4 (= (select .cse1 4) 0)) (.cse5 (= (select .cse12 |~#pp~0.offset|) 0)) (.cse6 (= |~#pp~0.offset| 0)) (.cse7 (= |#NULL.offset| 0)) (.cse8 (= ~counter~0 1)) (.cse9 (= 4 |~#pp~0.base|)) (.cse10 (<= 0 |#StackHeapBarrier|)) (.cse11 (= |#NULL.base| 0))) (or (and .cse0 (= (select .cse1 |~#pp~0.offset|) 0) .cse2 .cse3 (= |ULTIMATE.start_init_~i~0#1| 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 (= (select .cse1 0) 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< 3 (+ (* |ULTIMATE.start_init_~i~0#1| 4) |~#pp~0.offset|)) .cse10 .cse11)))) [2022-11-03 02:35:11,881 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse1 (select |#memory_int| |~#pstate~0.base|))) (and (= 5 |~#pstate~0.base|) (= (select .cse0 |~#pp~0.offset|) 1) (<= 2 |ULTIMATE.start_init_~i~0#1|) (= |ULTIMATE.start_main_~a~0#1.base| 0) (= (select .cse1 |~#pstate~0.offset|) 1) (= (select .cse0 4) 2) (= (select .cse1 (+ |~#pstate~0.offset| 4)) 1) (= |ULTIMATE.start_main_~b~0#1.offset| 2) (= ~counter~0 (+ |ULTIMATE.start_main_~b~0#1.offset| 1)) (= |~#pp~0.offset| 0) (= |#NULL.offset| 0) (= |ULTIMATE.start_main_~a~0#1.offset| 1) (<= 0 |~#pstate~0.offset|) (<= |~#pstate~0.offset| 0) (= 4 |~#pp~0.base|) (= |ULTIMATE.start_main_~b~0#1.base| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-03 02:35:11,882 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-03 02:35:11,882 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 60) no Hoare annotation was computed. [2022-11-03 02:35:11,882 INFO L895 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse1 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= 5 |~#pstate~0.base|) (<= 2 |ULTIMATE.start_init_~i~0#1|) (= (select .cse0 0) 0) (= |~#pstate~0.offset| 0) (= (select .cse1 4) 0) (= (select .cse0 4) 0) (= (select .cse1 |~#pp~0.offset|) 0) (= |~#pp~0.offset| 0) (= |#NULL.offset| 0) (= ~counter~0 1) (= 4 |~#pp~0.base|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-03 02:35:11,882 INFO L899 garLoopResultBuilder]: For program point L57-1(line 57) no Hoare annotation was computed. [2022-11-03 02:35:11,882 INFO L902 garLoopResultBuilder]: At program point L70(lines 53 71) the Hoare annotation is: true [2022-11-03 02:35:11,882 INFO L899 garLoopResultBuilder]: For program point L66(line 66) no Hoare annotation was computed. [2022-11-03 02:35:11,883 INFO L895 garLoopResultBuilder]: At program point fake_mallocENTRY(lines 48 51) the Hoare annotation is: (let ((.cse1 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse0 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse2 (+ |~#pp~0.offset| 4))) (or (not (<= 0 |#NULL.offset|)) (= ~counter~0 |old(~counter~0)|) (not (= (select .cse0 |~#pp~0.offset|) 0)) (not (<= 4 |~#pp~0.base|)) (not (<= 5 |~#pstate~0.base|)) (not (<= |fake_malloc_#in~size| 4)) (not (<= 0 |~#pp~0.offset|)) (not (<= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (= |old(~counter~0)| 0) (not (<= 4 |fake_malloc_#in~size|)) (not (<= 0 |#StackHeapBarrier|)) (not (= (select .cse1 0) 0)) (not (<= |~#pstate~0.offset| 0)) (not (<= |~#pp~0.base| 4)) (not (= (select .cse1 .cse2) 0)) (not (<= |#NULL.base| 0)) (not (= (select .cse0 .cse2) 0)) (not (<= 0 |~#pstate~0.offset|)) (not (<= |~#pstate~0.base| 5)) (not (<= |~#pp~0.offset| 0)))) [2022-11-03 02:35:11,883 INFO L899 garLoopResultBuilder]: For program point fake_mallocEXIT(lines 48 51) no Hoare annotation was computed. [2022-11-03 02:35:11,886 INFO L444 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-03 02:35:11,889 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 02:35:11,895 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:586) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:271) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:136) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:136) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:136) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:136) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:136) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:136) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:136) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:136) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:136) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:136) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:136) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:455) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:191) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 02:35:11,898 INFO L158 Benchmark]: Toolchain (without parser) took 137588.42ms. Allocated memory was 102.8MB in the beginning and 270.5MB in the end (delta: 167.8MB). Free memory was 71.4MB in the beginning and 164.6MB in the end (delta: -93.2MB). Peak memory consumption was 163.6MB. Max. memory is 16.1GB. [2022-11-03 02:35:11,898 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 102.8MB. Free memory is still 58.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:35:11,898 INFO L158 Benchmark]: CACSL2BoogieTranslator took 343.51ms. Allocated memory is still 102.8MB. Free memory was 71.3MB in the beginning and 76.7MB in the end (delta: -5.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 02:35:11,899 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.36ms. Allocated memory is still 102.8MB. Free memory was 76.7MB in the beginning and 75.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:35:11,899 INFO L158 Benchmark]: Boogie Preprocessor took 73.01ms. Allocated memory is still 102.8MB. Free memory was 75.0MB in the beginning and 73.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:35:11,899 INFO L158 Benchmark]: RCFGBuilder took 648.02ms. Allocated memory is still 102.8MB. Free memory was 73.7MB in the beginning and 58.6MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-03 02:35:11,899 INFO L158 Benchmark]: TraceAbstraction took 136435.38ms. Allocated memory was 102.8MB in the beginning and 270.5MB in the end (delta: 167.8MB). Free memory was 58.3MB in the beginning and 164.6MB in the end (delta: -106.3MB). Peak memory consumption was 152.0MB. Max. memory is 16.1GB. [2022-11-03 02:35:11,900 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.38ms. Allocated memory is still 102.8MB. Free memory is still 58.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 343.51ms. Allocated memory is still 102.8MB. Free memory was 71.3MB in the beginning and 76.7MB in the end (delta: -5.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.36ms. Allocated memory is still 102.8MB. Free memory was 76.7MB in the beginning and 75.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.01ms. Allocated memory is still 102.8MB. Free memory was 75.0MB in the beginning and 73.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 648.02ms. Allocated memory is still 102.8MB. Free memory was 73.7MB in the beginning and 58.6MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 136435.38ms. Allocated memory was 102.8MB in the beginning and 270.5MB in the end (delta: 167.8MB). Free memory was 58.3MB in the beginning and 164.6MB in the end (delta: -106.3MB). Peak memory consumption was 152.0MB. Max. memory is 16.1GB. * 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: 8]: 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 4 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 136.3s, OverallIterations: 18, TraceHistogramMax: 4, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 28.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1566 SdHoareTripleChecker+Valid, 10.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1557 mSDsluCounter, 2932 SdHoareTripleChecker+Invalid, 8.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1162 IncrementalHoareTripleChecker+Unchecked, 2950 mSDsCounter, 1067 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11557 IncrementalHoareTripleChecker+Invalid, 13786 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1067 mSolverCounterUnsat, 430 mSDtfsCounter, 11557 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2125 GetRequests, 1038 SyntacticMatches, 63 SemanticMatches, 1024 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 20219 ImplicationChecksByTransitivity, 75.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=12, InterpolantAutomatonStates: 394, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 301 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 128 PreInvPairs, 170 NumberOfFragments, 2052 HoareAnnotationTreeSize, 128 FomulaSimplifications, 7556 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 13 FomulaSimplificationsInter, 22874 FormulaSimplificationTreeSizeReductionInter, 3.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 29.7s InterpolantComputationTime, 1323 NumberOfCodeBlocks, 1317 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1525 ConstructedInterpolants, 35 QuantifiedInterpolants, 15489 SizeOfPredicates, 123 NumberOfNonLiveVariables, 5237 ConjunctsInSsa, 611 ConjunctsInUnsatCore, 42 InterpolantComputations, 3 PerfectInterpolantSequences, 420/844 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: 2.0s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 4, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 24, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 22, TOOLS_POST_TIME: 1.0s, TOOLS_POST_CALL_APPLICATIONS: 13, TOOLS_POST_CALL_TIME: 0.4s, TOOLS_POST_RETURN_APPLICATIONS: 8, TOOLS_POST_RETURN_TIME: 0.3s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 43, TOOLS_QUANTIFIERELIM_TIME: 1.6s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.5s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 71, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 12, DOMAIN_JOIN_TIME: 0.1s, 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: 24, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME: 0.8s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.8s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 3, CALL_SUMMARIZER_APPLICATIONS: 8, CALL_SUMMARIZER_CACHE_MISSES: 2, CALL_SUMMARIZER_OVERALL_TIME: 0.1s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.1s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 209, DAG_COMPRESSION_RETAINED_NODES: 71, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:586) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-11-03 02:35:11,919 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-regression/ex3_forlist.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI --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 ddbd4e73adf4663f87721f5aa250c32f7b058621a618ab1d03544a940de1ce0e --- 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-5e519f3 [2022-11-03 02:35:14,364 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:35:14,367 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:35:14,425 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:35:14,426 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:35:14,430 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:35:14,432 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:35:14,437 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:35:14,443 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:35:14,451 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:35:14,452 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:35:14,455 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:35:14,455 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:35:14,458 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:35:14,460 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:35:14,462 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:35:14,463 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:35:14,464 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:35:14,466 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:35:14,475 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:35:14,477 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:35:14,478 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:35:14,482 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:35:14,484 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:35:14,493 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:35:14,493 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:35:14,493 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:35:14,496 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:35:14,496 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:35:14,497 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:35:14,498 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:35:14,499 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:35:14,501 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:35:14,502 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:35:14,503 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:35:14,503 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:35:14,505 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:35:14,505 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:35:14,505 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:35:14,507 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:35:14,508 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:35:14,514 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-11-03 02:35:14,557 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:35:14,557 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:35:14,558 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:35:14,558 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:35:14,559 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:35:14,560 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:35:14,560 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:35:14,560 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:35:14,560 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:35:14,560 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:35:14,562 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:35:14,562 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:35:14,564 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:35:14,564 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:35:14,564 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:35:14,564 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:35:14,565 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:35:14,565 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:35:14,565 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:35:14,565 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 02:35:14,566 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-03 02:35:14,566 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-03 02:35:14,566 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:35:14,566 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:35:14,566 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:35:14,567 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:35:14,567 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:35:14,567 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-03 02:35:14,567 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:35:14,568 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:35:14,568 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:35:14,568 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:35:14,569 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:35:14,569 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-03 02:35:14,569 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-03 02:35:14,570 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:35:14,570 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:35:14,570 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-03 02:35:14,571 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/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_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI 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 -> ddbd4e73adf4663f87721f5aa250c32f7b058621a618ab1d03544a940de1ce0e [2022-11-03 02:35:14,986 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:35:15,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:35:15,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:35:15,017 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:35:15,018 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:35:15,020 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/ldv-regression/ex3_forlist.i [2022-11-03 02:35:15,095 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/data/96f1a2666/d2f8099c25ee4d95ada8e553dfe58e20/FLAG4f0be797b [2022-11-03 02:35:15,701 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:35:15,701 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/sv-benchmarks/c/ldv-regression/ex3_forlist.i [2022-11-03 02:35:15,709 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/data/96f1a2666/d2f8099c25ee4d95ada8e553dfe58e20/FLAG4f0be797b [2022-11-03 02:35:16,026 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/data/96f1a2666/d2f8099c25ee4d95ada8e553dfe58e20 [2022-11-03 02:35:16,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:35:16,032 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:35:16,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:35:16,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:35:16,041 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:35:16,043 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:35:16" (1/1) ... [2022-11-03 02:35:16,045 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7884a6b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:35:16, skipping insertion in model container [2022-11-03 02:35:16,045 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:35:16" (1/1) ... [2022-11-03 02:35:16,054 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:35:16,074 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:35:16,264 WARN L230 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_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/sv-benchmarks/c/ldv-regression/ex3_forlist.i[293,306] [2022-11-03 02:35:16,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:35:16,317 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:35:16,338 WARN L230 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_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/sv-benchmarks/c/ldv-regression/ex3_forlist.i[293,306] [2022-11-03 02:35:16,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:35:16,420 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:35:16,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:35:16 WrapperNode [2022-11-03 02:35:16,421 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:35:16,423 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:35:16,423 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:35:16,423 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:35:16,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:35:16" (1/1) ... [2022-11-03 02:35:16,456 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:35:16" (1/1) ... [2022-11-03 02:35:16,487 INFO L138 Inliner]: procedures = 22, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 70 [2022-11-03 02:35:16,488 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:35:16,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:35:16,489 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:35:16,490 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:35:16,499 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:35:16" (1/1) ... [2022-11-03 02:35:16,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:35:16" (1/1) ... [2022-11-03 02:35:16,510 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:35:16" (1/1) ... [2022-11-03 02:35:16,511 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:35:16" (1/1) ... [2022-11-03 02:35:16,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:35:16" (1/1) ... [2022-11-03 02:35:16,539 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:35:16" (1/1) ... [2022-11-03 02:35:16,544 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:35:16" (1/1) ... [2022-11-03 02:35:16,554 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:35:16" (1/1) ... [2022-11-03 02:35:16,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:35:16,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:35:16,565 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:35:16,566 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:35:16,566 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:35:16" (1/1) ... [2022-11-03 02:35:16,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:35:16,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:35:16,597 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:35:16,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:35:16,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 02:35:16,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-03 02:35:16,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:35:16,646 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-11-03 02:35:16,646 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-11-03 02:35:16,646 INFO L130 BoogieDeclarations]: Found specification of procedure g [2022-11-03 02:35:16,646 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2022-11-03 02:35:16,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-03 02:35:16,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-03 02:35:16,647 INFO L130 BoogieDeclarations]: Found specification of procedure fake_malloc [2022-11-03 02:35:16,647 INFO L138 BoogieDeclarations]: Found implementation of procedure fake_malloc [2022-11-03 02:35:16,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 02:35:16,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-03 02:35:16,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:35:16,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:35:16,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-03 02:35:16,813 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:35:16,816 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:35:17,164 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:35:17,173 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:35:17,175 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-03 02:35:17,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:35:17 BoogieIcfgContainer [2022-11-03 02:35:17,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:35:17,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:35:17,185 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:35:17,188 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:35:17,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:35:16" (1/3) ... [2022-11-03 02:35:17,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@379d4359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:35:17, skipping insertion in model container [2022-11-03 02:35:17,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:35:16" (2/3) ... [2022-11-03 02:35:17,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@379d4359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:35:17, skipping insertion in model container [2022-11-03 02:35:17,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:35:17" (3/3) ... [2022-11-03 02:35:17,192 INFO L112 eAbstractionObserver]: Analyzing ICFG ex3_forlist.i [2022-11-03 02:35:17,212 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:35:17,213 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 02:35:17,275 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:35:17,283 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;@21494037, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:35:17,283 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 02:35:17,288 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-03 02:35:17,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 02:35:17,297 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:35:17,298 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:35:17,299 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:35:17,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:35:17,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1517633021, now seen corresponding path program 1 times [2022-11-03 02:35:17,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:35:17,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2033763649] [2022-11-03 02:35:17,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:35:17,321 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:35:17,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:35:17,325 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:35:17,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-03 02:35:17,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:35:17,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-03 02:35:17,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:35:17,576 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 02:35:17,576 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:35:17,578 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:35:17,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2033763649] [2022-11-03 02:35:17,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2033763649] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:35:17,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:35:17,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:35:17,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709167381] [2022-11-03 02:35:17,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:35:17,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-03 02:35:17,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:35:17,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-03 02:35:17,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 02:35:17,645 INFO L87 Difference]: Start difference. First operand has 38 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-03 02:35:17,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:35:17,683 INFO L93 Difference]: Finished difference Result 71 states and 97 transitions. [2022-11-03 02:35:17,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-03 02:35:17,686 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2022-11-03 02:35:17,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:35:17,696 INFO L225 Difference]: With dead ends: 71 [2022-11-03 02:35:17,696 INFO L226 Difference]: Without dead ends: 33 [2022-11-03 02:35:17,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 02:35:17,706 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:35:17,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:35:17,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-03 02:35:17,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-11-03 02:35:17,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-03 02:35:17,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-11-03 02:35:17,763 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 31 [2022-11-03 02:35:17,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:35:17,764 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-11-03 02:35:17,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-03 02:35:17,765 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-11-03 02:35:17,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 02:35:17,769 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:35:17,769 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:35:17,789 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-03 02:35:17,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:35:17,990 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:35:17,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:35:17,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1707935715, now seen corresponding path program 1 times [2022-11-03 02:35:17,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:35:17,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2041274542] [2022-11-03 02:35:17,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:35:17,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:35:17,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:35:17,993 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:35:17,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-03 02:35:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:35:18,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 02:35:18,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:35:18,160 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 02:35:18,160 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:35:18,160 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:35:18,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2041274542] [2022-11-03 02:35:18,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2041274542] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:35:18,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:35:18,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:35:18,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020301845] [2022-11-03 02:35:18,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:35:18,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:35:18,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:35:18,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:35:18,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:35:18,169 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-03 02:35:18,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:35:18,238 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2022-11-03 02:35:18,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:35:18,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2022-11-03 02:35:18,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:35:18,244 INFO L225 Difference]: With dead ends: 64 [2022-11-03 02:35:18,244 INFO L226 Difference]: Without dead ends: 35 [2022-11-03 02:35:18,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 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-03 02:35:18,247 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:35:18,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 74 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:35:18,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-03 02:35:18,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-11-03 02:35:18,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-03 02:35:18,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-11-03 02:35:18,257 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 31 [2022-11-03 02:35:18,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:35:18,257 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-11-03 02:35:18,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-03 02:35:18,258 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-11-03 02:35:18,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 02:35:18,259 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:35:18,259 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:35:18,274 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-03 02:35:18,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:35:18,473 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:35:18,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:35:18,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1895345243, now seen corresponding path program 1 times [2022-11-03 02:35:18,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:35:18,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1948797044] [2022-11-03 02:35:18,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:35:18,475 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:35:18,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:35:18,477 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:35:18,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-03 02:35:18,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:35:18,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:35:18,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:35:18,655 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 02:35:18,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:35:18,741 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 02:35:18,741 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:35:18,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1948797044] [2022-11-03 02:35:18,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1948797044] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:35:18,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [998135799] [2022-11-03 02:35:18,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:35:18,743 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:35:18,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:35:18,746 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:35:18,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2022-11-03 02:35:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:35:18,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:35:18,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:35:18,950 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 02:35:18,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:35:18,999 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 02:35:19,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [998135799] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:35:19,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306176967] [2022-11-03 02:35:19,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:35:19,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:35:19,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:35:19,003 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:35:19,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 02:35:19,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:35:19,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 02:35:19,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:35:19,161 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:35:19,161 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:35:19,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306176967] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:35:19,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 4 imperfect interpolant sequences. [2022-11-03 02:35:19,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4, 4, 4] total 7 [2022-11-03 02:35:19,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043022404] [2022-11-03 02:35:19,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:35:19,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:35:19,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:35:19,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:35:19,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:35:19,164 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-03 02:35:19,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:35:19,247 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2022-11-03 02:35:19,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:35:19,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2022-11-03 02:35:19,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:35:19,251 INFO L225 Difference]: With dead ends: 58 [2022-11-03 02:35:19,251 INFO L226 Difference]: Without dead ends: 39 [2022-11-03 02:35:19,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:35:19,253 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:35:19,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 72 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:35:19,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-03 02:35:19,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2022-11-03 02:35:19,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-03 02:35:19,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2022-11-03 02:35:19,265 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 33 [2022-11-03 02:35:19,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:35:19,266 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2022-11-03 02:35:19,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-03 02:35:19,266 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-11-03 02:35:19,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-03 02:35:19,269 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:35:19,269 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:35:19,277 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2022-11-03 02:35:19,494 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 02:35:19,680 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-03 02:35:19,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:35:19,872 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:35:19,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:35:19,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1248982919, now seen corresponding path program 1 times [2022-11-03 02:35:19,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:35:19,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2071471555] [2022-11-03 02:35:19,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:35:19,874 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:35:19,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:35:19,876 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:35:19,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-03 02:35:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:35:20,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:35:20,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:35:20,061 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-03 02:35:20,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:35:20,107 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-03 02:35:20,107 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:35:20,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2071471555] [2022-11-03 02:35:20,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2071471555] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:35:20,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1658725760] [2022-11-03 02:35:20,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:35:20,109 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:35:20,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:35:20,110 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:35:20,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2022-11-03 02:35:20,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:35:20,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:35:20,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:35:20,365 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-03 02:35:20,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:35:20,395 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-03 02:35:20,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1658725760] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:35:20,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311209067] [2022-11-03 02:35:20,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:35:20,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:35:20,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:35:20,397 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:35:20,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 02:35:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:35:20,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:35:20,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:35:20,551 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-03 02:35:20,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:35:20,616 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-03 02:35:20,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311209067] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:35:20,617 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:35:20,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 4] total 6 [2022-11-03 02:35:20,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621023018] [2022-11-03 02:35:20,617 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:35:20,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:35:20,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:35:20,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:35:20,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:35:20,619 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-11-03 02:35:20,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:35:20,793 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2022-11-03 02:35:20,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:35:20,794 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 35 [2022-11-03 02:35:20,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:35:20,795 INFO L225 Difference]: With dead ends: 68 [2022-11-03 02:35:20,795 INFO L226 Difference]: Without dead ends: 38 [2022-11-03 02:35:20,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:35:20,797 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 3 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:35:20,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 146 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:35:20,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-03 02:35:20,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-11-03 02:35:20,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-03 02:35:20,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-11-03 02:35:20,806 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 35 [2022-11-03 02:35:20,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:35:20,806 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-11-03 02:35:20,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-11-03 02:35:20,807 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-11-03 02:35:20,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-03 02:35:20,808 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:35:20,808 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:35:20,828 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-03 02:35:21,043 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 02:35:21,224 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2022-11-03 02:35:21,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 02:35:21,422 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:35:21,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:35:21,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1916572233, now seen corresponding path program 2 times [2022-11-03 02:35:21,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:35:21,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [276894477] [2022-11-03 02:35:21,423 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 02:35:21,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:35:21,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:35:21,425 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:35:21,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-03 02:35:21,532 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-03 02:35:21,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:35:21,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-03 02:35:21,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:35:21,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:35:21,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:35:21,811 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-03 02:35:21,811 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:35:21,811 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:35:21,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [276894477] [2022-11-03 02:35:21,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [276894477] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:35:21,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:35:21,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:35:21,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107242915] [2022-11-03 02:35:21,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:35:21,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:35:21,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:35:21,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:35:21,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:35:21,821 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-03 02:35:22,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:35:22,551 INFO L93 Difference]: Finished difference Result 79 states and 101 transitions. [2022-11-03 02:35:22,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 02:35:22,552 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2022-11-03 02:35:22,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:35:22,554 INFO L225 Difference]: With dead ends: 79 [2022-11-03 02:35:22,554 INFO L226 Difference]: Without dead ends: 68 [2022-11-03 02:35:22,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:35:22,556 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 51 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:35:22,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 123 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 02:35:22,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-03 02:35:22,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2022-11-03 02:35:22,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 46 states have internal predecessors, (57), 9 states have call successors, (9), 5 states have call predecessors, (9), 6 states have return successors, (12), 8 states have call predecessors, (12), 7 states have call successors, (12) [2022-11-03 02:35:22,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 78 transitions. [2022-11-03 02:35:22,571 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 78 transitions. Word has length 37 [2022-11-03 02:35:22,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:35:22,572 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 78 transitions. [2022-11-03 02:35:22,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-03 02:35:22,572 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 78 transitions. [2022-11-03 02:35:22,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-03 02:35:22,574 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:35:22,574 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:35:22,591 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-03 02:35:22,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:35:22,789 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:35:22,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:35:22,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1102539601, now seen corresponding path program 1 times [2022-11-03 02:35:22,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:35:22,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324714132] [2022-11-03 02:35:22,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:35:22,790 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:35:22,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:35:22,792 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:35:22,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-03 02:35:22,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:35:23,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-03 02:35:23,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:35:23,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-03 02:35:23,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-03 02:35:23,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:35:23,775 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:35:23,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:35:24,152 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:35:24,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 20 [2022-11-03 02:35:24,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 25 [2022-11-03 02:35:24,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-03 02:35:24,312 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:35:24,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-11-03 02:35:24,316 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:35:24,326 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:35:24,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 21 treesize of output 19 [2022-11-03 02:35:24,751 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:35:24,751 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:35:24,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324714132] [2022-11-03 02:35:24,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [324714132] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:35:24,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [505031849] [2022-11-03 02:35:24,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:35:24,752 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:35:24,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:35:24,754 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:35:24,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2022-11-03 02:35:24,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:35:25,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-03 02:35:25,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:35:25,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-03 02:35:25,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-03 02:35:25,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:35:25,353 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:35:25,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:35:25,513 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:35:25,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 20 [2022-11-03 02:35:25,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 25 [2022-11-03 02:35:25,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-03 02:35:25,573 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:35:25,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-11-03 02:35:25,578 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:35:25,596 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:35:25,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 21 treesize of output 19 [2022-11-03 02:35:25,755 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:35:25,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [505031849] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:35:25,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641763899] [2022-11-03 02:35:25,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:35:25,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:35:25,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:35:25,761 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:35:25,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-03 02:35:25,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:35:25,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-03 02:35:25,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:35:26,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-03 02:35:26,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-03 02:35:26,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:35:26,270 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:35:26,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:35:26,418 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:35:26,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 20 [2022-11-03 02:35:26,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 25 [2022-11-03 02:35:26,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-03 02:35:26,471 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:35:26,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-11-03 02:35:26,476 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:35:26,486 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:35:26,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 21 treesize of output 19 [2022-11-03 02:35:26,614 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:35:26,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641763899] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:35:26,614 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:35:26,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 27 [2022-11-03 02:35:26,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796208450] [2022-11-03 02:35:26,615 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:35:26,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-03 02:35:26,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:35:26,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-03 02:35:26,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2022-11-03 02:35:26,617 INFO L87 Difference]: Start difference. First operand 60 states and 78 transitions. Second operand has 27 states, 25 states have (on average 1.96) internal successors, (49), 19 states have internal predecessors, (49), 7 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-03 02:35:29,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:35:29,512 INFO L93 Difference]: Finished difference Result 131 states and 161 transitions. [2022-11-03 02:35:29,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-03 02:35:29,513 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 1.96) internal successors, (49), 19 states have internal predecessors, (49), 7 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) Word has length 40 [2022-11-03 02:35:29,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:35:29,515 INFO L225 Difference]: With dead ends: 131 [2022-11-03 02:35:29,515 INFO L226 Difference]: Without dead ends: 105 [2022-11-03 02:35:29,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=269, Invalid=1537, Unknown=0, NotChecked=0, Total=1806 [2022-11-03 02:35:29,518 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 231 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:35:29,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 95 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-03 02:35:29,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-03 02:35:29,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2022-11-03 02:35:29,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 73 states have internal predecessors, (90), 12 states have call successors, (12), 8 states have call predecessors, (12), 11 states have return successors, (16), 11 states have call predecessors, (16), 8 states have call successors, (16) [2022-11-03 02:35:29,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 118 transitions. [2022-11-03 02:35:29,540 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 118 transitions. Word has length 40 [2022-11-03 02:35:29,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:35:29,540 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 118 transitions. [2022-11-03 02:35:29,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 1.96) internal successors, (49), 19 states have internal predecessors, (49), 7 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-03 02:35:29,541 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 118 transitions. [2022-11-03 02:35:29,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-03 02:35:29,542 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:35:29,542 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:35:29,583 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-03 02:35:29,769 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-03 02:35:29,965 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2022-11-03 02:35:30,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 02:35:30,161 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:35:30,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:35:30,161 INFO L85 PathProgramCache]: Analyzing trace with hash -2084265885, now seen corresponding path program 1 times [2022-11-03 02:35:30,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:35:30,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [980745310] [2022-11-03 02:35:30,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:35:30,162 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:35:30,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:35:30,163 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:35:30,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-03 02:35:30,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:35:30,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-03 02:35:30,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:35:30,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:35:30,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:35:30,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:35:30,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 21 [2022-11-03 02:35:30,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:35:30,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 20 [2022-11-03 02:35:31,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:35:31,039 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 02:35:31,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:35:31,225 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_552 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store |c_#memory_int| |c_~#pp~0.base| v_ArrVal_552) |c_~#pstate~0.base|) |c_~#pstate~0.offset|))) is different from false [2022-11-03 02:35:31,227 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:35:31,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [980745310] [2022-11-03 02:35:31,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [980745310] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:35:31,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [609856402] [2022-11-03 02:35:31,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:35:31,228 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:35:31,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:35:31,233 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:35:31,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2022-11-03 02:35:31,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:35:31,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-03 02:35:31,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:35:31,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:35:31,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:35:31,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:35:31,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 21 [2022-11-03 02:35:31,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:35:32,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 20 [2022-11-03 02:35:32,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:35:32,049 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 02:35:32,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:35:32,157 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_627 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_~#pp~0.base| v_ArrVal_627) |c_~#pstate~0.base|) |c_~#pstate~0.offset|) (_ bv1 32))) is different from false [2022-11-03 02:35:32,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [609856402] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:35:32,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894352373] [2022-11-03 02:35:32,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:35:32,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:35:32,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:35:32,161 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:35:32,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-03 02:35:32,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:35:32,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-03 02:35:32,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:35:32,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:35:32,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:35:32,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:35:32,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 21 [2022-11-03 02:35:32,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:35:32,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 20 [2022-11-03 02:35:32,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:35:32,759 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 02:35:32,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:35:32,877 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_703 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store |c_#memory_int| |c_~#pp~0.base| v_ArrVal_703) |c_~#pstate~0.base|) |c_~#pstate~0.offset|))) is different from false [2022-11-03 02:35:32,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894352373] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:35:32,880 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:35:32,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 12 [2022-11-03 02:35:32,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745494742] [2022-11-03 02:35:32,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:35:32,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 02:35:32,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:35:32,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 02:35:32,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=163, Unknown=10, NotChecked=84, Total=306 [2022-11-03 02:35:32,882 INFO L87 Difference]: Start difference. First operand 93 states and 118 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 10 states have internal predecessors, (30), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-03 02:35:34,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:35:34,457 INFO L93 Difference]: Finished difference Result 247 states and 316 transitions. [2022-11-03 02:35:34,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-03 02:35:34,458 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 10 states have internal predecessors, (30), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2022-11-03 02:35:34,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:35:34,460 INFO L225 Difference]: With dead ends: 247 [2022-11-03 02:35:34,460 INFO L226 Difference]: Without dead ends: 181 [2022-11-03 02:35:34,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 121 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=152, Invalid=536, Unknown=26, NotChecked=156, Total=870 [2022-11-03 02:35:34,462 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 137 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:35:34,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 337 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 307 Invalid, 0 Unknown, 107 Unchecked, 1.2s Time] [2022-11-03 02:35:34,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-11-03 02:35:34,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 111. [2022-11-03 02:35:34,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 89 states have internal predecessors, (108), 13 states have call successors, (13), 9 states have call predecessors, (13), 14 states have return successors, (18), 12 states have call predecessors, (18), 9 states have call successors, (18) [2022-11-03 02:35:34,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 139 transitions. [2022-11-03 02:35:34,485 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 139 transitions. Word has length 40 [2022-11-03 02:35:34,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:35:34,486 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 139 transitions. [2022-11-03 02:35:34,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 10 states have internal predecessors, (30), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-03 02:35:34,486 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 139 transitions. [2022-11-03 02:35:34,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-03 02:35:34,487 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:35:34,488 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:35:34,506 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-03 02:35:34,722 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-11-03 02:35:34,904 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2022-11-03 02:35:35,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 02:35:35,101 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:35:35,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:35:35,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1683949882, now seen corresponding path program 1 times [2022-11-03 02:35:35,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:35:35,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1087737222] [2022-11-03 02:35:35,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:35:35,103 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:35:35,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:35:35,104 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:35:35,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-03 02:35:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:35:35,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:35:35,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:35:35,303 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 02:35:35,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:35:35,348 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 02:35:35,348 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:35:35,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1087737222] [2022-11-03 02:35:35,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1087737222] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:35:35,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [917287409] [2022-11-03 02:35:35,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:35:35,349 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:35:35,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:35:35,350 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:35:35,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2022-11-03 02:35:35,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:35:35,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:35:35,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:35:35,611 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 02:35:35,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:35:35,650 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 02:35:35,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [917287409] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:35:35,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406697695] [2022-11-03 02:35:35,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:35:35,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:35:35,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:35:35,656 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:35:35,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-03 02:35:35,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:35:35,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:35:35,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:35:35,815 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 02:35:35,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:35:35,843 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 02:35:35,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406697695] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:35:35,844 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:35:35,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 4] total 6 [2022-11-03 02:35:35,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164381593] [2022-11-03 02:35:35,844 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:35:35,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:35:35,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:35:35,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:35:35,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:35:35,846 INFO L87 Difference]: Start difference. First operand 111 states and 139 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-03 02:35:36,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:35:36,054 INFO L93 Difference]: Finished difference Result 145 states and 181 transitions. [2022-11-03 02:35:36,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:35:36,055 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2022-11-03 02:35:36,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:35:36,057 INFO L225 Difference]: With dead ends: 145 [2022-11-03 02:35:36,057 INFO L226 Difference]: Without dead ends: 126 [2022-11-03 02:35:36,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:35:36,058 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 17 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:35:36,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 118 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:35:36,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-03 02:35:36,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 113. [2022-11-03 02:35:36,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 91 states have internal predecessors, (110), 13 states have call successors, (13), 9 states have call predecessors, (13), 14 states have return successors, (18), 12 states have call predecessors, (18), 9 states have call successors, (18) [2022-11-03 02:35:36,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 141 transitions. [2022-11-03 02:35:36,080 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 141 transitions. Word has length 42 [2022-11-03 02:35:36,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:35:36,081 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 141 transitions. [2022-11-03 02:35:36,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-03 02:35:36,081 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 141 transitions. [2022-11-03 02:35:36,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-03 02:35:36,082 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:35:36,083 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:35:36,098 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2022-11-03 02:35:36,294 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-11-03 02:35:36,508 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-03 02:35:36,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:35:36,686 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:35:36,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:35:36,687 INFO L85 PathProgramCache]: Analyzing trace with hash 387918117, now seen corresponding path program 1 times [2022-11-03 02:35:36,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:35:36,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1313905774] [2022-11-03 02:35:36,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:35:36,688 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:35:36,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:35:36,688 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:35:36,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-11-03 02:35:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:35:36,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-03 02:35:36,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:35:37,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:35:37,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:35:37,153 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 02:35:37,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:35:37,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 14 [2022-11-03 02:35:37,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 16 [2022-11-03 02:35:37,424 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-03 02:35:37,425 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:35:37,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1313905774] [2022-11-03 02:35:37,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1313905774] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:35:37,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1095503375] [2022-11-03 02:35:37,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:35:37,425 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:35:37,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:35:37,426 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:35:37,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2022-11-03 02:35:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:35:37,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-03 02:35:37,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:35:37,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:35:37,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:35:37,969 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 02:35:37,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:35:38,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 14 [2022-11-03 02:35:38,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 16 [2022-11-03 02:35:38,128 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-03 02:35:38,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1095503375] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:35:38,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358758300] [2022-11-03 02:35:38,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:35:38,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:35:38,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:35:38,131 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:35:38,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-03 02:35:38,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:35:38,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 02:35:38,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:35:38,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:35:38,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:35:38,494 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-03 02:35:38,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:35:38,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 14 [2022-11-03 02:35:38,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 16 [2022-11-03 02:35:38,650 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-03 02:35:38,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358758300] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:35:38,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:35:38,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9, 8, 8, 8] total 15 [2022-11-03 02:35:38,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951965511] [2022-11-03 02:35:38,651 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:35:38,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-03 02:35:38,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:35:38,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-03 02:35:38,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-11-03 02:35:38,653 INFO L87 Difference]: Start difference. First operand 113 states and 141 transitions. Second operand has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-03 02:35:40,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:35:40,340 INFO L93 Difference]: Finished difference Result 198 states and 255 transitions. [2022-11-03 02:35:40,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 02:35:40,343 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) Word has length 43 [2022-11-03 02:35:40,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:35:40,345 INFO L225 Difference]: With dead ends: 198 [2022-11-03 02:35:40,345 INFO L226 Difference]: Without dead ends: 172 [2022-11-03 02:35:40,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2022-11-03 02:35:40,347 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 72 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:35:40,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 310 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-03 02:35:40,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-11-03 02:35:40,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 156. [2022-11-03 02:35:40,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 119 states have (on average 1.3277310924369747) internal successors, (158), 128 states have internal predecessors, (158), 17 states have call successors, (17), 11 states have call predecessors, (17), 19 states have return successors, (26), 16 states have call predecessors, (26), 11 states have call successors, (26) [2022-11-03 02:35:40,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 201 transitions. [2022-11-03 02:35:40,387 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 201 transitions. Word has length 43 [2022-11-03 02:35:40,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:35:40,388 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 201 transitions. [2022-11-03 02:35:40,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-03 02:35:40,389 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 201 transitions. [2022-11-03 02:35:40,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-03 02:35:40,390 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:35:40,391 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:35:40,401 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2022-11-03 02:35:40,605 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-11-03 02:35:40,819 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-03 02:35:40,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:35:40,995 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:35:40,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:35:40,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1587353369, now seen corresponding path program 2 times [2022-11-03 02:35:40,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:35:40,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1949506932] [2022-11-03 02:35:40,996 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 02:35:40,997 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:35:40,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:35:40,998 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:35:41,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-11-03 02:35:41,334 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 02:35:41,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:35:41,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-03 02:35:41,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:35:41,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:35:41,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-11-03 02:35:41,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:35:41,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 21 [2022-11-03 02:35:41,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:35:41,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 20 [2022-11-03 02:35:42,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:35:42,103 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 02:35:42,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:35:42,332 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1128 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_~#pp~0.base| v_ArrVal_1128) |c_~#pstate~0.base|) (bvadd (_ bv4 32) |c_~#pstate~0.offset|)) (_ bv1 32))) is different from false [2022-11-03 02:35:42,334 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:35:42,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1949506932] [2022-11-03 02:35:42,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1949506932] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:35:42,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [338707728] [2022-11-03 02:35:42,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 02:35:42,335 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:35:42,335 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:35:42,337 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:35:42,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2022-11-03 02:35:42,698 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 02:35:42,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:35:42,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-03 02:35:42,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:35:43,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:35:43,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-11-03 02:35:43,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:35:43,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 21 [2022-11-03 02:35:43,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:35:43,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 20 [2022-11-03 02:35:43,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 10 [2022-11-03 02:35:43,510 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 02:35:43,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:35:43,664 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_~#pp~0.base| v_ArrVal_1202) |c_~#pstate~0.base|) (bvadd (_ bv4 32) |c_~#pstate~0.offset|)) (_ bv1 32))) is different from false [2022-11-03 02:35:43,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [338707728] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:35:43,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314969225] [2022-11-03 02:35:43,667 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 02:35:43,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:35:43,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:35:43,668 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:35:43,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-03 02:35:43,850 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 02:35:43,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:35:43,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-03 02:35:43,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:35:44,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:35:44,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-11-03 02:35:44,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:35:44,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 21 [2022-11-03 02:35:44,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:35:44,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 20 [2022-11-03 02:35:44,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:35:44,314 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 02:35:44,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:35:44,469 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1277 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store |c_#memory_int| |c_~#pp~0.base| v_ArrVal_1277) |c_~#pstate~0.base|) (bvadd (_ bv4 32) |c_~#pstate~0.offset|)))) is different from false [2022-11-03 02:35:44,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314969225] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:35:44,472 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:35:44,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 17 [2022-11-03 02:35:44,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885935054] [2022-11-03 02:35:44,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:35:44,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-03 02:35:44,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:35:44,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-03 02:35:44,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=336, Unknown=18, NotChecked=120, Total=552 [2022-11-03 02:35:44,475 INFO L87 Difference]: Start difference. First operand 156 states and 201 transitions. Second operand has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 14 states have internal predecessors, (41), 4 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-03 02:35:47,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:35:47,503 INFO L93 Difference]: Finished difference Result 309 states and 396 transitions. [2022-11-03 02:35:47,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-03 02:35:47,504 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 14 states have internal predecessors, (41), 4 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 43 [2022-11-03 02:35:47,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:35:47,506 INFO L225 Difference]: With dead ends: 309 [2022-11-03 02:35:47,506 INFO L226 Difference]: Without dead ends: 279 [2022-11-03 02:35:47,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=311, Invalid=1630, Unknown=51, NotChecked=264, Total=2256 [2022-11-03 02:35:47,511 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 186 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 309 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:35:47,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 389 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 507 Invalid, 0 Unknown, 309 Unchecked, 2.2s Time] [2022-11-03 02:35:47,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-11-03 02:35:47,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 215. [2022-11-03 02:35:47,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 168 states have (on average 1.3452380952380953) internal successors, (226), 177 states have internal predecessors, (226), 23 states have call successors, (23), 15 states have call predecessors, (23), 23 states have return successors, (31), 22 states have call predecessors, (31), 13 states have call successors, (31) [2022-11-03 02:35:47,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 280 transitions. [2022-11-03 02:35:47,597 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 280 transitions. Word has length 43 [2022-11-03 02:35:47,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:35:47,600 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 280 transitions. [2022-11-03 02:35:47,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 14 states have internal predecessors, (41), 4 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-03 02:35:47,601 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 280 transitions. [2022-11-03 02:35:47,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-03 02:35:47,612 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:35:47,613 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:35:47,627 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-11-03 02:35:47,836 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2022-11-03 02:35:48,061 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-03 02:35:48,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:35:48,227 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:35:48,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:35:48,228 INFO L85 PathProgramCache]: Analyzing trace with hash -479191559, now seen corresponding path program 2 times [2022-11-03 02:35:48,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:35:48,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [444799355] [2022-11-03 02:35:48,228 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 02:35:48,228 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:35:48,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:35:48,229 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:35:48,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-11-03 02:35:48,478 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 02:35:48,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:35:48,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-03 02:35:48,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:35:48,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 16 treesize of output 16 [2022-11-03 02:35:48,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-03 02:35:48,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-11-03 02:35:49,109 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 02:35:49,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:35:49,674 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:35:49,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 24 [2022-11-03 02:35:49,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2022-11-03 02:35:49,847 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:35:49,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-11-03 02:35:49,849 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:35:49,863 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:35:49,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 23 treesize of output 19 [2022-11-03 02:35:50,375 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 02:35:50,375 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:35:50,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [444799355] [2022-11-03 02:35:50,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [444799355] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:35:50,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1173419346] [2022-11-03 02:35:50,376 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 02:35:50,376 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:35:50,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:35:50,377 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:35:50,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2022-11-03 02:35:50,732 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 02:35:50,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:35:50,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-03 02:35:50,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:35:51,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 16 treesize of output 16 [2022-11-03 02:35:51,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-03 02:35:51,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-11-03 02:35:52,073 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 02:35:52,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:35:52,297 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:35:52,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 24 [2022-11-03 02:35:52,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2022-11-03 02:35:52,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:35:52,353 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:35:52,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-11-03 02:35:52,357 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:35:52,369 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:35:52,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 23 treesize of output 19 [2022-11-03 02:35:52,567 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 02:35:52,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1173419346] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:35:52,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581522407] [2022-11-03 02:35:52,568 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 02:35:52,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:35:52,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:35:52,569 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:35:52,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-03 02:35:52,776 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 02:35:52,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:35:52,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-03 02:35:52,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:35:53,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 16 treesize of output 16 [2022-11-03 02:35:53,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-03 02:35:53,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-11-03 02:35:53,216 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 02:35:53,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:35:53,431 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:35:53,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 24 [2022-11-03 02:35:53,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2022-11-03 02:35:53,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:35:53,483 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:35:53,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-11-03 02:35:53,485 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:35:53,495 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:35:53,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 23 treesize of output 19 [2022-11-03 02:35:53,711 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 02:35:53,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581522407] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:35:53,712 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:35:53,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16, 16, 16, 16] total 46 [2022-11-03 02:35:53,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820870912] [2022-11-03 02:35:53,712 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:35:53,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-03 02:35:53,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:35:53,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-03 02:35:53,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1883, Unknown=0, NotChecked=0, Total=2070 [2022-11-03 02:35:53,715 INFO L87 Difference]: Start difference. First operand 215 states and 280 transitions. Second operand has 46 states, 43 states have (on average 2.0) internal successors, (86), 34 states have internal predecessors, (86), 10 states have call successors, (13), 10 states have call predecessors, (13), 12 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2022-11-03 02:35:58,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:35:58,856 INFO L93 Difference]: Finished difference Result 325 states and 418 transitions. [2022-11-03 02:35:58,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-03 02:35:58,865 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 2.0) internal successors, (86), 34 states have internal predecessors, (86), 10 states have call successors, (13), 10 states have call predecessors, (13), 12 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) Word has length 43 [2022-11-03 02:35:58,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:35:58,869 INFO L225 Difference]: With dead ends: 325 [2022-11-03 02:35:58,869 INFO L226 Difference]: Without dead ends: 281 [2022-11-03 02:35:58,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1023 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=512, Invalid=3778, Unknown=0, NotChecked=0, Total=4290 [2022-11-03 02:35:58,872 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 256 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1280 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-11-03 02:35:58,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 135 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1280 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-11-03 02:35:58,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-11-03 02:35:58,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 243. [2022-11-03 02:35:58,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 191 states have (on average 1.3455497382198953) internal successors, (257), 200 states have internal predecessors, (257), 26 states have call successors, (26), 17 states have call predecessors, (26), 25 states have return successors, (33), 25 states have call predecessors, (33), 14 states have call successors, (33) [2022-11-03 02:35:58,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 316 transitions. [2022-11-03 02:35:58,931 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 316 transitions. Word has length 43 [2022-11-03 02:35:58,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:35:58,931 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 316 transitions. [2022-11-03 02:35:58,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 2.0) internal successors, (86), 34 states have internal predecessors, (86), 10 states have call successors, (13), 10 states have call predecessors, (13), 12 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2022-11-03 02:35:58,932 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 316 transitions. [2022-11-03 02:35:58,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:35:58,935 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:35:58,935 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:35:58,977 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-11-03 02:35:59,154 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (27)] Ended with exit code 0 [2022-11-03 02:35:59,361 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (26)] Ended with exit code 0 [2022-11-03 02:35:59,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:35:59,552 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:35:59,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:35:59,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1603970476, now seen corresponding path program 1 times [2022-11-03 02:35:59,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:35:59,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1391342839] [2022-11-03 02:35:59,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:35:59,553 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:35:59,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:35:59,554 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:35:59,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-11-03 02:35:59,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:35:59,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-03 02:35:59,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:36:00,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-03 02:36:00,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-03 02:36:00,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-03 02:36:00,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-03 02:36:00,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:36:00,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:36:00,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:36:00,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:36:00,550 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-03 02:36:00,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:36:01,153 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:36:01,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 19 [2022-11-03 02:36:01,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 22 [2022-11-03 02:36:01,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 treesize of output 3 [2022-11-03 02:36:01,174 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:36:01,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 1 [2022-11-03 02:36:01,309 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:36:01,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-03 02:36:01,312 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:36:01,325 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:36:01,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 20 treesize of output 18 [2022-11-03 02:36:01,347 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:36:01,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-03 02:36:01,351 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:36:01,363 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 02:36:01,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 20 treesize of output 12 [2022-11-03 02:36:01,545 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-03 02:36:01,545 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:36:01,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1391342839] [2022-11-03 02:36:01,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1391342839] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:36:01,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1637774306] [2022-11-03 02:36:01,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:36:01,546 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:36:01,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:36:01,547 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:36:01,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2022-11-03 02:36:01,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:36:01,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-03 02:36:01,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:36:02,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-03 02:36:02,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-03 02:36:02,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-03 02:36:02,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-03 02:36:02,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:36:02,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:36:03,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:36:03,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:36:03,182 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-03 02:36:03,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:36:03,568 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:36:03,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 19 [2022-11-03 02:36:03,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 22 [2022-11-03 02:36:03,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 treesize of output 3 [2022-11-03 02:36:03,589 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:36:03,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 1 [2022-11-03 02:36:03,637 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:36:03,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-03 02:36:03,640 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:36:03,653 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:36:03,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 20 treesize of output 18 [2022-11-03 02:36:03,675 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:36:03,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-03 02:36:03,679 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:36:03,694 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 02:36:03,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 20 treesize of output 12 [2022-11-03 02:36:03,808 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-03 02:36:03,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1637774306] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:36:03,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137751806] [2022-11-03 02:36:03,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:36:03,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:36:03,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:36:03,810 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:36:03,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-11-03 02:36:04,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:36:04,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-03 02:36:04,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:36:04,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-03 02:36:04,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-03 02:36:04,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-03 02:36:04,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-03 02:36:04,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:36:04,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:36:04,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:36:05,026 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-03 02:36:05,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:36:05,386 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:36:05,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 19 [2022-11-03 02:36:05,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 14 [2022-11-03 02:36:05,398 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:36:05,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 1 [2022-11-03 02:36:05,438 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:36:05,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-03 02:36:05,441 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:36:05,451 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:36:05,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 20 treesize of output 18 [2022-11-03 02:36:05,468 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:36:05,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-03 02:36:05,472 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:36:05,483 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 02:36:05,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 20 treesize of output 12 [2022-11-03 02:36:05,558 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-03 02:36:05,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137751806] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:36:05,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:36:05,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 14, 10, 13, 10] total 43 [2022-11-03 02:36:05,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27911635] [2022-11-03 02:36:05,560 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:36:05,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-03 02:36:05,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:36:05,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-03 02:36:05,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1638, Unknown=0, NotChecked=0, Total=1806 [2022-11-03 02:36:05,562 INFO L87 Difference]: Start difference. First operand 243 states and 316 transitions. Second operand has 43 states, 39 states have (on average 2.4615384615384617) internal successors, (96), 30 states have internal predecessors, (96), 11 states have call successors, (20), 12 states have call predecessors, (20), 12 states have return successors, (16), 11 states have call predecessors, (16), 11 states have call successors, (16) [2022-11-03 02:36:09,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:36:09,523 INFO L93 Difference]: Finished difference Result 303 states and 391 transitions. [2022-11-03 02:36:09,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-03 02:36:09,529 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 39 states have (on average 2.4615384615384617) internal successors, (96), 30 states have internal predecessors, (96), 11 states have call successors, (20), 12 states have call predecessors, (20), 12 states have return successors, (16), 11 states have call predecessors, (16), 11 states have call successors, (16) Word has length 45 [2022-11-03 02:36:09,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:36:09,532 INFO L225 Difference]: With dead ends: 303 [2022-11-03 02:36:09,532 INFO L226 Difference]: Without dead ends: 277 [2022-11-03 02:36:09,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 223 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=351, Invalid=2619, Unknown=0, NotChecked=0, Total=2970 [2022-11-03 02:36:09,535 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 176 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:36:09,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 139 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-11-03 02:36:09,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-11-03 02:36:09,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 239. [2022-11-03 02:36:09,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 189 states have (on average 1.3386243386243386) internal successors, (253), 197 states have internal predecessors, (253), 25 states have call successors, (25), 17 states have call predecessors, (25), 24 states have return successors, (32), 24 states have call predecessors, (32), 14 states have call successors, (32) [2022-11-03 02:36:09,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 310 transitions. [2022-11-03 02:36:09,588 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 310 transitions. Word has length 45 [2022-11-03 02:36:09,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:36:09,589 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 310 transitions. [2022-11-03 02:36:09,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 39 states have (on average 2.4615384615384617) internal successors, (96), 30 states have internal predecessors, (96), 11 states have call successors, (20), 12 states have call predecessors, (20), 12 states have return successors, (16), 11 states have call predecessors, (16), 11 states have call successors, (16) [2022-11-03 02:36:09,589 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 310 transitions. [2022-11-03 02:36:09,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:36:09,590 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:36:09,591 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:36:09,595 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (30)] Ended with exit code 0 [2022-11-03 02:36:09,818 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-11-03 02:36:10,004 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (29)] Ended with exit code 0 [2022-11-03 02:36:10,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:36:10,195 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:36:10,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:36:10,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1222457682, now seen corresponding path program 2 times [2022-11-03 02:36:10,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:36:10,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [332975185] [2022-11-03 02:36:10,196 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 02:36:10,196 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:36:10,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:36:10,197 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:36:10,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-11-03 02:36:10,436 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 02:36:10,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:36:10,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 02:36:10,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:36:10,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 18 treesize of output 18 [2022-11-03 02:36:10,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2022-11-03 02:36:10,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-03 02:36:10,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 23 [2022-11-03 02:36:11,065 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:36:11,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 7 [2022-11-03 02:36:11,377 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:36:11,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2022-11-03 02:36:11,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-03 02:36:11,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:36:11,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:36:11,754 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 02:36:11,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:36:12,203 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_f_~pointer.offset_171 (_ BitVec 32)) (v_ArrVal_1770 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (bvadd (_ bv4 32) |c_~#pp~0.offset|) v_f_~pointer.offset_171)) |c_~#pstate~0.base| v_ArrVal_1770) |c_~#pp~0.base|) |c_~#pp~0.offset|)))) is different from false [2022-11-03 02:36:12,205 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:36:12,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [332975185] [2022-11-03 02:36:12,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [332975185] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:36:12,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1910581653] [2022-11-03 02:36:12,206 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 02:36:12,206 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:36:12,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:36:12,207 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:36:12,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2022-11-03 02:36:12,602 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 02:36:12,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:36:12,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-03 02:36:12,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:36:12,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 18 treesize of output 18 [2022-11-03 02:36:12,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2022-11-03 02:36:12,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:36:12,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-03 02:36:12,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-03 02:36:13,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:36:14,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:36:14,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-03 02:36:14,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-03 02:36:14,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:36:14,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:36:14,492 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:36:14,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:36:14,633 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1833 (_ BitVec 32)) (v_ArrVal_1834 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (bvadd (_ bv4 32) |c_~#pp~0.offset|) v_ArrVal_1833)) |c_~#pstate~0.base| v_ArrVal_1834) |c_~#pp~0.base|) |c_~#pp~0.offset|)))) is different from false [2022-11-03 02:36:14,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1910581653] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:36:14,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43864272] [2022-11-03 02:36:14,635 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 02:36:14,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:36:14,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:36:14,636 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:36:14,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-11-03 02:36:14,823 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 02:36:14,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:36:14,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-03 02:36:14,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:36:14,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 18 treesize of output 18 [2022-11-03 02:36:14,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2022-11-03 02:36:15,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:36:15,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-03 02:36:15,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 23 [2022-11-03 02:36:15,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:36:15,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 7 [2022-11-03 02:36:16,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:36:16,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 33 treesize of output 29 [2022-11-03 02:36:16,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-03 02:36:16,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:36:16,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:36:16,369 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 02:36:16,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:36:16,527 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_f_~pointer.offset_185 (_ BitVec 32)) (v_ArrVal_1900 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (bvadd (_ bv4 32) |c_~#pp~0.offset|) v_f_~pointer.offset_185)) |c_~#pstate~0.base| v_ArrVal_1900) |c_~#pp~0.base|) |c_~#pp~0.offset|)))) is different from false [2022-11-03 02:36:16,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43864272] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:36:16,529 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:36:16,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 20] total 45 [2022-11-03 02:36:16,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058981696] [2022-11-03 02:36:16,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:36:16,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-03 02:36:16,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:36:16,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-03 02:36:16,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=2311, Unknown=32, NotChecked=300, Total=2862 [2022-11-03 02:36:16,532 INFO L87 Difference]: Start difference. First operand 239 states and 310 transitions. Second operand has 46 states, 44 states have (on average 1.7727272727272727) internal successors, (78), 33 states have internal predecessors, (78), 8 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2022-11-03 02:36:20,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:36:20,887 INFO L93 Difference]: Finished difference Result 370 states and 474 transitions. [2022-11-03 02:36:20,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-03 02:36:20,889 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 44 states have (on average 1.7727272727272727) internal successors, (78), 33 states have internal predecessors, (78), 8 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) Word has length 45 [2022-11-03 02:36:20,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:36:20,891 INFO L225 Difference]: With dead ends: 370 [2022-11-03 02:36:20,891 INFO L226 Difference]: Without dead ends: 319 [2022-11-03 02:36:20,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 132 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1235 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=447, Invalid=3800, Unknown=55, NotChecked=390, Total=4692 [2022-11-03 02:36:20,893 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 325 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:36:20,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 432 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1050 Invalid, 0 Unknown, 118 Unchecked, 3.4s Time] [2022-11-03 02:36:20,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-11-03 02:36:20,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 270. [2022-11-03 02:36:20,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 215 states have (on average 1.3348837209302327) internal successors, (287), 223 states have internal predecessors, (287), 27 states have call successors, (27), 20 states have call predecessors, (27), 27 states have return successors, (38), 26 states have call predecessors, (38), 16 states have call successors, (38) [2022-11-03 02:36:20,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 352 transitions. [2022-11-03 02:36:20,935 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 352 transitions. Word has length 45 [2022-11-03 02:36:20,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:36:20,935 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 352 transitions. [2022-11-03 02:36:20,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 44 states have (on average 1.7727272727272727) internal successors, (78), 33 states have internal predecessors, (78), 8 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2022-11-03 02:36:20,936 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 352 transitions. [2022-11-03 02:36:20,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:36:20,937 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:36:20,937 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:36:20,950 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (32)] Ended with exit code 0 [2022-11-03 02:36:21,188 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-11-03 02:36:21,354 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2022-11-03 02:36:21,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 02:36:21,551 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:36:21,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:36:21,551 INFO L85 PathProgramCache]: Analyzing trace with hash -612181010, now seen corresponding path program 2 times [2022-11-03 02:36:21,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:36:21,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024938846] [2022-11-03 02:36:21,552 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 02:36:21,552 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:36:21,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:36:21,553 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:36:21,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-11-03 02:36:21,787 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 02:36:21,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:36:21,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-03 02:36:21,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:36:21,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2022-11-03 02:36:21,891 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:36:22,000 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-03 02:36:22,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:36:22,588 INFO L356 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-11-03 02:36:22,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 25 [2022-11-03 02:36:22,597 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 02:36:22,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 12 [2022-11-03 02:36:22,629 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-03 02:36:22,630 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:36:22,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024938846] [2022-11-03 02:36:22,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2024938846] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:36:22,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [465098870] [2022-11-03 02:36:22,630 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 02:36:22,630 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:36:22,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:36:22,631 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:36:22,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2022-11-03 02:36:23,018 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 02:36:23,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:36:23,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-03 02:36:23,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:36:23,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 16 treesize of output 16 [2022-11-03 02:36:23,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-03 02:36:23,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-11-03 02:36:23,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-11-03 02:36:24,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:36:24,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:36:24,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-03 02:36:24,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-03 02:36:24,705 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:36:24,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 02:36:24,791 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:36:24,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:36:25,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-11-03 02:36:25,690 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2012 (_ BitVec 32))) (not (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) |c_~#pp~0.offset| v_ArrVal_2012)) |c_~#pstate~0.base| v_ArrVal_2013) |c_~#pp~0.base|) (bvadd (_ bv4 32) |c_~#pp~0.offset|))))) is different from false [2022-11-03 02:36:25,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [465098870] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:36:25,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578245692] [2022-11-03 02:36:25,692 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 02:36:25,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:36:25,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:36:25,693 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:36:25,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-11-03 02:36:25,930 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 02:36:25,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:36:25,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-03 02:36:25,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:36:26,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2022-11-03 02:36:26,354 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:36:26,713 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-03 02:36:26,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:36:27,681 INFO L356 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-11-03 02:36:27,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 25 [2022-11-03 02:36:27,690 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 02:36:27,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 12 [2022-11-03 02:36:27,700 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-03 02:36:27,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578245692] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:36:27,700 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-03 02:36:27,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 18, 9, 9] total 39 [2022-11-03 02:36:27,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799286019] [2022-11-03 02:36:27,700 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-03 02:36:27,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-03 02:36:27,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:36:27,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-03 02:36:27,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1805, Unknown=5, NotChecked=86, Total=2070 [2022-11-03 02:36:27,702 INFO L87 Difference]: Start difference. First operand 270 states and 352 transitions. Second operand has 39 states, 38 states have (on average 2.3684210526315788) internal successors, (90), 32 states have internal predecessors, (90), 8 states have call successors, (15), 10 states have call predecessors, (15), 10 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2022-11-03 02:36:33,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:36:33,175 INFO L93 Difference]: Finished difference Result 426 states and 544 transitions. [2022-11-03 02:36:33,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-03 02:36:33,176 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.3684210526315788) internal successors, (90), 32 states have internal predecessors, (90), 8 states have call successors, (15), 10 states have call predecessors, (15), 10 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) Word has length 45 [2022-11-03 02:36:33,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:36:33,178 INFO L225 Difference]: With dead ends: 426 [2022-11-03 02:36:33,178 INFO L226 Difference]: Without dead ends: 397 [2022-11-03 02:36:33,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=404, Invalid=3377, Unknown=5, NotChecked=120, Total=3906 [2022-11-03 02:36:33,180 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 181 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 1225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:36:33,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 505 Invalid, 1225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1038 Invalid, 0 Unknown, 81 Unchecked, 4.1s Time] [2022-11-03 02:36:33,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-11-03 02:36:33,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 308. [2022-11-03 02:36:33,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 244 states have (on average 1.3360655737704918) internal successors, (326), 254 states have internal predecessors, (326), 31 states have call successors, (31), 23 states have call predecessors, (31), 32 states have return successors, (41), 30 states have call predecessors, (41), 18 states have call successors, (41) [2022-11-03 02:36:33,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 398 transitions. [2022-11-03 02:36:33,229 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 398 transitions. Word has length 45 [2022-11-03 02:36:33,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:36:33,229 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 398 transitions. [2022-11-03 02:36:33,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.3684210526315788) internal successors, (90), 32 states have internal predecessors, (90), 8 states have call successors, (15), 10 states have call predecessors, (15), 10 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2022-11-03 02:36:33,230 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 398 transitions. [2022-11-03 02:36:33,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:36:33,231 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:36:33,231 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:36:33,248 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2022-11-03 02:36:33,466 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-11-03 02:36:33,647 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (36)] Ended with exit code 0 [2022-11-03 02:36:33,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 02:36:33,845 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:36:33,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:36:33,845 INFO L85 PathProgramCache]: Analyzing trace with hash 495980800, now seen corresponding path program 3 times [2022-11-03 02:36:33,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:36:33,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [340802690] [2022-11-03 02:36:33,845 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:36:33,846 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:36:33,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:36:33,846 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:36:33,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2022-11-03 02:36:34,109 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 02:36:34,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:36:34,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-03 02:36:34,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:36:34,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 18 treesize of output 18 [2022-11-03 02:36:34,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2022-11-03 02:36:34,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:36:34,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-03 02:36:34,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-03 02:36:34,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:36:34,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:36:34,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:36:34,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 33 treesize of output 29 [2022-11-03 02:36:34,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-03 02:36:35,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:36:35,109 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 02:36:35,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:36:35,405 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:36:35,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [340802690] [2022-11-03 02:36:35,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [340802690] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:36:35,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [296424255] [2022-11-03 02:36:35,406 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:36:35,406 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:36:35,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:36:35,407 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:36:35,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2022-11-03 02:36:35,823 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:36:35,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008203088] [2022-11-03 02:36:35,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:36:35,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:36:35,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:36:35,830 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (39)] Forceful destruction successful, exit code 1 [2022-11-03 02:36:35,830 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:36:35,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-11-03 02:36:36,456 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 02:36:36,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:36:36,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-03 02:36:36,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:36:36,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 18 treesize of output 18 [2022-11-03 02:36:36,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2022-11-03 02:36:36,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:36:36,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-03 02:36:36,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-03 02:36:37,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:36:37,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:36:37,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:36:37,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-03 02:36:37,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-03 02:36:37,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:36:38,007 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:36:38,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:36:38,105 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2240 (Array (_ BitVec 32) (_ BitVec 32))) (v_f_~pointer.offset_210 (_ BitVec 32))) (not (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (bvadd (_ bv4 32) |c_~#pp~0.offset|) v_f_~pointer.offset_210)) |c_~#pstate~0.base| v_ArrVal_2240) |c_~#pp~0.base|) |c_~#pp~0.offset|)))) is different from false [2022-11-03 02:36:38,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008203088] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:36:38,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:36:38,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 33 [2022-11-03 02:36:38,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926513184] [2022-11-03 02:36:38,107 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:36:38,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-03 02:36:38,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:36:38,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-03 02:36:38,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1313, Unknown=23, NotChecked=74, Total=1560 [2022-11-03 02:36:38,109 INFO L87 Difference]: Start difference. First operand 308 states and 398 transitions. Second operand has 34 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 26 states have internal predecessors, (52), 7 states have call successors, (10), 5 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-03 02:36:42,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:36:42,683 INFO L93 Difference]: Finished difference Result 442 states and 559 transitions. [2022-11-03 02:36:42,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-03 02:36:42,684 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 26 states have internal predecessors, (52), 7 states have call successors, (10), 5 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) Word has length 45 [2022-11-03 02:36:42,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:36:42,685 INFO L225 Difference]: With dead ends: 442 [2022-11-03 02:36:42,685 INFO L226 Difference]: Without dead ends: 407 [2022-11-03 02:36:42,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 762 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=298, Invalid=2533, Unknown=35, NotChecked=104, Total=2970 [2022-11-03 02:36:42,687 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 157 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 1396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 227 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:36:42,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 465 Invalid, 1396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1076 Invalid, 0 Unknown, 227 Unchecked, 3.7s Time] [2022-11-03 02:36:42,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2022-11-03 02:36:42,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 289. [2022-11-03 02:36:42,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 228 states have (on average 1.3289473684210527) internal successors, (303), 238 states have internal predecessors, (303), 29 states have call successors, (29), 22 states have call predecessors, (29), 31 states have return successors, (39), 28 states have call predecessors, (39), 17 states have call successors, (39) [2022-11-03 02:36:42,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 371 transitions. [2022-11-03 02:36:42,745 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 371 transitions. Word has length 45 [2022-11-03 02:36:42,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:36:42,745 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 371 transitions. [2022-11-03 02:36:42,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 26 states have internal predecessors, (52), 7 states have call successors, (10), 5 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-03 02:36:42,746 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 371 transitions. [2022-11-03 02:36:42,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-03 02:36:42,747 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:36:42,747 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:36:42,758 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (38)] Ended with exit code 0 [2022-11-03 02:36:42,978 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-11-03 02:36:43,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:36:43,155 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:36:43,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:36:43,156 INFO L85 PathProgramCache]: Analyzing trace with hash -877670109, now seen corresponding path program 3 times [2022-11-03 02:36:43,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:36:43,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1579398376] [2022-11-03 02:36:43,156 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:36:43,156 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:36:43,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:36:43,157 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:36:43,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2022-11-03 02:36:43,443 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 02:36:43,443 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:36:43,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-03 02:36:43,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:36:43,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-03 02:36:43,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-03 02:36:43,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-03 02:36:43,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-03 02:36:43,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:36:43,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:36:44,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:36:44,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-03 02:36:44,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-03 02:36:44,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:36:44,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-03 02:36:44,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-03 02:36:44,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:36:44,599 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 02:36:44,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:36:45,486 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|)) (.cse3 (bvadd (_ bv4 32) |c_~#pp~0.offset|))) (and (forall ((v_ArrVal_2335 (Array (_ BitVec 32) (_ BitVec 32))) (|v_g_~i~2#1_67| (_ BitVec 32)) (v_f_~pointer.offset_213 (_ BitVec 32))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store .cse2 .cse3 v_f_~pointer.offset_213)) |c_~#pstate~0.base| v_ArrVal_2335) |c_~#pp~0.base|))) (let ((.cse0 (select .cse1 (bvadd (bvmul (_ bv4 32) |v_g_~i~2#1_67|) |c_~#pp~0.offset|)))) (or (not (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse0)) (= .cse0 (select .cse1 |c_~#pp~0.offset|)))))) (or (forall ((v_ArrVal_2335 (Array (_ BitVec 32) (_ BitVec 32))) (|v_g_~i~2#1_67| (_ BitVec 32)) (v_f_~pointer.offset_213 (_ BitVec 32))) (not (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store .cse2 .cse3 v_f_~pointer.offset_213)) |c_~#pstate~0.base| v_ArrVal_2335) |c_~#pp~0.base|) (bvadd (bvmul (_ bv4 32) |v_g_~i~2#1_67|) |c_~#pp~0.offset|))))) (forall ((v_ArrVal_2334 (Array (_ BitVec 32) (_ BitVec 32))) (v_f_~pointer.base_213 (_ BitVec 32))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) .cse3 v_f_~pointer.base_213)) |c_~#pstate~0.base| v_ArrVal_2334) |c_~#pp~0.base|) |c_~#pp~0.offset|) |c_ULTIMATE.start_main_~a~0#1.base|))))) is different from false [2022-11-03 02:36:45,491 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:36:45,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1579398376] [2022-11-03 02:36:45,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1579398376] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:36:45,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1931241421] [2022-11-03 02:36:45,491 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:36:45,492 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:36:45,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:36:45,492 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:36:45,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (42)] Waiting until timeout for monitored process [2022-11-03 02:36:46,012 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 02:36:46,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:36:46,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 02:36:46,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:36:46,178 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 02:36:46,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:36:46,408 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 02:36:46,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1931241421] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:36:46,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203866456] [2022-11-03 02:36:46,409 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:36:46,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:36:46,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:36:46,410 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:36:46,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-11-03 02:36:47,268 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 02:36:47,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:36:47,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 02:36:47,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:36:47,301 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 02:36:47,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:36:47,328 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 02:36:47,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203866456] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:36:47,328 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-03 02:36:47,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 5, 5, 5, 5] total 25 [2022-11-03 02:36:47,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124723501] [2022-11-03 02:36:47,329 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-03 02:36:47,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-03 02:36:47,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:36:47,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-03 02:36:47,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=829, Unknown=13, NotChecked=58, Total=992 [2022-11-03 02:36:47,331 INFO L87 Difference]: Start difference. First operand 289 states and 371 transitions. Second operand has 25 states, 23 states have (on average 2.869565217391304) internal successors, (66), 19 states have internal predecessors, (66), 5 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-03 02:36:51,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:36:51,765 INFO L93 Difference]: Finished difference Result 552 states and 719 transitions. [2022-11-03 02:36:51,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-03 02:36:51,766 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.869565217391304) internal successors, (66), 19 states have internal predecessors, (66), 5 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 46 [2022-11-03 02:36:51,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:36:51,769 INFO L225 Difference]: With dead ends: 552 [2022-11-03 02:36:51,769 INFO L226 Difference]: Without dead ends: 351 [2022-11-03 02:36:51,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=284, Invalid=2324, Unknown=48, NotChecked=100, Total=2756 [2022-11-03 02:36:51,772 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 148 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:36:51,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 281 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1094 Invalid, 0 Unknown, 109 Unchecked, 2.7s Time] [2022-11-03 02:36:51,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-11-03 02:36:51,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 314. [2022-11-03 02:36:51,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 255 states have (on average 1.2156862745098038) internal successors, (310), 263 states have internal predecessors, (310), 28 states have call successors, (28), 23 states have call predecessors, (28), 30 states have return successors, (37), 27 states have call predecessors, (37), 17 states have call successors, (37) [2022-11-03 02:36:51,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 375 transitions. [2022-11-03 02:36:51,836 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 375 transitions. Word has length 46 [2022-11-03 02:36:51,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:36:51,836 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 375 transitions. [2022-11-03 02:36:51,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.869565217391304) internal successors, (66), 19 states have internal predecessors, (66), 5 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-03 02:36:51,836 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 375 transitions. [2022-11-03 02:36:51,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-03 02:36:51,837 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:36:51,838 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:36:51,878 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-11-03 02:36:52,069 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (42)] Forceful destruction successful, exit code 0 [2022-11-03 02:36:52,277 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (41)] Forceful destruction successful, exit code 0 [2022-11-03 02:36:52,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:36:52,460 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:36:52,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:36:52,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1252174545, now seen corresponding path program 4 times [2022-11-03 02:36:52,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:36:52,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [288068378] [2022-11-03 02:36:52,461 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:36:52,461 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:36:52,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:36:52,463 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:36:52,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2022-11-03 02:36:52,748 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:36:52,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:36:52,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 02:36:52,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:36:52,781 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 02:36:52,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:36:52,845 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 02:36:52,845 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:36:52,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [288068378] [2022-11-03 02:36:52,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [288068378] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:36:52,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [390518169] [2022-11-03 02:36:52,845 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:36:52,845 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:36:52,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:36:52,846 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:36:52,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (45)] Waiting until timeout for monitored process [2022-11-03 02:36:53,282 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:36:53,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:36:53,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 02:36:53,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:36:53,306 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 02:36:53,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:36:53,346 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 02:36:53,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [390518169] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:36:53,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194948884] [2022-11-03 02:36:53,347 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:36:53,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:36:53,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:36:53,348 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:36:53,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-11-03 02:36:53,584 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:36:53,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:36:53,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 02:36:53,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:36:53,604 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 02:36:53,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:36:53,638 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 02:36:53,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194948884] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:36:53,639 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:36:53,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2022-11-03 02:36:53,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093127116] [2022-11-03 02:36:53,639 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:36:53,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 02:36:53,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:36:53,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 02:36:53,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:36:53,641 INFO L87 Difference]: Start difference. First operand 314 states and 375 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-03 02:36:53,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:36:53,937 INFO L93 Difference]: Finished difference Result 446 states and 529 transitions. [2022-11-03 02:36:53,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:36:53,937 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 46 [2022-11-03 02:36:53,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:36:53,943 INFO L225 Difference]: With dead ends: 446 [2022-11-03 02:36:53,943 INFO L226 Difference]: Without dead ends: 213 [2022-11-03 02:36:53,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:36:53,946 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 12 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:36:53,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 170 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:36:53,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-11-03 02:36:53,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2022-11-03 02:36:53,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 177 states have (on average 1.1638418079096045) internal successors, (206), 177 states have internal predecessors, (206), 18 states have call successors, (18), 18 states have call predecessors, (18), 17 states have return successors, (19), 17 states have call predecessors, (19), 11 states have call successors, (19) [2022-11-03 02:36:53,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 243 transitions. [2022-11-03 02:36:53,984 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 243 transitions. Word has length 46 [2022-11-03 02:36:53,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:36:53,984 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 243 transitions. [2022-11-03 02:36:53,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-03 02:36:53,984 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 243 transitions. [2022-11-03 02:36:53,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-03 02:36:53,986 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:36:53,986 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:36:54,024 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-11-03 02:36:54,209 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (44)] Ended with exit code 0 [2022-11-03 02:36:54,404 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (45)] Forceful destruction successful, exit code 0 [2022-11-03 02:36:54,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 02:36:54,601 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:36:54,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:36:54,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1610816303, now seen corresponding path program 1 times [2022-11-03 02:36:54,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:36:54,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1803440906] [2022-11-03 02:36:54,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:36:54,602 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:36:54,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:36:54,603 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:36:54,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (47)] Waiting until timeout for monitored process [2022-11-03 02:36:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:36:54,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-03 02:36:54,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:36:55,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 16 treesize of output 16 [2022-11-03 02:36:55,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-03 02:36:55,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-11-03 02:36:55,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-03 02:36:55,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-03 02:36:55,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-11-03 02:36:55,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-11-03 02:36:56,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 19 [2022-11-03 02:36:56,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 8 [2022-11-03 02:36:56,366 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 16 refuted. 2 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:36:56,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:36:56,554 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2720 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_~#pstate~0.base| v_ArrVal_2720) |c_~#pp~0.base|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |c_g_~i~2#1|) |c_~#pp~0.offset|)) |c_g_~pointer#1.base|))) is different from false [2022-11-03 02:36:56,585 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2720 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_g_#in~pointer#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_~#pstate~0.base| v_ArrVal_2720) |c_~#pp~0.base|) (bvadd (_ bv4 32) |c_~#pp~0.offset|))))) is different from false [2022-11-03 02:36:56,600 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2720 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_~#pstate~0.base| v_ArrVal_2720) |c_~#pp~0.base|) (bvadd (_ bv4 32) |c_~#pp~0.offset|))))) is different from false [2022-11-03 02:36:56,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 48 treesize of output 36 [2022-11-03 02:36:56,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2022-11-03 02:36:58,331 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:36:58,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-11-03 02:36:58,334 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:36:58,344 INFO L356 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-11-03 02:36:58,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 22 treesize of output 13 [2022-11-03 02:36:58,548 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-11-03 02:36:58,549 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:36:58,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1803440906] [2022-11-03 02:36:58,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1803440906] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:36:58,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1552165325] [2022-11-03 02:36:58,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:36:58,549 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:36:58,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:36:58,551 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:36:58,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (48)] Waiting until timeout for monitored process [2022-11-03 02:36:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:36:59,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-03 02:36:59,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:36:59,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 16 treesize of output 16 [2022-11-03 02:36:59,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-03 02:37:00,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-11-03 02:37:00,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:37:00,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-03 02:37:00,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-03 02:37:00,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-11-03 02:37:01,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-03 02:37:01,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:37:01,327 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 16 refuted. 2 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 02:37:01,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:37:01,704 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2788 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_~#pstate~0.base| v_ArrVal_2788) |c_~#pp~0.base|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |c_g_~i~2#1|) |c_~#pp~0.offset|)) |c_g_~pointer#1.offset|))) is different from false [2022-11-03 02:37:01,734 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2788 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_~#pstate~0.base| v_ArrVal_2788) |c_~#pp~0.base|) (bvadd (_ bv4 32) |c_~#pp~0.offset|)) |c_g_#in~pointer#1.offset|))) is different from false [2022-11-03 02:37:01,744 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2788 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_~#pstate~0.base| v_ArrVal_2788) |c_~#pp~0.base|) (bvadd (_ bv4 32) |c_~#pp~0.offset|))))) is different from false [2022-11-03 02:37:01,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1552165325] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:37:01,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192328336] [2022-11-03 02:37:01,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:37:01,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:37:01,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:37:01,773 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:37:01,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-11-03 02:37:02,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:37:02,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-03 02:37:02,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:37:02,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 16 treesize of output 16 [2022-11-03 02:37:02,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-03 02:37:02,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-11-03 02:37:02,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:37:02,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-03 02:37:02,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-03 02:37:02,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-11-03 02:37:02,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-03 02:37:02,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:37:02,741 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 16 refuted. 2 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 02:37:02,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:37:02,764 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2850 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_~#pstate~0.base| v_ArrVal_2850) |c_~#pp~0.base|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |c_g_~i~2#1|) |c_~#pp~0.offset|)) |c_g_~pointer#1.offset|))) is different from false [2022-11-03 02:37:02,792 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2850 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_~#pstate~0.base| v_ArrVal_2850) |c_~#pp~0.base|) (bvadd (_ bv4 32) |c_~#pp~0.offset|)) |c_g_#in~pointer#1.offset|))) is different from false [2022-11-03 02:37:02,801 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2850 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_~#pstate~0.base| v_ArrVal_2850) |c_~#pp~0.base|) (bvadd (_ bv4 32) |c_~#pp~0.offset|))))) is different from false [2022-11-03 02:37:02,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192328336] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:37:02,824 INFO L184 FreeRefinementEngine]: Found 0 perfect and 4 imperfect interpolant sequences. [2022-11-03 02:37:02,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 18, 18] total 60 [2022-11-03 02:37:02,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845935959] [2022-11-03 02:37:02,825 INFO L85 oduleStraightlineAll]: Using 4 imperfect interpolants to construct interpolant automaton [2022-11-03 02:37:02,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-11-03 02:37:02,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:37:02,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-11-03 02:37:02,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=373, Invalid=3154, Unknown=49, NotChecked=1116, Total=4692 [2022-11-03 02:37:02,827 INFO L87 Difference]: Start difference. First operand 213 states and 243 transitions. Second operand has 60 states, 58 states have (on average 1.8620689655172413) internal successors, (108), 48 states have internal predecessors, (108), 8 states have call successors, (15), 12 states have call predecessors, (15), 12 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2022-11-03 02:37:09,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:37:09,921 INFO L93 Difference]: Finished difference Result 255 states and 286 transitions. [2022-11-03 02:37:09,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-03 02:37:09,921 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 58 states have (on average 1.8620689655172413) internal successors, (108), 48 states have internal predecessors, (108), 8 states have call successors, (15), 12 states have call predecessors, (15), 12 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) Word has length 47 [2022-11-03 02:37:09,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:37:09,923 INFO L225 Difference]: With dead ends: 255 [2022-11-03 02:37:09,923 INFO L226 Difference]: Without dead ends: 237 [2022-11-03 02:37:09,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 143 SyntacticMatches, 3 SemanticMatches, 92 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 2058 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=800, Invalid=6270, Unknown=106, NotChecked=1566, Total=8742 [2022-11-03 02:37:09,926 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 168 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 1931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 626 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:37:09,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 417 Invalid, 1931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1202 Invalid, 0 Unknown, 626 Unchecked, 4.0s Time] [2022-11-03 02:37:09,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-11-03 02:37:09,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 218. [2022-11-03 02:37:09,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 181 states have (on average 1.1546961325966851) internal successors, (209), 182 states have internal predecessors, (209), 18 states have call successors, (18), 18 states have call predecessors, (18), 18 states have return successors, (19), 17 states have call predecessors, (19), 11 states have call successors, (19) [2022-11-03 02:37:09,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 246 transitions. [2022-11-03 02:37:09,977 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 246 transitions. Word has length 47 [2022-11-03 02:37:09,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:37:09,977 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 246 transitions. [2022-11-03 02:37:09,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 58 states have (on average 1.8620689655172413) internal successors, (108), 48 states have internal predecessors, (108), 8 states have call successors, (15), 12 states have call predecessors, (15), 12 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2022-11-03 02:37:09,978 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 246 transitions. [2022-11-03 02:37:09,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-03 02:37:09,980 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:37:09,981 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:37:10,008 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-11-03 02:37:10,196 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (48)] Ended with exit code 0 [2022-11-03 02:37:10,402 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (47)] Ended with exit code 0 [2022-11-03 02:37:10,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:37:10,593 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:37:10,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:37:10,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1465782063, now seen corresponding path program 1 times [2022-11-03 02:37:10,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:37:10,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [167903780] [2022-11-03 02:37:10,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:37:10,594 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:37:10,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:37:10,595 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:37:10,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (50)] Waiting until timeout for monitored process [2022-11-03 02:37:10,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:37:10,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-03 02:37:10,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:37:10,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 16 treesize of output 16 [2022-11-03 02:37:10,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-03 02:37:10,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 16 treesize of output 16 [2022-11-03 02:37:10,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-03 02:37:11,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-11-03 02:37:11,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-11-03 02:37:11,373 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 02:37:11,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:37:11,935 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:37:11,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 25 [2022-11-03 02:37:11,946 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:37:11,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 34 [2022-11-03 02:37:11,964 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 02:37:11,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 1 [2022-11-03 02:37:12,086 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 02:37:12,086 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:37:12,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [167903780] [2022-11-03 02:37:12,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [167903780] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:37:12,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [534988584] [2022-11-03 02:37:12,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:37:12,086 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:37:12,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:37:12,087 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:37:12,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (51)] Waiting until timeout for monitored process [2022-11-03 02:37:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:37:12,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-03 02:37:12,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:37:12,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 16 treesize of output 16 [2022-11-03 02:37:12,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-03 02:37:13,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-11-03 02:37:13,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-11-03 02:37:13,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:37:13,678 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-03 02:37:13,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:37:14,711 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:37:14,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-11-03 02:37:14,724 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:37:14,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-03 02:37:14,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2022-11-03 02:37:15,041 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-03 02:37:15,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [534988584] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:37:15,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864202873] [2022-11-03 02:37:15,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:37:15,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:37:15,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:37:15,043 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:37:15,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-11-03 02:37:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:37:15,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-03 02:37:15,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:37:15,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 16 treesize of output 16 [2022-11-03 02:37:15,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-03 02:37:15,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-11-03 02:37:15,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-11-03 02:37:15,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:37:15,722 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-03 02:37:15,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:37:15,943 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:37:15,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-11-03 02:37:15,955 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:37:15,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-03 02:37:15,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2022-11-03 02:37:15,996 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-03 02:37:15,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864202873] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:37:15,996 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:37:15,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 15, 15, 15, 15] total 47 [2022-11-03 02:37:15,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090556089] [2022-11-03 02:37:15,996 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:37:15,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-03 02:37:15,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:37:15,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-03 02:37:15,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1990, Unknown=0, NotChecked=0, Total=2162 [2022-11-03 02:37:15,999 INFO L87 Difference]: Start difference. First operand 218 states and 246 transitions. Second operand has 47 states, 47 states have (on average 2.4468085106382977) internal successors, (115), 39 states have internal predecessors, (115), 7 states have call successors, (19), 12 states have call predecessors, (19), 10 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-11-03 02:37:22,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:37:22,806 INFO L93 Difference]: Finished difference Result 267 states and 300 transitions. [2022-11-03 02:37:22,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-03 02:37:22,807 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.4468085106382977) internal successors, (115), 39 states have internal predecessors, (115), 7 states have call successors, (19), 12 states have call predecessors, (19), 10 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) Word has length 50 [2022-11-03 02:37:22,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:37:22,808 INFO L225 Difference]: With dead ends: 267 [2022-11-03 02:37:22,808 INFO L226 Difference]: Without dead ends: 174 [2022-11-03 02:37:22,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1149 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=548, Invalid=4422, Unknown=0, NotChecked=0, Total=4970 [2022-11-03 02:37:22,810 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 171 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:37:22,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 120 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-11-03 02:37:22,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-11-03 02:37:22,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 164. [2022-11-03 02:37:22,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 136 states have (on average 1.1544117647058822) internal successors, (157), 136 states have internal predecessors, (157), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 13 states have call predecessors, (13), 8 states have call successors, (13) [2022-11-03 02:37:22,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 184 transitions. [2022-11-03 02:37:22,845 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 184 transitions. Word has length 50 [2022-11-03 02:37:22,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:37:22,846 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 184 transitions. [2022-11-03 02:37:22,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.4468085106382977) internal successors, (115), 39 states have internal predecessors, (115), 7 states have call successors, (19), 12 states have call predecessors, (19), 10 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-11-03 02:37:22,846 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 184 transitions. [2022-11-03 02:37:22,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-03 02:37:22,847 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:37:22,847 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:37:22,861 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (50)] Ended with exit code 0 [2022-11-03 02:37:23,064 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (51)] Forceful destruction successful, exit code 0 [2022-11-03 02:37:23,282 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2022-11-03 02:37:23,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,51 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,52 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:37:23,461 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:37:23,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:37:23,461 INFO L85 PathProgramCache]: Analyzing trace with hash -2101637850, now seen corresponding path program 1 times [2022-11-03 02:37:23,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:37:23,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [56993207] [2022-11-03 02:37:23,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:37:23,462 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:37:23,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:37:23,463 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:37:23,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (53)] Waiting until timeout for monitored process [2022-11-03 02:37:23,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:37:23,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-03 02:37:23,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:37:24,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-03 02:37:24,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:37:24,739 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 02:37:24,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:37:25,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 25 [2022-11-03 02:37:25,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-03 02:37:26,046 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-03 02:37:26,046 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:37:26,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [56993207] [2022-11-03 02:37:26,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [56993207] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:37:26,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1577685176] [2022-11-03 02:37:26,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:37:26,047 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:37:26,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:37:26,048 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:37:26,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (54)] Waiting until timeout for monitored process [2022-11-03 02:37:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:37:26,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-03 02:37:26,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:37:27,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 18 treesize of output 18 [2022-11-03 02:37:27,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2022-11-03 02:37:28,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 3 [2022-11-03 02:37:28,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 27 [2022-11-03 02:37:29,208 INFO L356 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2022-11-03 02:37:29,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 23 [2022-11-03 02:37:29,215 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 02:37:29,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:37:29,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1577685176] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:37:29,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687082978] [2022-11-03 02:37:29,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:37:29,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:37:29,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:37:29,411 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:37:29,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-11-03 02:37:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:37:29,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-03 02:37:29,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:37:30,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-03 02:37:30,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:37:30,854 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 02:37:30,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:37:30,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 25 [2022-11-03 02:37:30,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-03 02:37:31,061 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:37:31,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 20 treesize of output 18 [2022-11-03 02:37:31,585 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-03 02:37:31,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687082978] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:37:31,586 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-03 02:37:31,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 23, 17, 17] total 63 [2022-11-03 02:37:31,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973310690] [2022-11-03 02:37:31,586 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-03 02:37:31,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-11-03 02:37:31,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:37:31,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-11-03 02:37:31,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=3715, Unknown=3, NotChecked=0, Total=4032 [2022-11-03 02:37:31,589 INFO L87 Difference]: Start difference. First operand 164 states and 184 transitions. Second operand has 63 states, 55 states have (on average 2.1818181818181817) internal successors, (120), 43 states have internal predecessors, (120), 14 states have call successors, (20), 12 states have call predecessors, (20), 14 states have return successors, (17), 14 states have call predecessors, (17), 10 states have call successors, (17) [2022-11-03 02:37:35,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:37:35,547 INFO L93 Difference]: Finished difference Result 234 states and 251 transitions. [2022-11-03 02:37:35,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-03 02:37:35,547 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 55 states have (on average 2.1818181818181817) internal successors, (120), 43 states have internal predecessors, (120), 14 states have call successors, (20), 12 states have call predecessors, (20), 14 states have return successors, (17), 14 states have call predecessors, (17), 10 states have call successors, (17) Word has length 53 [2022-11-03 02:37:35,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:37:35,548 INFO L225 Difference]: With dead ends: 234 [2022-11-03 02:37:35,548 INFO L226 Difference]: Without dead ends: 160 [2022-11-03 02:37:35,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 206 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2092 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=541, Invalid=6259, Unknown=6, NotChecked=0, Total=6806 [2022-11-03 02:37:35,549 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 115 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 304 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:37:35,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 211 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 911 Invalid, 0 Unknown, 304 Unchecked, 2.4s Time] [2022-11-03 02:37:35,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-11-03 02:37:35,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 136. [2022-11-03 02:37:35,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 111 states have (on average 1.0990990990990992) internal successors, (122), 112 states have internal predecessors, (122), 12 states have call successors, (12), 12 states have call predecessors, (12), 12 states have return successors, (12), 11 states have call predecessors, (12), 8 states have call successors, (12) [2022-11-03 02:37:35,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 146 transitions. [2022-11-03 02:37:35,581 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 146 transitions. Word has length 53 [2022-11-03 02:37:35,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:37:35,581 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 146 transitions. [2022-11-03 02:37:35,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 55 states have (on average 2.1818181818181817) internal successors, (120), 43 states have internal predecessors, (120), 14 states have call successors, (20), 12 states have call predecessors, (20), 14 states have return successors, (17), 14 states have call predecessors, (17), 10 states have call successors, (17) [2022-11-03 02:37:35,582 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 146 transitions. [2022-11-03 02:37:35,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-03 02:37:35,582 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:37:35,582 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:37:35,601 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (53)] Forceful destruction successful, exit code 0 [2022-11-03 02:37:35,801 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (54)] Ended with exit code 0 [2022-11-03 02:37:36,019 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2022-11-03 02:37:36,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,54 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,55 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:37:36,198 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:37:36,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:37:36,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1841574850, now seen corresponding path program 2 times [2022-11-03 02:37:36,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:37:36,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [941807882] [2022-11-03 02:37:36,199 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 02:37:36,199 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:37:36,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:37:36,200 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:37:36,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (56)] Waiting until timeout for monitored process [2022-11-03 02:37:36,523 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 02:37:36,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:37:36,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-03 02:37:36,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:37:36,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:37:36,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:37:47,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:37:47,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 20 [2022-11-03 02:37:49,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:37:49,499 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 11 refuted. 1 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 02:37:49,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:37:49,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2022-11-03 02:37:49,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 16 [2022-11-03 02:37:49,940 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 02:37:49,940 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:37:49,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [941807882] [2022-11-03 02:37:49,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [941807882] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:37:49,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2064788339] [2022-11-03 02:37:49,941 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 02:37:49,941 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:37:49,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:37:49,942 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:37:49,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (57)] Waiting until timeout for monitored process [2022-11-03 02:37:50,524 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 02:37:50,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:37:50,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-03 02:37:50,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:37:50,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:37:51,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:37:51,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 34 treesize of output 36 [2022-11-03 02:37:51,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:37:51,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 34 treesize of output 36 [2022-11-03 02:37:51,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 26 [2022-11-03 02:37:51,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 26 [2022-11-03 02:37:51,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2022-11-03 02:37:51,224 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:37:51,474 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 02:37:51,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:37:52,167 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:37:52,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 41 [2022-11-03 02:37:52,183 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:37:52,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 41 [2022-11-03 02:37:52,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2022-11-03 02:37:52,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 18 [2022-11-03 02:37:52,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2022-11-03 02:37:52,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 18 [2022-11-03 02:37:52,936 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:37:52,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 52 [2022-11-03 02:37:52,967 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:37:52,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 48 treesize of output 52 [2022-11-03 02:37:52,973 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:37:53,483 INFO L356 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-11-03 02:37:53,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 32 treesize of output 25 [2022-11-03 02:37:53,490 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:37:53,496 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 02:37:53,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 24 treesize of output 12 [2022-11-03 02:37:53,591 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-03 02:37:53,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2064788339] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:37:53,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542497861] [2022-11-03 02:37:53,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 02:37:53,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:37:53,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:37:53,594 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:37:53,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-11-03 02:37:53,907 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 02:37:53,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:37:53,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-03 02:37:53,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:37:53,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:37:53,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:38:04,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:38:04,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 20 [2022-11-03 02:38:04,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:38:04,106 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 11 refuted. 1 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 02:38:04,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:38:04,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2022-11-03 02:38:04,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 16 [2022-11-03 02:38:04,371 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 02:38:04,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542497861] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:38:04,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:38:04,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 13, 13, 10, 9] total 40 [2022-11-03 02:38:04,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576291137] [2022-11-03 02:38:04,372 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:38:04,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-03 02:38:04,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:38:04,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-03 02:38:04,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1383, Unknown=7, NotChecked=0, Total=1560 [2022-11-03 02:38:04,374 INFO L87 Difference]: Start difference. First operand 136 states and 146 transitions. Second operand has 40 states, 38 states have (on average 3.5526315789473686) internal successors, (135), 35 states have internal predecessors, (135), 9 states have call successors, (23), 10 states have call predecessors, (23), 12 states have return successors, (20), 9 states have call predecessors, (20), 9 states have call successors, (20) [2022-11-03 02:39:58,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:39:58,910 INFO L93 Difference]: Finished difference Result 163 states and 169 transitions. [2022-11-03 02:39:58,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-03 02:39:58,910 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 38 states have (on average 3.5526315789473686) internal successors, (135), 35 states have internal predecessors, (135), 9 states have call successors, (23), 10 states have call predecessors, (23), 12 states have return successors, (20), 9 states have call predecessors, (20), 9 states have call successors, (20) Word has length 53 [2022-11-03 02:39:58,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:39:58,911 INFO L225 Difference]: With dead ends: 163 [2022-11-03 02:39:58,911 INFO L226 Difference]: Without dead ends: 117 [2022-11-03 02:39:58,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 292 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1269 ImplicationChecksByTransitivity, 135.4s TimeCoverageRelationStatistics Valid=811, Invalid=4385, Unknown=60, NotChecked=0, Total=5256 [2022-11-03 02:39:58,912 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 194 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 260 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:39:58,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 684 Invalid, 1165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 804 Invalid, 0 Unknown, 260 Unchecked, 3.5s Time] [2022-11-03 02:39:58,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-03 02:39:58,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 100. [2022-11-03 02:39:58,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 80 states have (on average 1.0625) internal successors, (85), 80 states have internal predecessors, (85), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2022-11-03 02:39:58,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2022-11-03 02:39:58,947 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 53 [2022-11-03 02:39:58,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:39:58,947 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2022-11-03 02:39:58,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 38 states have (on average 3.5526315789473686) internal successors, (135), 35 states have internal predecessors, (135), 9 states have call successors, (23), 10 states have call predecessors, (23), 12 states have return successors, (20), 9 states have call predecessors, (20), 9 states have call successors, (20) [2022-11-03 02:39:58,948 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2022-11-03 02:39:58,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-03 02:39:58,948 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:39:58,949 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:39:58,969 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (56)] Forceful destruction successful, exit code 0 [2022-11-03 02:39:59,204 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-11-03 02:39:59,369 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (57)] Forceful destruction successful, exit code 0 [2022-11-03 02:39:59,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,58 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,57 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 02:39:59,565 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:39:59,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:39:59,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1185597682, now seen corresponding path program 1 times [2022-11-03 02:39:59,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:39:59,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1823570257] [2022-11-03 02:39:59,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:39:59,566 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:39:59,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:39:59,567 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:39:59,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (59)] Waiting until timeout for monitored process [2022-11-03 02:39:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:39:59,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-03 02:39:59,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:40:00,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 16 treesize of output 16 [2022-11-03 02:40:00,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-03 02:40:00,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 16 treesize of output 16 [2022-11-03 02:40:00,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-03 02:40:00,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-11-03 02:40:00,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-11-03 02:40:00,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-11-03 02:40:00,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-11-03 02:40:01,384 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:40:01,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:40:02,750 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:40:02,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 23 [2022-11-03 02:40:02,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-11-03 02:40:02,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:40:02,767 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 02:40:02,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2022-11-03 02:40:02,950 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:40:02,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-11-03 02:40:02,954 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:40:02,968 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:40:02,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 22 treesize of output 18 [2022-11-03 02:40:02,989 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:40:02,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-11-03 02:40:02,992 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:40:03,005 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 02:40:03,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 22 treesize of output 12 [2022-11-03 02:40:03,339 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-03 02:40:03,340 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:40:03,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1823570257] [2022-11-03 02:40:03,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1823570257] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:40:03,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1479732517] [2022-11-03 02:40:03,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:40:03,340 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:40:03,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:40:03,341 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:40:03,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (60)] Waiting until timeout for monitored process [2022-11-03 02:40:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:40:03,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-03 02:40:03,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:40:04,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 16 treesize of output 16 [2022-11-03 02:40:04,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-03 02:40:04,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 16 treesize of output 16 [2022-11-03 02:40:04,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-03 02:40:04,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-11-03 02:40:04,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-11-03 02:40:04,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-11-03 02:40:04,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-11-03 02:40:04,847 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:40:04,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:40:05,589 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:40:05,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 23 [2022-11-03 02:40:05,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-11-03 02:40:05,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:40:05,605 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 02:40:05,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2022-11-03 02:40:05,654 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:40:05,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-11-03 02:40:05,657 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:40:05,671 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:40:05,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 22 treesize of output 18 [2022-11-03 02:40:05,693 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:40:05,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-11-03 02:40:05,722 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:40:05,737 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 02:40:05,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 22 treesize of output 12 [2022-11-03 02:40:05,918 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-03 02:40:05,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1479732517] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:40:05,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188979516] [2022-11-03 02:40:05,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:40:05,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:40:05,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:40:05,921 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:40:05,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-11-03 02:40:06,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:40:06,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-03 02:40:06,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:40:06,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 16 treesize of output 16 [2022-11-03 02:40:06,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-03 02:40:06,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 16 treesize of output 16 [2022-11-03 02:40:06,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-03 02:40:07,117 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-03 02:40:07,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:40:07,947 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:40:07,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 23 [2022-11-03 02:40:07,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 [2022-11-03 02:40:07,960 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 02:40:07,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2022-11-03 02:40:08,004 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:40:08,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-11-03 02:40:08,006 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:40:08,019 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:40:08,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 22 treesize of output 18 [2022-11-03 02:40:08,037 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:40:08,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-11-03 02:40:08,040 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:40:08,052 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 02:40:08,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 22 treesize of output 12 [2022-11-03 02:40:08,156 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-03 02:40:08,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188979516] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:40:08,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:40:08,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 17, 13, 11, 13] total 30 [2022-11-03 02:40:08,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847113243] [2022-11-03 02:40:08,158 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:40:08,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-03 02:40:08,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:40:08,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-03 02:40:08,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=761, Unknown=0, NotChecked=0, Total=870 [2022-11-03 02:40:08,159 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand has 30 states, 27 states have (on average 3.111111111111111) internal successors, (84), 24 states have internal predecessors, (84), 8 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (15), 8 states have call predecessors, (15), 7 states have call successors, (15) [2022-11-03 02:40:13,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:40:13,026 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2022-11-03 02:40:13,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-03 02:40:13,027 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 3.111111111111111) internal successors, (84), 24 states have internal predecessors, (84), 8 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (15), 8 states have call predecessors, (15), 7 states have call successors, (15) Word has length 56 [2022-11-03 02:40:13,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:40:13,027 INFO L225 Difference]: With dead ends: 113 [2022-11-03 02:40:13,027 INFO L226 Difference]: Without dead ends: 102 [2022-11-03 02:40:13,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=307, Invalid=1855, Unknown=0, NotChecked=0, Total=2162 [2022-11-03 02:40:13,029 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 111 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:40:13,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 88 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-11-03 02:40:13,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-03 02:40:13,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 94. [2022-11-03 02:40:13,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 76 states have internal predecessors, (80), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-03 02:40:13,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2022-11-03 02:40:13,063 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 56 [2022-11-03 02:40:13,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:40:13,064 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2022-11-03 02:40:13,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 3.111111111111111) internal successors, (84), 24 states have internal predecessors, (84), 8 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (15), 8 states have call predecessors, (15), 7 states have call successors, (15) [2022-11-03 02:40:13,064 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-11-03 02:40:13,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-03 02:40:13,065 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:40:13,065 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:40:13,086 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (59)] Forceful destruction successful, exit code 0 [2022-11-03 02:40:13,325 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2022-11-03 02:40:13,486 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (60)] Ended with exit code 0 [2022-11-03 02:40:13,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,61 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,60 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 02:40:13,681 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:40:13,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:40:13,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1289824473, now seen corresponding path program 3 times [2022-11-03 02:40:13,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:40:13,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [819584524] [2022-11-03 02:40:13,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:40:13,683 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:40:13,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:40:13,683 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:40:13,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (62)] Waiting until timeout for monitored process [2022-11-03 02:40:14,163 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-03 02:40:14,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:40:14,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-03 02:40:14,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:40:14,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 16 treesize of output 16 [2022-11-03 02:40:14,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-03 02:40:15,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-11-03 02:40:15,751 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-03 02:40:15,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:40:15,865 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3720 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_~#pstate~0.base| v_ArrVal_3720) |c_~#pp~0.base|) (bvadd (_ bv4 32) |c_~#pp~0.offset|))))) is different from false [2022-11-03 02:40:15,868 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:40:15,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [819584524] [2022-11-03 02:40:15,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [819584524] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:40:15,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [247499599] [2022-11-03 02:40:15,868 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:40:15,868 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:40:15,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:40:15,869 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:40:15,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (63)] Waiting until timeout for monitored process [2022-11-03 02:40:16,700 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-03 02:40:16,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:40:16,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-03 02:40:16,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:40:17,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 16 treesize of output 16 [2022-11-03 02:40:17,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-03 02:40:17,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-11-03 02:40:17,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-03 02:40:17,927 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-03 02:40:17,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:40:18,455 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_~#pp~0.offset|))) (or (forall ((v_ArrVal_3807 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_main_~b~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_~#pstate~0.base| v_ArrVal_3807) |c_~#pp~0.base|) .cse0)))) (forall ((v_ArrVal_3808 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_~#pstate~0.base| v_ArrVal_3808) |c_~#pp~0.base|) .cse0)))))) is different from false [2022-11-03 02:40:18,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [247499599] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:40:18,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200092243] [2022-11-03 02:40:18,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:40:18,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:40:18,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:40:18,461 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:40:18,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-11-03 02:40:23,985 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-03 02:40:23,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:40:23,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-03 02:40:23,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:40:24,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-03 02:40:25,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:40:25,459 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-03 02:40:25,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:40:25,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2022-11-03 02:40:25,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:40:26,014 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:40:26,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 22 treesize of output 18 [2022-11-03 02:40:27,099 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-03 02:40:27,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200092243] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:40:27,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 4 imperfect interpolant sequences. [2022-11-03 02:40:27,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 19, 19] total 50 [2022-11-03 02:40:27,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019370801] [2022-11-03 02:40:27,100 INFO L85 oduleStraightlineAll]: Using 4 imperfect interpolants to construct interpolant automaton [2022-11-03 02:40:27,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-03 02:40:27,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:40:27,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-03 02:40:27,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2258, Unknown=5, NotChecked=194, Total=2652 [2022-11-03 02:40:27,102 INFO L87 Difference]: Start difference. First operand 94 states and 97 transitions. Second operand has 50 states, 44 states have (on average 2.5) internal successors, (110), 37 states have internal predecessors, (110), 11 states have call successors, (15), 8 states have call predecessors, (15), 11 states have return successors, (14), 11 states have call predecessors, (14), 8 states have call successors, (14) [2022-11-03 02:40:34,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:40:34,698 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2022-11-03 02:40:34,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-03 02:40:34,698 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 44 states have (on average 2.5) internal successors, (110), 37 states have internal predecessors, (110), 11 states have call successors, (15), 8 states have call predecessors, (15), 11 states have return successors, (14), 11 states have call predecessors, (14), 8 states have call successors, (14) Word has length 58 [2022-11-03 02:40:34,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:40:34,699 INFO L225 Difference]: With dead ends: 102 [2022-11-03 02:40:34,699 INFO L226 Difference]: Without dead ends: 59 [2022-11-03 02:40:34,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 194 SyntacticMatches, 5 SemanticMatches, 77 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1229 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=502, Invalid=5334, Unknown=24, NotChecked=302, Total=6162 [2022-11-03 02:40:34,700 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 133 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 1529 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 1814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 184 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-11-03 02:40:34,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 154 Invalid, 1814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1529 Invalid, 0 Unknown, 184 Unchecked, 4.8s Time] [2022-11-03 02:40:34,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-03 02:40:34,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-11-03 02:40:34,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-03 02:40:34,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2022-11-03 02:40:34,717 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 58 [2022-11-03 02:40:34,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:40:34,717 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2022-11-03 02:40:34,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 44 states have (on average 2.5) internal successors, (110), 37 states have internal predecessors, (110), 11 states have call successors, (15), 8 states have call predecessors, (15), 11 states have return successors, (14), 11 states have call predecessors, (14), 8 states have call successors, (14) [2022-11-03 02:40:34,718 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-11-03 02:40:34,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-03 02:40:34,718 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:40:34,719 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:40:34,724 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (63)] Ended with exit code 0 [2022-11-03 02:40:34,951 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Ended with exit code 0 [2022-11-03 02:40:35,130 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (62)] Ended with exit code 0 [2022-11-03 02:40:35,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,64 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,62 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:40:35,321 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:40:35,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:40:35,321 INFO L85 PathProgramCache]: Analyzing trace with hash 414775917, now seen corresponding path program 1 times [2022-11-03 02:40:35,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:40:35,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1145555574] [2022-11-03 02:40:35,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:40:35,322 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:40:35,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:40:35,323 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:40:35,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (65)] Waiting until timeout for monitored process [2022-11-03 02:40:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:40:35,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-03 02:40:35,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:40:35,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 18 treesize of output 18 [2022-11-03 02:40:35,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2022-11-03 02:40:35,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:40:35,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-03 02:40:35,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 23 [2022-11-03 02:40:36,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:40:36,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 7 [2022-11-03 02:40:36,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:40:36,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 33 treesize of output 29 [2022-11-03 02:40:36,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-03 02:40:36,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:40:37,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2022-11-03 02:40:37,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:40:37,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:40:37,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:40:37,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 8 [2022-11-03 02:40:37,538 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 5 proven. 29 refuted. 2 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 02:40:37,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:40:37,751 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3960 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_main_~b~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_~#pstate~0.base| v_ArrVal_3960) |c_~#pp~0.base|) |c_~#pp~0.offset|)))) is different from false [2022-11-03 02:40:37,753 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:40:37,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1145555574] [2022-11-03 02:40:37,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1145555574] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:40:37,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [611397997] [2022-11-03 02:40:37,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:40:37,754 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:40:37,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:40:37,754 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:40:37,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (66)] Waiting until timeout for monitored process [2022-11-03 02:40:38,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:40:38,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 02:40:38,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:40:38,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 18 treesize of output 18 [2022-11-03 02:40:38,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2022-11-03 02:40:38,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:40:38,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-03 02:40:38,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-03 02:40:39,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:40:39,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:40:39,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-03 02:40:39,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-03 02:40:39,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:40:40,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:40:40,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-03 02:40:40,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:40:40,596 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 29 refuted. 2 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-03 02:40:40,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:40:40,949 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4027 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_main_~b~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_~#pstate~0.base| v_ArrVal_4027) |c_~#pp~0.base|) |c_~#pp~0.offset|)))) is different from false [2022-11-03 02:40:40,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [611397997] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:40:40,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919343313] [2022-11-03 02:40:40,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:40:40,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:40:40,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:40:40,952 INFO L229 MonitoredProcess]: Starting monitored process 67 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:40:40,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-11-03 02:40:41,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:40:41,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-03 02:40:41,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:40:41,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 18 treesize of output 18 [2022-11-03 02:40:41,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2022-11-03 02:40:41,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:40:41,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-03 02:40:41,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 23 [2022-11-03 02:40:42,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:40:42,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 7 [2022-11-03 02:40:42,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:40:42,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 33 treesize of output 29 [2022-11-03 02:40:42,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-03 02:40:42,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:40:43,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:40:43,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-03 02:40:43,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:40:43,467 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 29 refuted. 2 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-03 02:40:43,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:40:43,522 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4096 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_main_~b~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_~#pstate~0.base| v_ArrVal_4096) |c_~#pp~0.base|) |c_~#pp~0.offset|)))) is different from false [2022-11-03 02:40:43,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919343313] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:40:43,524 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:40:43,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21, 22] total 48 [2022-11-03 02:40:43,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923210060] [2022-11-03 02:40:43,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:40:43,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-03 02:40:43,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:40:43,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-03 02:40:43,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=2872, Unknown=117, NotChecked=336, Total=3540 [2022-11-03 02:40:43,526 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand has 49 states, 45 states have (on average 2.0) internal successors, (90), 36 states have internal predecessors, (90), 12 states have call successors, (15), 8 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) [2022-11-03 02:40:50,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:40:50,820 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-11-03 02:40:50,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-03 02:40:50,821 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 45 states have (on average 2.0) internal successors, (90), 36 states have internal predecessors, (90), 12 states have call successors, (15), 8 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) Word has length 58 [2022-11-03 02:40:50,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:40:50,821 INFO L225 Difference]: With dead ends: 60 [2022-11-03 02:40:50,821 INFO L226 Difference]: Without dead ends: 0 [2022-11-03 02:40:50,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 130 SyntacticMatches, 4 SemanticMatches, 85 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1963 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=512, Invalid=6258, Unknown=214, NotChecked=498, Total=7482 [2022-11-03 02:40:50,823 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 69 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 243 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:40:50,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 138 Invalid, 1351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1043 Invalid, 0 Unknown, 243 Unchecked, 4.5s Time] [2022-11-03 02:40:50,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-03 02:40:50,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-03 02:40:50,824 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-03 02:40:50,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-03 02:40:50,824 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2022-11-03 02:40:50,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:40:50,825 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-03 02:40:50,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 45 states have (on average 2.0) internal successors, (90), 36 states have internal predecessors, (90), 12 states have call successors, (15), 8 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) [2022-11-03 02:40:50,825 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-03 02:40:50,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-03 02:40:50,828 INFO L805 garLoopResultBuilder]: Registering result SAFE for location gErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-03 02:40:50,838 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (66)] Forceful destruction successful, exit code 0 [2022-11-03 02:40:51,052 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Forceful destruction successful, exit code 0 [2022-11-03 02:40:51,238 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (65)] Ended with exit code 0 [2022-11-03 02:40:51,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,67 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,65 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:40:51,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-03 02:42:09,801 WARN L234 SmtUtils]: Spent 1.29m on a formula simplification. DAG size of input: 187 DAG size of output: 187 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-03 02:42:26,774 WARN L234 SmtUtils]: Spent 10.05s on a formula simplification. DAG size of input: 124 DAG size of output: 91 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-03 02:43:34,949 WARN L234 SmtUtils]: Spent 1.13m on a formula simplification. DAG size of input: 321 DAG size of output: 164 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-03 02:43:35,198 INFO L899 garLoopResultBuilder]: For program point L28(lines 28 32) no Hoare annotation was computed. [2022-11-03 02:43:35,198 INFO L899 garLoopResultBuilder]: For program point L27-2(lines 27 33) no Hoare annotation was computed. [2022-11-03 02:43:35,199 INFO L895 garLoopResultBuilder]: At program point L27-3(lines 27 33) the Hoare annotation is: (let ((.cse19 (bvadd |~#pp~0.offset| (_ bv4 32))) (.cse20 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (let ((.cse12 (= f_~i~1 (_ bv1 32))) (.cse8 (select .cse20 |~#pp~0.offset|)) (.cse11 (= f_~pointer.offset |f_#in~pointer.offset|)) (.cse13 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse14 (= f_~pointer.base |f_#in~pointer.base|)) (.cse15 (= |old(#memory_int)| |#memory_int|)) (.cse16 (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (.cse17 (select .cse20 .cse19)) (.cse18 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|))) (let ((.cse4 (not (= (select .cse18 .cse19) (_ bv0 32)))) (.cse6 (not (= .cse17 (_ bv0 32)))) (.cse0 (not (= (_ bv0 32) |~#pstate~0.offset|))) (.cse1 (not (= |~#pp~0.offset| (_ bv0 32)))) (.cse2 (and .cse11 (= f_~i~1 (_ bv0 32)) .cse13 .cse14 .cse15 .cse16)) (.cse10 (not (= .cse8 (_ bv0 32)))) (.cse5 (not (= (_ bv4 32) |~#pp~0.base|))) (.cse3 (select |old(#memory_int)| |~#pstate~0.base|)) (.cse7 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16)) (.cse9 (not (= |~#pstate~0.base| (_ bv5 32))))) (and (or .cse0 .cse1 .cse2 (not (= (_ bv1 32) (select .cse3 |~#pstate~0.offset|))) .cse4 .cse5 .cse6 .cse7 (not (= .cse8 (_ bv1 32))) .cse9) (or .cse0 .cse1 .cse2 .cse10 .cse4 .cse5 .cse6 (and .cse11 .cse12 .cse13 (not (= (select (select |#memory_$Pointer$.base| |~#pp~0.base|) (bvadd |~#pp~0.offset| (_ bv4294967292 32) (bvmul (_ bv4 32) f_~i~1))) (_ bv0 32))) .cse14 .cse15 .cse16) .cse9) (or .cse0 .cse1 (not (= (_ bv1 32) .cse17)) .cse2 .cse10 (and .cse11 (= (_ bv2 32) f_~i~1) .cse13 .cse15 .cse16) .cse5 (not (= (select .cse3 (bvadd (_ bv4 32) |~#pstate~0.offset|)) (_ bv1 32))) .cse7 (= (_ bv0 32) (select .cse18 |~#pp~0.offset|)) .cse9))))) [2022-11-03 02:43:35,199 INFO L899 garLoopResultBuilder]: For program point L27-4(lines 25 34) no Hoare annotation was computed. [2022-11-03 02:43:35,199 INFO L899 garLoopResultBuilder]: For program point fEXIT(lines 25 34) no Hoare annotation was computed. [2022-11-03 02:43:35,199 INFO L895 garLoopResultBuilder]: At program point fENTRY(lines 25 34) the Hoare annotation is: (let ((.cse13 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse12 (bvadd |~#pp~0.offset| (_ bv4 32)))) (let ((.cse9 (select .cse13 .cse12)) (.cse11 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse7 (select .cse13 |~#pp~0.offset|))) (let ((.cse2 (select |old(#memory_int)| |~#pstate~0.base|)) (.cse0 (not (= (_ bv0 32) |~#pstate~0.offset|))) (.cse1 (not (= |~#pp~0.offset| (_ bv0 32)))) (.cse10 (not (= .cse7 (_ bv0 32)))) (.cse3 (not (= (select .cse11 .cse12) (_ bv0 32)))) (.cse4 (not (= (_ bv4 32) |~#pp~0.base|))) (.cse5 (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_int)| |#memory_int|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (.cse6 (not (= .cse9 (_ bv0 32)))) (.cse8 (not (= |~#pstate~0.base| (_ bv5 32))))) (and (or .cse0 .cse1 (not (= (_ bv1 32) (select .cse2 |~#pstate~0.offset|))) .cse3 .cse4 .cse5 .cse6 (not (= .cse7 (_ bv1 32))) .cse8) (or .cse0 .cse1 (not (= (_ bv1 32) .cse9)) .cse10 .cse4 .cse5 (not (= (select .cse2 (bvadd (_ bv4 32) |~#pstate~0.offset|)) (_ bv1 32))) (= (_ bv0 32) (select .cse11 |~#pp~0.offset|)) .cse8) (or .cse0 .cse1 .cse10 .cse3 .cse4 .cse5 .cse6 .cse8))))) [2022-11-03 02:43:35,200 INFO L899 garLoopResultBuilder]: For program point L38-2(lines 38 44) no Hoare annotation was computed. [2022-11-03 02:43:35,201 INFO L895 garLoopResultBuilder]: At program point L38-3(lines 38 44) the Hoare annotation is: (let ((.cse51 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse43 (bvadd |~#pp~0.offset| (_ bv4 32)))) (let ((.cse49 (select .cse51 .cse43)) (.cse15 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse42 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|))) (let ((.cse52 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse39 (select .cse42 |~#pp~0.offset|)) (.cse14 (select .cse15 |~#pp~0.offset|)) (.cse40 (select .cse51 |~#pp~0.offset|)) (.cse44 (select |#memory_int| |~#pstate~0.base|)) (.cse26 (bvadd (_ bv4 32) |~#pstate~0.offset|)) (.cse53 (select .cse15 .cse43)) (.cse36 (= .cse49 (_ bv0 32)))) (let ((.cse9 (or (not (= (_ bv0 32) .cse53)) .cse36)) (.cse29 (= |g_#in~pointer#1.offset| |g_~pointer#1.offset|)) (.cse5 (= |g_~i~2#1| (_ bv1 32))) (.cse7 (= (select .cse44 .cse26) (_ bv1 32))) (.cse6 (= |~#pp~0.offset| (_ bv0 32))) (.cse8 (= (_ bv4 32) |~#pp~0.base|)) (.cse50 (= (_ bv1 32) .cse53)) (.cse10 (= (_ bv0 32) |~#pstate~0.offset|)) (.cse11 (= .cse14 .cse40)) (.cse24 (= (_ bv2 32) |g_~i~2#1|)) (.cse12 (= (select .cse52 |~#pp~0.offset|) .cse39)) (.cse25 (select |old(#memory_int)| |~#pstate~0.base|))) (let ((.cse27 (not (= |g_#in~pointer#1.offset| (_ bv1 32)))) (.cse31 (select .cse52 .cse43)) (.cse33 (= |g_~pointer#1.offset| (_ bv1 32))) (.cse34 (= |g_#in~pointer#1.offset| .cse49)) (.cse37 (not (= (_ bv1 32) (select .cse25 |~#pstate~0.offset|)))) (.cse45 (and .cse6 .cse8 .cse50 .cse10 .cse11 .cse24 .cse12)) (.cse3 (not (= |g_#in~pointer#1.offset| (bvadd .cse40 (_ bv1 32))))) (.cse4 (forall ((f_~i~1 (_ BitVec 32))) (not (= |g_#in~pointer#1.offset| (select .cse51 (bvadd |~#pp~0.offset| (bvmul (_ bv4 32) f_~i~1))))))) (.cse47 (and .cse5 .cse6 .cse7 .cse8 .cse50 .cse10 .cse11 .cse12)) (.cse21 (not (= (select .cse25 .cse26) (_ bv1 32)))) (.cse18 (or (= |~#pstate~0.base| |~#pp~0.base|) .cse29)) (.cse0 (not .cse10)) (.cse1 (and .cse9 .cse11 .cse24 .cse12)) (.cse2 (not .cse6)) (.cse46 (not (= (_ bv1 32) .cse49))) (.cse30 (not (= .cse40 (_ bv0 32)))) (.cse20 (not .cse8)) (.cse13 (= |g_~i~2#1| (_ bv0 32))) (.cse38 (= (_ bv0 32) |g_~pointer#1.base|)) (.cse17 (= |old(#memory_int)| |#memory_int|)) (.cse22 (not (= |g_#in~pointer#1.offset| (_ bv2 32)))) (.cse32 (= (_ bv0 32) .cse39)) (.cse16 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse19 (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (.cse41 (not (= |g_#in~pointer#1.base| (_ bv0 32)))) (.cse23 (not (= |~#pstate~0.base| (_ bv5 32))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse6 .cse8 .cse13 (exists ((f_~i~1 (_ BitVec 32))) (= (bvadd .cse14 (_ bv1 32)) (select .cse15 (bvadd |~#pp~0.offset| (bvmul (_ bv4 32) f_~i~1))))) .cse16 .cse10 .cse17 .cse18 .cse19) .cse20 .cse21 .cse22 .cse23) (let ((.cse28 (= |g_#in~pointer#1.base| |g_~pointer#1.base|))) (or (and (exists ((v_ArrVal_3957 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.base)| |~#pstate~0.base| v_ArrVal_3957) |#memory_$Pointer$.base|)) (exists ((v_ArrVal_4024 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.offset)| |~#pstate~0.base| v_ArrVal_4024) |#memory_$Pointer$.offset|)) .cse24 (exists ((v_ArrVal_3260 (_ BitVec 32))) (= |#memory_int| (store |old(#memory_int)| |~#pstate~0.base| (store .cse25 .cse26 v_ArrVal_3260))))) .cse0 .cse27 (and .cse5 .cse6 .cse7 .cse8 .cse28 .cse29 .cse9 .cse16 .cse10 .cse17 .cse11 .cse12 .cse19) .cse2 .cse30 (and (not (= |g_#in~pointer#1.base| .cse31)) .cse16 .cse17 .cse24 .cse19) .cse20 .cse21 .cse32 (and .cse6 .cse8 .cse28 .cse13 .cse16 .cse10 .cse17 .cse33 .cse19) (not .cse34) .cse23)) (let ((.cse35 (select .cse42 .cse43))) (or (and .cse7 (exists ((v_ArrVal_3110 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.offset)| |~#pstate~0.base| v_ArrVal_3110) |#memory_$Pointer$.offset|)) (or (= .cse31 (_ bv0 32)) (not (= .cse35 (_ bv0 32))) (not .cse36)) .cse24 .cse12) .cse0 .cse27 .cse2 (and .cse5 (= .cse35 .cse31) .cse7 .cse29 (exists ((v_ArrVal_3717 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.offset)| |~#pstate~0.base| v_ArrVal_3717) |#memory_$Pointer$.offset|)) .cse12) .cse37 .cse20 (and .cse13 .cse16 .cse38 .cse17 .cse33 .cse19) .cse21 .cse34 (not (= |g_#in~pointer#1.base| .cse39)) (not (= .cse40 (_ bv1 32))) .cse41 .cse23)) (or .cse0 (and .cse7 (= (select .cse44 |~#pstate~0.offset|) (_ bv1 32)) .cse13 .cse16 .cse19) .cse2 .cse45 .cse46 .cse37 .cse47 .cse20 .cse21 .cse23) (or .cse0 .cse2 .cse45 .cse46 .cse3 .cse4 .cse47 .cse20 .cse21 .cse22 (and .cse6 .cse7 .cse8 .cse13 .cse16 .cse10 .cse18 .cse19) .cse23) (let ((.cse48 (= (_ bv2 32) |g_~pointer#1.offset|))) (or .cse0 .cse1 .cse2 .cse46 .cse30 .cse20 (and .cse13 .cse16 .cse38 .cse17 .cse19 .cse48) .cse22 .cse32 (and .cse5 .cse6 .cse8 .cse16 .cse10 .cse19 .cse48) .cse41 .cse23)))))))) [2022-11-03 02:43:35,202 INFO L899 garLoopResultBuilder]: For program point L38-4(lines 36 45) no Hoare annotation was computed. [2022-11-03 02:43:35,202 INFO L899 garLoopResultBuilder]: For program point gErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2022-11-03 02:43:35,202 INFO L899 garLoopResultBuilder]: For program point L41(line 41) no Hoare annotation was computed. [2022-11-03 02:43:35,203 INFO L899 garLoopResultBuilder]: For program point gEXIT(lines 36 45) no Hoare annotation was computed. [2022-11-03 02:43:35,203 INFO L899 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2022-11-03 02:43:35,203 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 43) no Hoare annotation was computed. [2022-11-03 02:43:35,203 INFO L899 garLoopResultBuilder]: For program point L41-2(line 41) no Hoare annotation was computed. [2022-11-03 02:43:35,203 INFO L899 garLoopResultBuilder]: For program point L6(lines 6 9) no Hoare annotation was computed. [2022-11-03 02:43:35,204 INFO L895 garLoopResultBuilder]: At program point gENTRY(lines 36 45) the Hoare annotation is: (let ((.cse25 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (let ((.cse14 (bvadd (_ bv4 32) |~#pstate~0.offset|)) (.cse15 (= (_ bv4 32) |~#pp~0.base|)) (.cse12 (= |~#pp~0.offset| (_ bv0 32))) (.cse18 (= (_ bv0 32) |~#pstate~0.offset|)) (.cse13 (select |#memory_int| |~#pstate~0.base|)) (.cse26 (select |old(#memory_int)| |~#pstate~0.base|)) (.cse22 (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) |~#pp~0.offset|)) (.cse17 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse24 (= |old(#memory_int)| |#memory_int|)) (.cse19 (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (.cse23 (select .cse25 |~#pp~0.offset|)) (.cse27 (select .cse25 (bvadd |~#pp~0.offset| (_ bv4 32))))) (let ((.cse10 (not (= (_ bv1 32) .cse27))) (.cse3 (not (= .cse23 (_ bv0 32)))) (.cse5 (and .cse17 .cse24 .cse19)) (.cse7 (= (_ bv0 32) .cse22)) (.cse1 (not (= |g_#in~pointer#1.offset| (_ bv1 32)))) (.cse11 (not (= (_ bv1 32) (select .cse26 |~#pstate~0.offset|)))) (.cse8 (= |g_#in~pointer#1.offset| .cse27)) (.cse21 (not (= |g_#in~pointer#1.base| (_ bv0 32)))) (.cse16 (= (select .cse13 |~#pstate~0.offset|) (_ bv1 32))) (.cse0 (not .cse18)) (.cse2 (not .cse12)) (.cse4 (not .cse15)) (.cse6 (not (= (select .cse26 .cse14) (_ bv1 32)))) (.cse20 (not (= |g_#in~pointer#1.offset| (_ bv2 32)))) (.cse9 (not (= |~#pstate~0.base| (_ bv5 32))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not .cse8) .cse9) (or .cse0 .cse2 .cse10 .cse11 .cse4 .cse6 (and .cse12 (= (select .cse13 .cse14) (_ bv1 32)) .cse15 .cse16 .cse17 .cse18 .cse19) .cse9) (or .cse0 .cse2 .cse10 .cse3 .cse4 .cse5 .cse20 .cse7 .cse21 .cse9) (or .cse0 .cse1 .cse2 .cse11 .cse4 .cse6 .cse8 (not (= |g_#in~pointer#1.base| .cse22)) (not (= .cse23 (_ bv1 32))) .cse21 (and .cse12 .cse15 .cse16 .cse17 .cse18 .cse24 .cse19) .cse9) (or .cse0 .cse2 (and .cse17 (exists ((f_~i~1 (_ BitVec 32))) (= |g_#in~pointer#1.offset| (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) (bvadd |~#pp~0.offset| (bvmul (_ bv4 32) f_~i~1))))) .cse24 .cse19) (not (= |g_#in~pointer#1.offset| (bvadd .cse23 (_ bv1 32)))) (forall ((f_~i~1 (_ BitVec 32))) (not (= |g_#in~pointer#1.offset| (select .cse25 (bvadd |~#pp~0.offset| (bvmul (_ bv4 32) f_~i~1)))))) .cse4 .cse6 .cse20 .cse9))))) [2022-11-03 02:43:35,204 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-03 02:43:35,205 INFO L895 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: (let ((.cse5 (select |#memory_int| |~#pstate~0.base|)) (.cse13 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse11 (bvadd |~#pp~0.offset| (_ bv4 32)))) (let ((.cse4 (= (_ bv1 32) (select .cse13 .cse11))) (.cse0 (= |~#pp~0.offset| (_ bv0 32))) (.cse1 (= |ULTIMATE.start_main_~a~0#1.base| (_ bv0 32))) (.cse2 (= (select .cse5 (bvadd (_ bv4 32) |~#pstate~0.offset|)) (_ bv1 32))) (.cse3 (= (_ bv4 32) |~#pp~0.base|)) (.cse10 (select .cse13 |~#pp~0.offset|)) (.cse6 (= |~#pstate~0.base| (_ bv5 32))) (.cse7 (= |ULTIMATE.start_main_~a~0#1.offset| (_ bv1 32))) (.cse8 (= (_ bv0 32) |~#pstate~0.offset|)) (.cse12 (= (_ bv2 32) |ULTIMATE.start_main_~b~0#1.offset|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (select .cse5 |~#pstate~0.offset|) (_ bv1 32)) .cse6 .cse7 .cse8) (let ((.cse9 (select |#memory_$Pointer$.base| |~#pp~0.base|))) (and (not (= (select .cse9 |~#pp~0.offset|) (_ bv0 32))) .cse0 .cse1 .cse3 .cse4 (= .cse10 (_ bv0 32)) .cse6 (= |ULTIMATE.start_main_~a~0#1.base| (select .cse9 .cse11)) .cse7 .cse8 (= |ULTIMATE.start_main_~b~0#1.base| (_ bv0 32)) (not (= |ULTIMATE.start_main_~a~0#1.offset| ~counter~0)) .cse12)) (and (exists ((f_~i~1 (_ BitVec 32))) (= (select .cse13 (bvadd |~#pp~0.offset| (bvmul (_ bv4 32) f_~i~1))) |ULTIMATE.start_main_~b~0#1.offset|)) .cse0 .cse1 .cse2 .cse3 (= (bvadd .cse10 (_ bv1 32)) |ULTIMATE.start_main_~b~0#1.offset|) .cse6 .cse7 .cse8 .cse12)))) [2022-11-03 02:43:35,205 INFO L895 garLoopResultBuilder]: At program point L62(line 62) the Hoare annotation is: (let ((.cse0 (bvadd |~#pp~0.offset| (_ bv4 32))) (.cse1 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= (select (select |#memory_$Pointer$.base| |~#pp~0.base|) .cse0) (_ bv0 32)) (= |~#pp~0.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~a~0#1.base| (_ bv0 32)) (= (_ bv0 32) (select .cse1 .cse0)) (= (_ bv4 32) |~#pp~0.base|) (= (select .cse1 |~#pp~0.offset|) (_ bv0 32)) (= |~#pstate~0.base| (_ bv5 32)) (= |ULTIMATE.start_main_~a~0#1.offset| (_ bv1 32)) (= (_ bv0 32) |~#pstate~0.offset|) (= |ULTIMATE.start_main_~b~0#1.base| (_ bv0 32)) (not (= |ULTIMATE.start_main_~a~0#1.offset| ~counter~0)) (= (_ bv2 32) |ULTIMATE.start_main_~b~0#1.offset|))) [2022-11-03 02:43:35,206 INFO L895 garLoopResultBuilder]: At program point L62-1(line 62) the Hoare annotation is: (let ((.cse13 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse14 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse15 (bvadd |~#pp~0.offset| (_ bv4 32)))) (let ((.cse8 (select .cse14 .cse15)) (.cse1 (= |~#pp~0.offset| (_ bv0 32))) (.cse2 (= |ULTIMATE.start_main_~a~0#1.base| (_ bv0 32))) (.cse5 (select .cse13 .cse15)) (.cse4 (= (_ bv4 32) |~#pp~0.base|)) (.cse3 (select |#memory_int| |~#pstate~0.base|)) (.cse7 (= |~#pstate~0.base| (_ bv5 32))) (.cse0 (select .cse14 |~#pp~0.offset|)) (.cse9 (= |ULTIMATE.start_main_~a~0#1.offset| (_ bv1 32))) (.cse10 (= (_ bv0 32) |~#pstate~0.offset|)) (.cse11 (not (= |ULTIMATE.start_main_~a~0#1.offset| ~counter~0))) (.cse6 (select .cse13 |~#pp~0.offset|)) (.cse12 (= (_ bv2 32) |ULTIMATE.start_main_~b~0#1.offset|))) (or (and (not (= .cse0 (_ bv0 32))) .cse1 .cse2 (= (select .cse3 (bvadd (_ bv4 32) |~#pstate~0.offset|)) (_ bv1 32)) .cse4 (= (_ bv1 32) .cse5) (= .cse6 (_ bv0 32)) .cse7 (= |ULTIMATE.start_main_~a~0#1.base| .cse8) .cse9 .cse10 (= |ULTIMATE.start_main_~b~0#1.base| (_ bv0 32)) .cse11 .cse12) (and (= .cse8 (_ bv0 32)) .cse1 .cse2 (= (_ bv0 32) .cse5) .cse4 (= (select .cse3 |~#pstate~0.offset|) (_ bv1 32)) .cse7 (= |ULTIMATE.start_main_~a~0#1.base| .cse0) .cse9 .cse10 .cse11 (= .cse6 (_ bv1 32)) .cse12)))) [2022-11-03 02:43:35,206 INFO L895 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (let ((.cse0 (bvadd |~#pp~0.offset| (_ bv4 32))) (.cse1 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= (select (select |#memory_$Pointer$.base| |~#pp~0.base|) .cse0) (_ bv0 32)) (= |~#pp~0.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~a~0#1.base| (_ bv0 32)) (= (_ bv0 32) (select .cse1 .cse0)) (= (_ bv4 32) |~#pp~0.base|) (= (select .cse1 |~#pp~0.offset|) (_ bv0 32)) (= |~#pstate~0.base| (_ bv5 32)) (= (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv1 32)) ~counter~0) (= |ULTIMATE.start_main_~a~0#1.offset| (_ bv1 32)) (= (_ bv0 32) |~#pstate~0.offset|))) [2022-11-03 02:43:35,207 INFO L899 garLoopResultBuilder]: For program point L58-1(line 58) no Hoare annotation was computed. [2022-11-03 02:43:35,207 INFO L899 garLoopResultBuilder]: For program point L19-2(lines 19 22) no Hoare annotation was computed. [2022-11-03 02:43:35,207 INFO L899 garLoopResultBuilder]: For program point L17(lines 17 23) no Hoare annotation was computed. [2022-11-03 02:43:35,207 INFO L895 garLoopResultBuilder]: At program point L19-3(lines 19 22) the Hoare annotation is: (let ((.cse0 (bvadd |~#pp~0.offset| (_ bv4 32))) (.cse1 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= (select (select |#memory_$Pointer$.base| |~#pp~0.base|) .cse0) (_ bv0 32)) (= |~#pp~0.offset| (_ bv0 32)) (= (_ bv0 32) (select .cse1 .cse0)) (= ~counter~0 (_ bv1 32)) (= (_ bv4 32) |~#pp~0.base|) (= (select .cse1 |~#pp~0.offset|) (_ bv0 32)) (= |~#pstate~0.base| (_ bv5 32)) (= (_ bv0 32) |~#pstate~0.offset|))) [2022-11-03 02:43:35,207 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-03 02:43:35,208 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (let ((.cse8 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse14 (select |#memory_int| |~#pstate~0.base|)) (.cse15 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse9 (bvadd |~#pp~0.offset| (_ bv4 32)))) (let ((.cse5 (select .cse15 .cse9)) (.cse1 (= |~#pp~0.offset| (_ bv0 32))) (.cse2 (= |ULTIMATE.start_main_~a~0#1.base| (_ bv0 32))) (.cse3 (= (select .cse14 (bvadd (_ bv4 32) |~#pstate~0.offset|)) (_ bv1 32))) (.cse4 (= (_ bv4 32) |~#pp~0.base|)) (.cse7 (= |~#pstate~0.base| (_ bv5 32))) (.cse6 (select .cse15 |~#pp~0.offset|)) (.cse0 (select .cse8 |~#pp~0.offset|)) (.cse10 (= |ULTIMATE.start_main_~a~0#1.offset| (_ bv1 32))) (.cse11 (= (_ bv0 32) |~#pstate~0.offset|)) (.cse12 (not (= |ULTIMATE.start_main_~a~0#1.offset| ~counter~0))) (.cse13 (= (_ bv2 32) |ULTIMATE.start_main_~b~0#1.offset|))) (or (and (not (= .cse0 (_ bv0 32))) .cse1 .cse2 .cse3 .cse4 (= (_ bv1 32) .cse5) (= .cse6 (_ bv0 32)) .cse7 (= |ULTIMATE.start_main_~a~0#1.base| (select .cse8 .cse9)) .cse10 .cse11 (= |ULTIMATE.start_main_~b~0#1.base| (_ bv0 32)) .cse12 .cse13) (and (= |ULTIMATE.start_main_~b~0#1.offset| .cse5) .cse1 .cse2 .cse3 .cse4 (= (select .cse14 |~#pstate~0.offset|) (_ bv1 32)) .cse7 (= .cse6 |ULTIMATE.start_main_~a~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| .cse0) .cse10 .cse11 .cse12 .cse13)))) [2022-11-03 02:43:35,208 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-03 02:43:35,208 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-03 02:43:35,209 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 60) no Hoare annotation was computed. [2022-11-03 02:43:35,209 INFO L895 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (let ((.cse0 (bvadd |~#pp~0.offset| (_ bv4 32))) (.cse1 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= (select (select |#memory_$Pointer$.base| |~#pp~0.base|) .cse0) (_ bv0 32)) (= |~#pp~0.offset| (_ bv0 32)) (= (_ bv0 32) (select .cse1 .cse0)) (= ~counter~0 (_ bv1 32)) (= (_ bv4 32) |~#pp~0.base|) (= (select .cse1 |~#pp~0.offset|) (_ bv0 32)) (= |~#pstate~0.base| (_ bv5 32)) (= (_ bv0 32) |~#pstate~0.offset|))) [2022-11-03 02:43:35,209 INFO L899 garLoopResultBuilder]: For program point L57-1(line 57) no Hoare annotation was computed. [2022-11-03 02:43:35,209 INFO L902 garLoopResultBuilder]: At program point L70(lines 53 71) the Hoare annotation is: true [2022-11-03 02:43:35,210 INFO L899 garLoopResultBuilder]: For program point L66(line 66) no Hoare annotation was computed. [2022-11-03 02:43:35,210 INFO L895 garLoopResultBuilder]: At program point fake_mallocENTRY(lines 48 51) the Hoare annotation is: (let ((.cse8 (bvadd |~#pp~0.offset| (_ bv4 32))) (.cse9 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (let ((.cse0 (not (= (select .cse9 |~#pp~0.offset|) (_ bv0 32)))) (.cse1 (not (= (_ bv0 32) |~#pstate~0.offset|))) (.cse2 (not (= |~#pp~0.offset| (_ bv0 32)))) (.cse3 (not (= (_ bv0 32) (select .cse9 .cse8)))) (.cse4 (not (= (_ bv4 32) |~#pp~0.base|))) (.cse5 (not (= (select (select |#memory_$Pointer$.base| |~#pp~0.base|) .cse8) (_ bv0 32)))) (.cse6 (= |old(~counter~0)| ~counter~0)) (.cse7 (not (= |~#pstate~0.base| (_ bv5 32))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |old(~counter~0)| (_ bv1 32))) .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= (_ bv2 32) |old(~counter~0)|)) .cse5 .cse6 .cse7)))) [2022-11-03 02:43:35,210 INFO L899 garLoopResultBuilder]: For program point fake_mallocFINAL(lines 48 51) no Hoare annotation was computed. [2022-11-03 02:43:35,210 INFO L899 garLoopResultBuilder]: For program point fake_mallocEXIT(lines 48 51) no Hoare annotation was computed. [2022-11-03 02:43:35,214 INFO L444 BasicCegarLoop]: Path program histogram: [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:43:35,216 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 02:43:35,228 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,229 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,229 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,230 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,230 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,230 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,231 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,231 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,232 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_~i~1,QUANTIFIED] [2022-11-03 02:43:35,232 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,232 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,233 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,233 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,233 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,234 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,234 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,234 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,235 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_~i~1,QUANTIFIED] [2022-11-03 02:43:35,235 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,235 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,236 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,236 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,236 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,237 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3957,QUANTIFIED] [2022-11-03 02:43:35,237 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,237 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,238 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_4024,QUANTIFIED] [2022-11-03 02:43:35,238 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,238 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3260,QUANTIFIED] [2022-11-03 02:43:35,239 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,239 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,240 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,240 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,240 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,241 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,241 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,241 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,242 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,242 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,242 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,243 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,243 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,243 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,244 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,244 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,244 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,245 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,245 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,245 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,246 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,246 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,246 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,247 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3110,QUANTIFIED] [2022-11-03 02:43:35,247 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,247 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,248 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,248 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,248 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,249 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,249 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,249 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,250 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,250 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3717,QUANTIFIED] [2022-11-03 02:43:35,251 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,251 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,251 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,251 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,252 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,252 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,252 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,253 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,253 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,253 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,254 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,254 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,254 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,254 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,255 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,255 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,255 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,256 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,256 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,256 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,257 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,257 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,257 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,258 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,258 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,258 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,259 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,259 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,259 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,259 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,260 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,260 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,260 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,261 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_~i~1,QUANTIFIED] [2022-11-03 02:43:35,261 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,261 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,262 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,262 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,262 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,262 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,263 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,263 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,263 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,264 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,264 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,264 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,264 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,265 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,265 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,265 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,266 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,266 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,266 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,267 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,267 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,267 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,267 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,268 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,268 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,268 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,284 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,284 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,285 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,285 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,285 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,285 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,286 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,286 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,286 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_~i~1,QUANTIFIED] [2022-11-03 02:43:35,287 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,287 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,287 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,288 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,288 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,288 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,289 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,289 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,289 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_~i~1,QUANTIFIED] [2022-11-03 02:43:35,289 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,290 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,290 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,290 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,291 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,291 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3957,QUANTIFIED] [2022-11-03 02:43:35,291 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,292 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,292 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_4024,QUANTIFIED] [2022-11-03 02:43:35,292 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,292 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3260,QUANTIFIED] [2022-11-03 02:43:35,293 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,293 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,294 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,294 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,294 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,294 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,295 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,295 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,295 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,296 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,296 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,296 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,297 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,297 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,297 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,297 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,298 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,298 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,298 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,298 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,299 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,299 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,299 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,300 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3110,QUANTIFIED] [2022-11-03 02:43:35,300 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,300 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,300 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,301 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,301 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,302 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,302 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,302 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,303 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,303 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3717,QUANTIFIED] [2022-11-03 02:43:35,303 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,303 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,304 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,304 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,304 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,304 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,305 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,305 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,305 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,306 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,306 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,306 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,306 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,307 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,307 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,307 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,308 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,308 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,308 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,308 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,309 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,309 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,309 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,310 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,310 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,310 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,310 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,311 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,311 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,311 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,311 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,312 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,312 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,312 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_~i~1,QUANTIFIED] [2022-11-03 02:43:35,313 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,313 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,313 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,314 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,314 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,314 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,314 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,315 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,315 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,315 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,315 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,316 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,316 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,316 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,317 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,317 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,317 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,318 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,318 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,318 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,318 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,319 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,319 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,319 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,319 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,320 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,328 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,328 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,329 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,329 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,329 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,329 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,330 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,330 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,330 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,330 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,330 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,331 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,331 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,331 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,332 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,332 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,332 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,332 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,333 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,333 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,333 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,333 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,334 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,334 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,334 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,334 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,335 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,335 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,335 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,335 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,336 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,336 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,336 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,336 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,337 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,337 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,337 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,337 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,339 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,339 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,340 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,340 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,340 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,341 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,341 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,341 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,341 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,342 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,342 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,342 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,342 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,342 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,343 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,343 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,343 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,343 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,344 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,344 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,344 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,344 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,345 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,345 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,345 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,345 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,346 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,346 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,346 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,346 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,347 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,347 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,347 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,347 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,347 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,348 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,348 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,348 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,350 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,351 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,351 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,351 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,352 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,352 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 02:43:35 BoogieIcfgContainer [2022-11-03 02:43:35,353 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 02:43:35,353 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 02:43:35,353 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 02:43:35,354 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 02:43:35,354 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:35:17" (3/4) ... [2022-11-03 02:43:35,358 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-03 02:43:35,365 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2022-11-03 02:43:35,365 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2022-11-03 02:43:35,366 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fake_malloc [2022-11-03 02:43:35,373 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2022-11-03 02:43:35,373 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-11-03 02:43:35,374 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-03 02:43:35,374 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-03 02:43:35,409 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((!(0bv32 == pstate) || !(pp == 0bv32)) || (((((pointer == pointer && i == 0bv32) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][pstate])) || !(\old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)] == 0bv32)) || !(4bv32 == pp)) || !(\old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)] == 0bv32)) || (((((pointer == pointer && i == 1bv32) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || !(\old(#memory_$Pointer$)[pp][pp] == 1bv32)) || !(pstate == 5bv32)) && ((((((((!(0bv32 == pstate) || !(pp == 0bv32)) || (((((pointer == pointer && i == 0bv32) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || !(\old(#memory_$Pointer$)[pp][pp] == 0bv32)) || !(\old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)] == 0bv32)) || !(4bv32 == pp)) || !(\old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)] == 0bv32)) || ((((((pointer == pointer && i == 1bv32) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && !(#memory_$Pointer$[pp][~bvadd64(pp, 4294967292bv32, ~bvmul32(4bv32, i))] == 0bv32)) && pointer == pointer) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || !(pstate == 5bv32))) && ((((((((((!(0bv32 == pstate) || !(pp == 0bv32)) || !(1bv32 == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)])) || (((((pointer == pointer && i == 0bv32) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || !(\old(#memory_$Pointer$)[pp][pp] == 0bv32)) || ((((pointer == pointer && 2bv32 == i) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || !(4bv32 == pp)) || !(\old(unknown-#memory_int-unknown)[pstate][~bvadd64(4bv32, pstate)] == 1bv32)) || (((((pointer == pointer && i == 1bv32) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || 0bv32 == \old(#memory_$Pointer$)[pp][pp]) || !(pstate == 5bv32)) [2022-11-03 02:43:35,410 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(0bv32 == pstate) || ((((!(0bv32 == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)]) || \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)] == 0bv32) && #memory_$Pointer$[pp][pp] == \old(#memory_$Pointer$)[pp][pp]) && 2bv32 == i) && #memory_$Pointer$[pp][pp] == \old(#memory_$Pointer$)[pp][pp])) || !(pp == 0bv32)) || !(pointer == ~bvadd64(\old(#memory_$Pointer$)[pp][pp], 1bv32))) || (forall f_~i~1 : bv32 :: !(pointer == \old(#memory_$Pointer$)[pp][~bvadd64(pp, ~bvmul32(4bv32, f_~i~1))]))) || (((((((i == 1bv32 && pp == 0bv32) && unknown-#memory_int-unknown[pstate][~bvadd64(4bv32, pstate)] == 1bv32) && 4bv32 == pp) && (!(0bv32 == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)]) || \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)] == 0bv32)) && 0bv32 == pstate) && #memory_$Pointer$[pp][pp] == \old(#memory_$Pointer$)[pp][pp]) && #memory_$Pointer$[pp][pp] == \old(#memory_$Pointer$)[pp][pp])) || ((((((((pp == 0bv32 && 4bv32 == pp) && i == 0bv32) && (\exists f_~i~1 : bv32 :: ~bvadd64(#memory_$Pointer$[pp][pp], 1bv32) == #memory_$Pointer$[pp][~bvadd64(pp, ~bvmul32(4bv32, f_~i~1))])) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 0bv32 == pstate) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && (pstate == pp || pointer == pointer)) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || !(4bv32 == pp)) || !(\old(unknown-#memory_int-unknown)[pstate][~bvadd64(4bv32, pstate)] == 1bv32)) || !(pointer == 2bv32)) || !(pstate == 5bv32)) && ((((((((((((((((\exists v_ArrVal_3957 : [bv32]bv32 :: \old(#memory_$Pointer$)[pstate := v_ArrVal_3957] == #memory_$Pointer$) && (\exists v_ArrVal_4024 : [bv32]bv32 :: \old(#memory_$Pointer$)[pstate := v_ArrVal_4024] == #memory_$Pointer$)) && 2bv32 == i) && (\exists v_ArrVal_3260 : bv32 :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[pstate := \old(unknown-#memory_int-unknown)[pstate][~bvadd64(4bv32, pstate) := v_ArrVal_3260]])) || !(0bv32 == pstate)) || !(pointer == 1bv32)) || ((((((((((((i == 1bv32 && pp == 0bv32) && unknown-#memory_int-unknown[pstate][~bvadd64(4bv32, pstate)] == 1bv32) && 4bv32 == pp) && pointer == pointer) && pointer == pointer) && (!(0bv32 == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)]) || \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)] == 0bv32)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 0bv32 == pstate) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && #memory_$Pointer$[pp][pp] == \old(#memory_$Pointer$)[pp][pp]) && #memory_$Pointer$[pp][pp] == \old(#memory_$Pointer$)[pp][pp]) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || !(pp == 0bv32)) || !(\old(#memory_$Pointer$)[pp][pp] == 0bv32)) || ((((!(pointer == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)]) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && 2bv32 == i) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || !(4bv32 == pp)) || !(\old(unknown-#memory_int-unknown)[pstate][~bvadd64(4bv32, pstate)] == 1bv32)) || 0bv32 == \old(#memory_$Pointer$)[pp][pp]) || ((((((((pp == 0bv32 && 4bv32 == pp) && pointer == pointer) && i == 0bv32) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 0bv32 == pstate) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && pointer == 1bv32) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || !(pointer == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)])) || !(pstate == 5bv32))) && (((((((((((((((((unknown-#memory_int-unknown[pstate][~bvadd64(4bv32, pstate)] == 1bv32 && (\exists v_ArrVal_3110 : [bv32]bv32 :: \old(#memory_$Pointer$)[pstate := v_ArrVal_3110] == #memory_$Pointer$)) && ((#memory_$Pointer$[pp][~bvadd64(pp, 4bv32)] == 0bv32 || !(\old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)] == 0bv32)) || !(\old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)] == 0bv32))) && 2bv32 == i) && #memory_$Pointer$[pp][pp] == \old(#memory_$Pointer$)[pp][pp]) || !(0bv32 == pstate)) || !(pointer == 1bv32)) || !(pp == 0bv32)) || (((((i == 1bv32 && \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)] == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)]) && unknown-#memory_int-unknown[pstate][~bvadd64(4bv32, pstate)] == 1bv32) && pointer == pointer) && (\exists v_ArrVal_3717 : [bv32]bv32 :: \old(#memory_$Pointer$)[pstate := v_ArrVal_3717] == #memory_$Pointer$)) && #memory_$Pointer$[pp][pp] == \old(#memory_$Pointer$)[pp][pp])) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][pstate])) || !(4bv32 == pp)) || (((((i == 0bv32 && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 0bv32 == pointer) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && pointer == 1bv32) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || !(\old(unknown-#memory_int-unknown)[pstate][~bvadd64(4bv32, pstate)] == 1bv32)) || pointer == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)]) || !(pointer == \old(#memory_$Pointer$)[pp][pp])) || !(\old(#memory_$Pointer$)[pp][pp] == 1bv32)) || !(pointer == 0bv32)) || !(pstate == 5bv32))) && (((((((((!(0bv32 == pstate) || ((((unknown-#memory_int-unknown[pstate][~bvadd64(4bv32, pstate)] == 1bv32 && unknown-#memory_int-unknown[pstate][pstate] == 1bv32) && i == 0bv32) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || !(pp == 0bv32)) || ((((((pp == 0bv32 && 4bv32 == pp) && 1bv32 == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)]) && 0bv32 == pstate) && #memory_$Pointer$[pp][pp] == \old(#memory_$Pointer$)[pp][pp]) && 2bv32 == i) && #memory_$Pointer$[pp][pp] == \old(#memory_$Pointer$)[pp][pp])) || !(1bv32 == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)])) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][pstate])) || (((((((i == 1bv32 && pp == 0bv32) && unknown-#memory_int-unknown[pstate][~bvadd64(4bv32, pstate)] == 1bv32) && 4bv32 == pp) && 1bv32 == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)]) && 0bv32 == pstate) && #memory_$Pointer$[pp][pp] == \old(#memory_$Pointer$)[pp][pp]) && #memory_$Pointer$[pp][pp] == \old(#memory_$Pointer$)[pp][pp])) || !(4bv32 == pp)) || !(\old(unknown-#memory_int-unknown)[pstate][~bvadd64(4bv32, pstate)] == 1bv32)) || !(pstate == 5bv32))) && (((((((((((!(0bv32 == pstate) || !(pp == 0bv32)) || ((((((pp == 0bv32 && 4bv32 == pp) && 1bv32 == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)]) && 0bv32 == pstate) && #memory_$Pointer$[pp][pp] == \old(#memory_$Pointer$)[pp][pp]) && 2bv32 == i) && #memory_$Pointer$[pp][pp] == \old(#memory_$Pointer$)[pp][pp])) || !(1bv32 == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)])) || !(pointer == ~bvadd64(\old(#memory_$Pointer$)[pp][pp], 1bv32))) || (forall f_~i~1 : bv32 :: !(pointer == \old(#memory_$Pointer$)[pp][~bvadd64(pp, ~bvmul32(4bv32, f_~i~1))]))) || (((((((i == 1bv32 && pp == 0bv32) && unknown-#memory_int-unknown[pstate][~bvadd64(4bv32, pstate)] == 1bv32) && 4bv32 == pp) && 1bv32 == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)]) && 0bv32 == pstate) && #memory_$Pointer$[pp][pp] == \old(#memory_$Pointer$)[pp][pp]) && #memory_$Pointer$[pp][pp] == \old(#memory_$Pointer$)[pp][pp])) || !(4bv32 == pp)) || !(\old(unknown-#memory_int-unknown)[pstate][~bvadd64(4bv32, pstate)] == 1bv32)) || !(pointer == 2bv32)) || (((((((pp == 0bv32 && unknown-#memory_int-unknown[pstate][~bvadd64(4bv32, pstate)] == 1bv32) && 4bv32 == pp) && i == 0bv32) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 0bv32 == pstate) && (pstate == pp || pointer == pointer)) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || !(pstate == 5bv32))) && (((((((((((!(0bv32 == pstate) || ((((!(0bv32 == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)]) || \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)] == 0bv32) && #memory_$Pointer$[pp][pp] == \old(#memory_$Pointer$)[pp][pp]) && 2bv32 == i) && #memory_$Pointer$[pp][pp] == \old(#memory_$Pointer$)[pp][pp])) || !(pp == 0bv32)) || !(1bv32 == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)])) || !(\old(#memory_$Pointer$)[pp][pp] == 0bv32)) || !(4bv32 == pp)) || (((((i == 0bv32 && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 0bv32 == pointer) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && \old(#memory_$Pointer$) == #memory_$Pointer$) && 2bv32 == pointer)) || !(pointer == 2bv32)) || 0bv32 == \old(#memory_$Pointer$)[pp][pp]) || ((((((i == 1bv32 && pp == 0bv32) && 4bv32 == pp) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 0bv32 == pstate) && \old(#memory_$Pointer$) == #memory_$Pointer$) && 2bv32 == pointer)) || !(pointer == 0bv32)) || !(pstate == 5bv32)) [2022-11-03 02:43:35,426 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 02:43:35,426 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 02:43:35,426 INFO L158 Benchmark]: Toolchain (without parser) took 499394.20ms. Allocated memory was 62.9MB in the beginning and 234.9MB in the end (delta: 172.0MB). Free memory was 40.8MB in the beginning and 83.7MB in the end (delta: -42.9MB). Peak memory consumption was 129.0MB. Max. memory is 16.1GB. [2022-11-03 02:43:35,427 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 50.3MB. Free memory was 30.7MB in the beginning and 30.6MB in the end (delta: 52.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:43:35,427 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.99ms. Allocated memory is still 62.9MB. Free memory was 40.6MB in the beginning and 46.5MB in the end (delta: -5.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-03 02:43:35,427 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.16ms. Allocated memory is still 62.9MB. Free memory was 46.3MB in the beginning and 44.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:43:35,427 INFO L158 Benchmark]: Boogie Preprocessor took 68.79ms. Allocated memory is still 62.9MB. Free memory was 44.7MB in the beginning and 43.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:43:35,427 INFO L158 Benchmark]: RCFGBuilder took 624.04ms. Allocated memory is still 62.9MB. Free memory was 43.1MB in the beginning and 45.2MB in the end (delta: -2.2MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. [2022-11-03 02:43:35,428 INFO L158 Benchmark]: TraceAbstraction took 498168.10ms. Allocated memory was 62.9MB in the beginning and 234.9MB in the end (delta: 172.0MB). Free memory was 44.5MB in the beginning and 86.8MB in the end (delta: -42.3MB). Peak memory consumption was 151.6MB. Max. memory is 16.1GB. [2022-11-03 02:43:35,428 INFO L158 Benchmark]: Witness Printer took 72.51ms. Allocated memory is still 234.9MB. Free memory was 86.8MB in the beginning and 83.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:43:35,429 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.28ms. Allocated memory is still 50.3MB. Free memory was 30.7MB in the beginning and 30.6MB in the end (delta: 52.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 384.99ms. Allocated memory is still 62.9MB. Free memory was 40.6MB in the beginning and 46.5MB in the end (delta: -5.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.16ms. Allocated memory is still 62.9MB. Free memory was 46.3MB in the beginning and 44.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 68.79ms. Allocated memory is still 62.9MB. Free memory was 44.7MB in the beginning and 43.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 624.04ms. Allocated memory is still 62.9MB. Free memory was 43.1MB in the beginning and 45.2MB in the end (delta: -2.2MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. * TraceAbstraction took 498168.10ms. Allocated memory was 62.9MB in the beginning and 234.9MB in the end (delta: 172.0MB). Free memory was 44.5MB in the beginning and 86.8MB in the end (delta: -42.3MB). Peak memory consumption was 151.6MB. Max. memory is 16.1GB. * Witness Printer took 72.51ms. Allocated memory is still 234.9MB. Free memory was 86.8MB in the beginning and 83.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[f_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[f_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3957,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_4024,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3260,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3110,QUANTIFIED] - 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$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3717,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[f_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[f_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[f_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3957,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_4024,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3260,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3110,QUANTIFIED] - 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$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3717,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[f_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 8]: 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 4 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 498.0s, OverallIterations: 24, TraceHistogramMax: 4, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 191.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 163.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2972 SdHoareTripleChecker+Valid, 56.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2918 mSDsluCounter, 5648 SdHoareTripleChecker+Invalid, 49.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2568 IncrementalHoareTripleChecker+Unchecked, 4631 mSDsCounter, 1641 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16077 IncrementalHoareTripleChecker+Invalid, 20286 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1641 mSolverCounterUnsat, 1017 mSDtfsCounter, 16077 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5257 GetRequests, 4202 SyntacticMatches, 23 SemanticMatches, 1032 ConstructedPredicates, 26 IntricatePredicates, 0 DeprecatedPredicates, 16111 ImplicationChecksByTransitivity, 194.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=314occurred in iteration=16, InterpolantAutomatonStates: 512, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 24 MinimizatonAttempts, 636 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 214 PreInvPairs, 322 NumberOfFragments, 2701 HoareAnnotationTreeSize, 214 FomulaSimplifications, 63828 FormulaSimplificationTreeSizeReduction, 78.4s HoareSimplificationTime, 13 FomulaSimplificationsInter, 912908 FormulaSimplificationTreeSizeReductionInter, 85.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.3s SsaConstructionTime, 12.7s SatisfiabilityAnalysisTime, 102.9s InterpolantComputationTime, 2952 NumberOfCodeBlocks, 2931 NumberOfCodeBlocksAsserted, 99 NumberOfCheckSat, 4665 ConstructedInterpolants, 133 QuantifiedInterpolants, 44176 SizeOfPredicates, 534 NumberOfNonLiveVariables, 12796 ConjunctsInSsa, 1487 ConjunctsInUnsatCore, 105 InterpolantComputations, 4 PerfectInterpolantSequences, 1417/2481 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: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 38]: Loop Invariant [2022-11-03 02:43:35,478 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,478 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,478 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,478 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,478 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,479 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,479 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,479 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,479 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_~i~1,QUANTIFIED] [2022-11-03 02:43:35,479 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,480 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,480 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,480 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,480 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,480 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,480 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,481 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,481 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_~i~1,QUANTIFIED] [2022-11-03 02:43:35,481 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,481 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,481 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,481 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,482 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,482 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3957,QUANTIFIED] [2022-11-03 02:43:35,482 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,482 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,482 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_4024,QUANTIFIED] [2022-11-03 02:43:35,483 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,483 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3260,QUANTIFIED] [2022-11-03 02:43:35,484 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,484 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,485 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,485 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,485 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,486 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,486 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,486 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,487 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,487 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,488 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,488 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,489 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,489 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,489 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,489 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,489 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,490 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,491 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,491 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,491 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,491 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,491 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,491 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3110,QUANTIFIED] [2022-11-03 02:43:35,492 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,492 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,492 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,492 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,493 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,493 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,493 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,493 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,493 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,494 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3717,QUANTIFIED] [2022-11-03 02:43:35,494 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,494 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,494 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,494 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,494 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,495 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,495 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,495 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,495 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,496 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,496 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,496 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,496 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,496 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,497 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,497 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,497 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,497 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,497 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,497 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,497 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,497 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,497 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,498 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,498 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,498 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,498 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,498 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,498 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,498 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,498 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,498 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,499 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,499 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_~i~1,QUANTIFIED] [2022-11-03 02:43:35,499 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,499 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,499 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,499 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,499 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,500 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,500 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,500 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,500 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,500 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,500 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,500 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,501 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,501 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,501 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,501 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,501 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,501 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,501 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,501 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,502 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,502 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,502 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,502 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,502 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,502 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,505 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,506 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,506 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,506 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,506 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,506 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,506 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,507 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,507 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_~i~1,QUANTIFIED] [2022-11-03 02:43:35,507 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,507 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,507 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,507 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,508 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,508 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,508 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,508 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,510 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_~i~1,QUANTIFIED] [2022-11-03 02:43:35,510 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,510 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,510 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,511 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,511 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,511 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3957,QUANTIFIED] [2022-11-03 02:43:35,511 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,512 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,512 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_4024,QUANTIFIED] [2022-11-03 02:43:35,512 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,512 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3260,QUANTIFIED] [2022-11-03 02:43:35,513 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,513 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,513 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,514 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,514 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,514 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,514 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,515 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,515 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,515 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,515 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,515 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,516 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,516 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,516 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,516 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,517 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,517 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,517 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,517 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,517 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,518 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,518 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,518 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3110,QUANTIFIED] [2022-11-03 02:43:35,518 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,519 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,519 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,519 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,519 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,520 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,520 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,520 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,521 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,521 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3717,QUANTIFIED] [2022-11-03 02:43:35,521 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,521 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,522 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,522 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,522 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,522 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,523 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,523 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,523 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,523 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,523 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,524 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,524 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,524 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,524 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,530 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,530 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,530 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,531 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,531 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,531 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,531 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,531 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,532 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,532 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,532 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,532 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,533 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,533 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,533 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,533 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,533 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,534 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,534 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_~i~1,QUANTIFIED] [2022-11-03 02:43:35,534 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,534 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,535 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,535 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,535 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,535 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,535 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,536 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,536 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,536 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,536 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,536 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,537 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,537 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,537 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,537 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,538 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,538 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,538 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,538 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,538 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,539 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,539 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,539 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,539 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,539 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((!(0bv32 == pstate) || ((((!(0bv32 == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)]) || \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)] == 0bv32) && #memory_$Pointer$[pp][pp] == \old(#memory_$Pointer$)[pp][pp]) && 2bv32 == i) && #memory_$Pointer$[pp][pp] == \old(#memory_$Pointer$)[pp][pp])) || !(pp == 0bv32)) || !(pointer == ~bvadd64(\old(#memory_$Pointer$)[pp][pp], 1bv32))) || (forall f_~i~1 : bv32 :: !(pointer == \old(#memory_$Pointer$)[pp][~bvadd64(pp, ~bvmul32(4bv32, f_~i~1))]))) || (((((((i == 1bv32 && pp == 0bv32) && unknown-#memory_int-unknown[pstate][~bvadd64(4bv32, pstate)] == 1bv32) && 4bv32 == pp) && (!(0bv32 == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)]) || \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)] == 0bv32)) && 0bv32 == pstate) && #memory_$Pointer$[pp][pp] == \old(#memory_$Pointer$)[pp][pp]) && #memory_$Pointer$[pp][pp] == \old(#memory_$Pointer$)[pp][pp])) || ((((((((pp == 0bv32 && 4bv32 == pp) && i == 0bv32) && (\exists f_~i~1 : bv32 :: ~bvadd64(#memory_$Pointer$[pp][pp], 1bv32) == #memory_$Pointer$[pp][~bvadd64(pp, ~bvmul32(4bv32, f_~i~1))])) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 0bv32 == pstate) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && (pstate == pp || pointer == pointer)) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || !(4bv32 == pp)) || !(\old(unknown-#memory_int-unknown)[pstate][~bvadd64(4bv32, pstate)] == 1bv32)) || !(pointer == 2bv32)) || !(pstate == 5bv32)) && ((((((((((((((((\exists v_ArrVal_3957 : [bv32]bv32 :: \old(#memory_$Pointer$)[pstate := v_ArrVal_3957] == #memory_$Pointer$) && (\exists v_ArrVal_4024 : [bv32]bv32 :: \old(#memory_$Pointer$)[pstate := v_ArrVal_4024] == #memory_$Pointer$)) && 2bv32 == i) && (\exists v_ArrVal_3260 : bv32 :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[pstate := \old(unknown-#memory_int-unknown)[pstate][~bvadd64(4bv32, pstate) := v_ArrVal_3260]])) || !(0bv32 == pstate)) || !(pointer == 1bv32)) || ((((((((((((i == 1bv32 && pp == 0bv32) && unknown-#memory_int-unknown[pstate][~bvadd64(4bv32, pstate)] == 1bv32) && 4bv32 == pp) && pointer == pointer) && pointer == pointer) && (!(0bv32 == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)]) || \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)] == 0bv32)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 0bv32 == pstate) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && #memory_$Pointer$[pp][pp] == \old(#memory_$Pointer$)[pp][pp]) && #memory_$Pointer$[pp][pp] == \old(#memory_$Pointer$)[pp][pp]) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || !(pp == 0bv32)) || !(\old(#memory_$Pointer$)[pp][pp] == 0bv32)) || ((((!(pointer == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)]) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && 2bv32 == i) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || !(4bv32 == pp)) || !(\old(unknown-#memory_int-unknown)[pstate][~bvadd64(4bv32, pstate)] == 1bv32)) || 0bv32 == \old(#memory_$Pointer$)[pp][pp]) || ((((((((pp == 0bv32 && 4bv32 == pp) && pointer == pointer) && i == 0bv32) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 0bv32 == pstate) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && pointer == 1bv32) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || !(pointer == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)])) || !(pstate == 5bv32))) && (((((((((((((((((unknown-#memory_int-unknown[pstate][~bvadd64(4bv32, pstate)] == 1bv32 && (\exists v_ArrVal_3110 : [bv32]bv32 :: \old(#memory_$Pointer$)[pstate := v_ArrVal_3110] == #memory_$Pointer$)) && ((#memory_$Pointer$[pp][~bvadd64(pp, 4bv32)] == 0bv32 || !(\old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)] == 0bv32)) || !(\old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)] == 0bv32))) && 2bv32 == i) && #memory_$Pointer$[pp][pp] == \old(#memory_$Pointer$)[pp][pp]) || !(0bv32 == pstate)) || !(pointer == 1bv32)) || !(pp == 0bv32)) || (((((i == 1bv32 && \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)] == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)]) && unknown-#memory_int-unknown[pstate][~bvadd64(4bv32, pstate)] == 1bv32) && pointer == pointer) && (\exists v_ArrVal_3717 : [bv32]bv32 :: \old(#memory_$Pointer$)[pstate := v_ArrVal_3717] == #memory_$Pointer$)) && #memory_$Pointer$[pp][pp] == \old(#memory_$Pointer$)[pp][pp])) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][pstate])) || !(4bv32 == pp)) || (((((i == 0bv32 && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 0bv32 == pointer) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && pointer == 1bv32) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || !(\old(unknown-#memory_int-unknown)[pstate][~bvadd64(4bv32, pstate)] == 1bv32)) || pointer == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)]) || !(pointer == \old(#memory_$Pointer$)[pp][pp])) || !(\old(#memory_$Pointer$)[pp][pp] == 1bv32)) || !(pointer == 0bv32)) || !(pstate == 5bv32))) && (((((((((!(0bv32 == pstate) || ((((unknown-#memory_int-unknown[pstate][~bvadd64(4bv32, pstate)] == 1bv32 && unknown-#memory_int-unknown[pstate][pstate] == 1bv32) && i == 0bv32) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || !(pp == 0bv32)) || ((((((pp == 0bv32 && 4bv32 == pp) && 1bv32 == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)]) && 0bv32 == pstate) && #memory_$Pointer$[pp][pp] == \old(#memory_$Pointer$)[pp][pp]) && 2bv32 == i) && #memory_$Pointer$[pp][pp] == \old(#memory_$Pointer$)[pp][pp])) || !(1bv32 == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)])) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][pstate])) || (((((((i == 1bv32 && pp == 0bv32) && unknown-#memory_int-unknown[pstate][~bvadd64(4bv32, pstate)] == 1bv32) && 4bv32 == pp) && 1bv32 == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)]) && 0bv32 == pstate) && #memory_$Pointer$[pp][pp] == \old(#memory_$Pointer$)[pp][pp]) && #memory_$Pointer$[pp][pp] == \old(#memory_$Pointer$)[pp][pp])) || !(4bv32 == pp)) || !(\old(unknown-#memory_int-unknown)[pstate][~bvadd64(4bv32, pstate)] == 1bv32)) || !(pstate == 5bv32))) && (((((((((((!(0bv32 == pstate) || !(pp == 0bv32)) || ((((((pp == 0bv32 && 4bv32 == pp) && 1bv32 == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)]) && 0bv32 == pstate) && #memory_$Pointer$[pp][pp] == \old(#memory_$Pointer$)[pp][pp]) && 2bv32 == i) && #memory_$Pointer$[pp][pp] == \old(#memory_$Pointer$)[pp][pp])) || !(1bv32 == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)])) || !(pointer == ~bvadd64(\old(#memory_$Pointer$)[pp][pp], 1bv32))) || (forall f_~i~1 : bv32 :: !(pointer == \old(#memory_$Pointer$)[pp][~bvadd64(pp, ~bvmul32(4bv32, f_~i~1))]))) || (((((((i == 1bv32 && pp == 0bv32) && unknown-#memory_int-unknown[pstate][~bvadd64(4bv32, pstate)] == 1bv32) && 4bv32 == pp) && 1bv32 == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)]) && 0bv32 == pstate) && #memory_$Pointer$[pp][pp] == \old(#memory_$Pointer$)[pp][pp]) && #memory_$Pointer$[pp][pp] == \old(#memory_$Pointer$)[pp][pp])) || !(4bv32 == pp)) || !(\old(unknown-#memory_int-unknown)[pstate][~bvadd64(4bv32, pstate)] == 1bv32)) || !(pointer == 2bv32)) || (((((((pp == 0bv32 && unknown-#memory_int-unknown[pstate][~bvadd64(4bv32, pstate)] == 1bv32) && 4bv32 == pp) && i == 0bv32) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 0bv32 == pstate) && (pstate == pp || pointer == pointer)) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || !(pstate == 5bv32))) && (((((((((((!(0bv32 == pstate) || ((((!(0bv32 == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)]) || \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)] == 0bv32) && #memory_$Pointer$[pp][pp] == \old(#memory_$Pointer$)[pp][pp]) && 2bv32 == i) && #memory_$Pointer$[pp][pp] == \old(#memory_$Pointer$)[pp][pp])) || !(pp == 0bv32)) || !(1bv32 == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)])) || !(\old(#memory_$Pointer$)[pp][pp] == 0bv32)) || !(4bv32 == pp)) || (((((i == 0bv32 && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 0bv32 == pointer) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && \old(#memory_$Pointer$) == #memory_$Pointer$) && 2bv32 == pointer)) || !(pointer == 2bv32)) || 0bv32 == \old(#memory_$Pointer$)[pp][pp]) || ((((((i == 1bv32 && pp == 0bv32) && 4bv32 == pp) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 0bv32 == pstate) && \old(#memory_$Pointer$) == #memory_$Pointer$) && 2bv32 == pointer)) || !(pointer == 0bv32)) || !(pstate == 5bv32)) - InvariantResult [Line: 27]: Loop Invariant [2022-11-03 02:43:35,544 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,544 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,545 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,545 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,545 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,545 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,545 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,546 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,546 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,546 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,546 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,546 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,547 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,547 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,547 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,547 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,547 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,548 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,548 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,548 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,548 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,548 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,549 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,549 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,549 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,549 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,550 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,550 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,550 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,550 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,550 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,550 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,551 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,551 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,551 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,551 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,551 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,552 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,553 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,553 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,554 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,554 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,554 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,554 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,554 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,555 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,555 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,555 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,555 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,555 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,556 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,556 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,556 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,556 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,556 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,557 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,557 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,557 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,557 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,557 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,558 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,558 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,558 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,558 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,558 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,559 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,559 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,559 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,559 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,559 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,560 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,560 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,560 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,560 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,560 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,561 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((!(0bv32 == pstate) || !(pp == 0bv32)) || (((((pointer == pointer && i == 0bv32) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][pstate])) || !(\old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)] == 0bv32)) || !(4bv32 == pp)) || !(\old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)] == 0bv32)) || (((((pointer == pointer && i == 1bv32) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || !(\old(#memory_$Pointer$)[pp][pp] == 1bv32)) || !(pstate == 5bv32)) && ((((((((!(0bv32 == pstate) || !(pp == 0bv32)) || (((((pointer == pointer && i == 0bv32) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || !(\old(#memory_$Pointer$)[pp][pp] == 0bv32)) || !(\old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)] == 0bv32)) || !(4bv32 == pp)) || !(\old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)] == 0bv32)) || ((((((pointer == pointer && i == 1bv32) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && !(#memory_$Pointer$[pp][~bvadd64(pp, 4294967292bv32, ~bvmul32(4bv32, i))] == 0bv32)) && pointer == pointer) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || !(pstate == 5bv32))) && ((((((((((!(0bv32 == pstate) || !(pp == 0bv32)) || !(1bv32 == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)])) || (((((pointer == pointer && i == 0bv32) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || !(\old(#memory_$Pointer$)[pp][pp] == 0bv32)) || ((((pointer == pointer && 2bv32 == i) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || !(4bv32 == pp)) || !(\old(unknown-#memory_int-unknown)[pstate][~bvadd64(4bv32, pstate)] == 1bv32)) || (((((pointer == pointer && i == 1bv32) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || 0bv32 == \old(#memory_$Pointer$)[pp][pp]) || !(pstate == 5bv32)) - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19]: Loop Invariant [2022-11-03 02:43:35,562 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,562 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,563 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,563 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:43:35,563 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:43:35,563 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((#memory_$Pointer$[pp][~bvadd64(pp, 4bv32)] == 0bv32 && pp == 0bv32) && 0bv32 == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)]) && counter == 1bv32) && 4bv32 == pp) && #memory_$Pointer$[pp][pp] == 0bv32) && pstate == 5bv32) && 0bv32 == pstate RESULT: Ultimate proved your program to be correct! [2022-11-03 02:43:35,796 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-11-03 02:43:35,830 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2938fdc1-9c50-41d8-9dd2-d353717a8c5c/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE