./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/array-tiling/mbpr4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8393723b 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_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-tiling/mbpr4.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d3770c63a87ff983494c9353997301d9eb30588c650f83b67bcf55f325443055 --- 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-8393723 [2022-11-19 08:31:15,740 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 08:31:15,742 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 08:31:15,767 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 08:31:15,768 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 08:31:15,772 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 08:31:15,775 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 08:31:15,779 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 08:31:15,781 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 08:31:15,787 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 08:31:15,788 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 08:31:15,790 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 08:31:15,791 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 08:31:15,794 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 08:31:15,795 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 08:31:15,797 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 08:31:15,799 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 08:31:15,800 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 08:31:15,801 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 08:31:15,804 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 08:31:15,806 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 08:31:15,807 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 08:31:15,808 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 08:31:15,809 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 08:31:15,812 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 08:31:15,812 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 08:31:15,813 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 08:31:15,813 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 08:31:15,814 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 08:31:15,815 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 08:31:15,815 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 08:31:15,816 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 08:31:15,816 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 08:31:15,817 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 08:31:15,818 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 08:31:15,818 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 08:31:15,819 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 08:31:15,819 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 08:31:15,820 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 08:31:15,820 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 08:31:15,821 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 08:31:15,822 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-19 08:31:15,845 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 08:31:15,846 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 08:31:15,846 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 08:31:15,846 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 08:31:15,847 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 08:31:15,847 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 08:31:15,847 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 08:31:15,847 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 08:31:15,848 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 08:31:15,848 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 08:31:15,848 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 08:31:15,848 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 08:31:15,848 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 08:31:15,849 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 08:31:15,849 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 08:31:15,849 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 08:31:15,849 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 08:31:15,849 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 08:31:15,850 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 08:31:15,850 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 08:31:15,851 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 08:31:15,851 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 08:31:15,851 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 08:31:15,851 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 08:31:15,851 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 08:31:15,852 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 08:31:15,852 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 08:31:15,852 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-19 08:31:15,852 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 08:31:15,852 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 08:31:15,852 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 08:31:15,853 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 08:31:15,853 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 08:31:15,853 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 08:31:15,853 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:31:15,853 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 08:31:15,854 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 08:31:15,854 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 08:31:15,854 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 08:31:15,854 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 08:31:15,854 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 08:31:15,854 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 08:31:15,855 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 08:31:15,855 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_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/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_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS 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 ! overflow) ) 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 -> d3770c63a87ff983494c9353997301d9eb30588c650f83b67bcf55f325443055 [2022-11-19 08:31:16,129 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 08:31:16,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 08:31:16,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 08:31:16,158 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 08:31:16,159 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 08:31:16,160 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/array-tiling/mbpr4.c [2022-11-19 08:31:16,256 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/data/64cf0d919/39fae26a8ece40f4a74a6263689cf3c6/FLAG6fd1ae878 [2022-11-19 08:31:16,888 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 08:31:16,889 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/sv-benchmarks/c/array-tiling/mbpr4.c [2022-11-19 08:31:16,900 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/data/64cf0d919/39fae26a8ece40f4a74a6263689cf3c6/FLAG6fd1ae878 [2022-11-19 08:31:17,219 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/data/64cf0d919/39fae26a8ece40f4a74a6263689cf3c6 [2022-11-19 08:31:17,222 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 08:31:17,223 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 08:31:17,225 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 08:31:17,225 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 08:31:17,229 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 08:31:17,230 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:31:17" (1/1) ... [2022-11-19 08:31:17,231 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32e5b306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:31:17, skipping insertion in model container [2022-11-19 08:31:17,231 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:31:17" (1/1) ... [2022-11-19 08:31:17,239 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 08:31:17,266 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 08:31:17,463 WARN L234 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_9c5490cf-7b55-4fd3-8d85-200671431281/sv-benchmarks/c/array-tiling/mbpr4.c[396,409] [2022-11-19 08:31:17,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:31:17,554 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 08:31:17,567 WARN L234 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_9c5490cf-7b55-4fd3-8d85-200671431281/sv-benchmarks/c/array-tiling/mbpr4.c[396,409] [2022-11-19 08:31:17,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:31:17,605 INFO L208 MainTranslator]: Completed translation [2022-11-19 08:31:17,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:31:17 WrapperNode [2022-11-19 08:31:17,606 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 08:31:17,607 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 08:31:17,607 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 08:31:17,607 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 08:31:17,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:31:17" (1/1) ... [2022-11-19 08:31:17,625 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:31:17" (1/1) ... [2022-11-19 08:31:17,665 INFO L138 Inliner]: procedures = 15, calls = 54, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 291 [2022-11-19 08:31:17,665 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 08:31:17,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 08:31:17,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 08:31:17,666 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 08:31:17,678 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:31:17" (1/1) ... [2022-11-19 08:31:17,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:31:17" (1/1) ... [2022-11-19 08:31:17,682 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:31:17" (1/1) ... [2022-11-19 08:31:17,683 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:31:17" (1/1) ... [2022-11-19 08:31:17,706 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:31:17" (1/1) ... [2022-11-19 08:31:17,711 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:31:17" (1/1) ... [2022-11-19 08:31:17,713 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:31:17" (1/1) ... [2022-11-19 08:31:17,715 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:31:17" (1/1) ... [2022-11-19 08:31:17,719 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 08:31:17,726 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 08:31:17,726 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 08:31:17,727 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 08:31:17,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:31:17" (1/1) ... [2022-11-19 08:31:17,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:31:17,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:31:17,788 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 08:31:17,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 08:31:17,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 08:31:17,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 08:31:17,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 08:31:17,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 08:31:17,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 08:31:17,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 08:31:17,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-19 08:31:17,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 08:31:17,922 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 08:31:17,924 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 08:31:18,873 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 08:31:18,961 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 08:31:18,961 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-19 08:31:18,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:31:18 BoogieIcfgContainer [2022-11-19 08:31:18,965 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 08:31:18,968 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 08:31:18,969 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 08:31:18,973 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 08:31:18,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:31:17" (1/3) ... [2022-11-19 08:31:18,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5500d17e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:31:18, skipping insertion in model container [2022-11-19 08:31:18,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:31:17" (2/3) ... [2022-11-19 08:31:18,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5500d17e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:31:18, skipping insertion in model container [2022-11-19 08:31:18,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:31:18" (3/3) ... [2022-11-19 08:31:18,977 INFO L112 eAbstractionObserver]: Analyzing ICFG mbpr4.c [2022-11-19 08:31:18,998 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 08:31:18,999 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 146 error locations. [2022-11-19 08:31:19,102 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 08:31:19,114 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;@79483920, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 08:31:19,114 INFO L358 AbstractCegarLoop]: Starting to check reachability of 146 error locations. [2022-11-19 08:31:19,127 INFO L276 IsEmpty]: Start isEmpty. Operand has 311 states, 164 states have (on average 1.9817073170731707) internal successors, (325), 310 states have internal predecessors, (325), 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-19 08:31:19,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-19 08:31:19,137 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:31:19,138 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-19 08:31:19,139 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2022-11-19 08:31:19,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:31:19,146 INFO L85 PathProgramCache]: Analyzing trace with hash 13781815, now seen corresponding path program 1 times [2022-11-19 08:31:19,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:31:19,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201462427] [2022-11-19 08:31:19,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:31:19,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:31:19,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:31:19,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:31:19,739 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:31:19,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201462427] [2022-11-19 08:31:19,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201462427] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:31:19,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:31:19,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:31:19,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865697090] [2022-11-19 08:31:19,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:31:19,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:31:19,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:31:19,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:31:19,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:31:19,786 INFO L87 Difference]: Start difference. First operand has 311 states, 164 states have (on average 1.9817073170731707) internal successors, (325), 310 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 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-19 08:31:19,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:31:19,977 INFO L93 Difference]: Finished difference Result 544 states and 571 transitions. [2022-11-19 08:31:19,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:31:19,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-19 08:31:19,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:31:20,004 INFO L225 Difference]: With dead ends: 544 [2022-11-19 08:31:20,005 INFO L226 Difference]: Without dead ends: 300 [2022-11-19 08:31:20,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:31:20,018 INFO L413 NwaCegarLoop]: 286 mSDtfsCounter, 622 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:31:20,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 287 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:31:20,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-11-19 08:31:20,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2022-11-19 08:31:20,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 162 states have (on average 1.9012345679012346) internal successors, (308), 299 states have internal predecessors, (308), 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-19 08:31:20,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 308 transitions. [2022-11-19 08:31:20,101 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 308 transitions. Word has length 4 [2022-11-19 08:31:20,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:31:20,102 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 308 transitions. [2022-11-19 08:31:20,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 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-19 08:31:20,103 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 308 transitions. [2022-11-19 08:31:20,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-19 08:31:20,104 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:31:20,104 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:31:20,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 08:31:20,105 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2022-11-19 08:31:20,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:31:20,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1809139966, now seen corresponding path program 1 times [2022-11-19 08:31:20,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:31:20,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453925031] [2022-11-19 08:31:20,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:31:20,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:31:20,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:31:20,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:31:20,209 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:31:20,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453925031] [2022-11-19 08:31:20,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453925031] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:31:20,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:31:20,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:31:20,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890449570] [2022-11-19 08:31:20,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:31:20,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:31:20,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:31:20,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:31:20,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:31:20,214 INFO L87 Difference]: Start difference. First operand 300 states and 308 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-19 08:31:21,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:31:21,003 INFO L93 Difference]: Finished difference Result 592 states and 608 transitions. [2022-11-19 08:31:21,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:31:21,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-19 08:31:21,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:31:21,006 INFO L225 Difference]: With dead ends: 592 [2022-11-19 08:31:21,006 INFO L226 Difference]: Without dead ends: 464 [2022-11-19 08:31:21,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:31:21,009 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 160 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-19 08:31:21,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 200 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-19 08:31:21,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2022-11-19 08:31:21,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 444. [2022-11-19 08:31:21,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 306 states have (on average 1.5032679738562091) internal successors, (460), 443 states have internal predecessors, (460), 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-19 08:31:21,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 460 transitions. [2022-11-19 08:31:21,037 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 460 transitions. Word has length 8 [2022-11-19 08:31:21,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:31:21,037 INFO L495 AbstractCegarLoop]: Abstraction has 444 states and 460 transitions. [2022-11-19 08:31:21,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-19 08:31:21,038 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 460 transitions. [2022-11-19 08:31:21,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-19 08:31:21,039 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:31:21,039 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:31:21,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 08:31:21,040 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr144ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2022-11-19 08:31:21,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:31:21,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1023231597, now seen corresponding path program 1 times [2022-11-19 08:31:21,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:31:21,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370998982] [2022-11-19 08:31:21,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:31:21,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:31:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:31:21,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:31:21,222 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:31:21,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370998982] [2022-11-19 08:31:21,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370998982] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:31:21,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:31:21,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:31:21,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607558267] [2022-11-19 08:31:21,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:31:21,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:31:21,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:31:21,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:31:21,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:31:21,225 INFO L87 Difference]: Start difference. First operand 444 states and 460 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:31:21,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:31:21,586 INFO L93 Difference]: Finished difference Result 449 states and 465 transitions. [2022-11-19 08:31:21,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:31:21,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-19 08:31:21,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:31:21,588 INFO L225 Difference]: With dead ends: 449 [2022-11-19 08:31:21,589 INFO L226 Difference]: Without dead ends: 447 [2022-11-19 08:31:21,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:31:21,591 INFO L413 NwaCegarLoop]: 299 mSDtfsCounter, 3 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:31:21,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 627 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 08:31:21,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2022-11-19 08:31:21,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 447. [2022-11-19 08:31:21,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 309 states have (on average 1.4983818770226538) internal successors, (463), 446 states have internal predecessors, (463), 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-19 08:31:21,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 463 transitions. [2022-11-19 08:31:21,605 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 463 transitions. Word has length 21 [2022-11-19 08:31:21,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:31:21,606 INFO L495 AbstractCegarLoop]: Abstraction has 447 states and 463 transitions. [2022-11-19 08:31:21,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:31:21,606 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 463 transitions. [2022-11-19 08:31:21,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-19 08:31:21,608 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:31:21,608 INFO L195 NwaCegarLoop]: trace histogram [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-19 08:31:21,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 08:31:21,609 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr144ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2022-11-19 08:31:21,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:31:21,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1710049328, now seen corresponding path program 1 times [2022-11-19 08:31:21,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:31:21,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780235923] [2022-11-19 08:31:21,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:31:21,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:31:21,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:31:21,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:31:21,787 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:31:21,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780235923] [2022-11-19 08:31:21,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780235923] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:31:21,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891481453] [2022-11-19 08:31:21,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:31:21,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:31:21,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:31:21,798 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:31:21,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-19 08:31:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:31:21,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 08:31:21,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:31:21,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:31:21,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:31:22,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:31:22,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891481453] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:31:22,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [399315186] [2022-11-19 08:31:22,047 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2022-11-19 08:31:22,047 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 08:31:22,051 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 08:31:22,057 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 08:31:22,059 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 08:31:22,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:22,218 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-19 08:31:22,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 49 [2022-11-19 08:31:22,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:22,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2022-11-19 08:31:22,371 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 08:31:23,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [399315186] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:31:23,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:31:23,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5, 5] total 15 [2022-11-19 08:31:23,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38588232] [2022-11-19 08:31:23,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:31:23,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:31:23,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:31:23,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:31:23,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2022-11-19 08:31:23,107 INFO L87 Difference]: Start difference. First operand 447 states and 463 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:31:24,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:31:24,257 INFO L93 Difference]: Finished difference Result 839 states and 869 transitions. [2022-11-19 08:31:24,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:31:24,258 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-19 08:31:24,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:31:24,259 INFO L225 Difference]: With dead ends: 839 [2022-11-19 08:31:24,259 INFO L226 Difference]: Without dead ends: 403 [2022-11-19 08:31:24,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2022-11-19 08:31:24,261 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 543 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:31:24,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 223 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-19 08:31:24,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-11-19 08:31:24,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 399. [2022-11-19 08:31:24,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 277 states have (on average 1.4657039711191335) internal successors, (406), 398 states have internal predecessors, (406), 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-19 08:31:24,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 406 transitions. [2022-11-19 08:31:24,281 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 406 transitions. Word has length 24 [2022-11-19 08:31:24,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:31:24,282 INFO L495 AbstractCegarLoop]: Abstraction has 399 states and 406 transitions. [2022-11-19 08:31:24,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:31:24,282 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 406 transitions. [2022-11-19 08:31:24,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-19 08:31:24,283 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:31:24,283 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:31:24,306 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-19 08:31:24,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:31:24,488 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2022-11-19 08:31:24,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:31:24,489 INFO L85 PathProgramCache]: Analyzing trace with hash 428372734, now seen corresponding path program 1 times [2022-11-19 08:31:24,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:31:24,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809191804] [2022-11-19 08:31:24,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:31:24,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:31:24,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:31:24,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:31:24,622 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:31:24,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809191804] [2022-11-19 08:31:24,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809191804] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:31:24,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:31:24,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:31:24,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274719596] [2022-11-19 08:31:24,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:31:24,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:31:24,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:31:24,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:31:24,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:31:24,626 INFO L87 Difference]: Start difference. First operand 399 states and 406 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:31:25,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:31:25,166 INFO L93 Difference]: Finished difference Result 418 states and 425 transitions. [2022-11-19 08:31:25,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:31:25,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-19 08:31:25,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:31:25,168 INFO L225 Difference]: With dead ends: 418 [2022-11-19 08:31:25,169 INFO L226 Difference]: Without dead ends: 416 [2022-11-19 08:31:25,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:31:25,170 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 111 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-19 08:31:25,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 321 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-19 08:31:25,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2022-11-19 08:31:25,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 401. [2022-11-19 08:31:25,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 279 states have (on average 1.4623655913978495) internal successors, (408), 400 states have internal predecessors, (408), 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-19 08:31:25,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 408 transitions. [2022-11-19 08:31:25,194 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 408 transitions. Word has length 36 [2022-11-19 08:31:25,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:31:25,195 INFO L495 AbstractCegarLoop]: Abstraction has 401 states and 408 transitions. [2022-11-19 08:31:25,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:31:25,195 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 408 transitions. [2022-11-19 08:31:25,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-19 08:31:25,196 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:31:25,197 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:31:25,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-19 08:31:25,197 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2022-11-19 08:31:25,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:31:25,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1079103534, now seen corresponding path program 1 times [2022-11-19 08:31:25,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:31:25,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834873306] [2022-11-19 08:31:25,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:31:25,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:31:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:31:25,337 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:31:25,337 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:31:25,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834873306] [2022-11-19 08:31:25,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834873306] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:31:25,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4783956] [2022-11-19 08:31:25,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:31:25,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:31:25,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:31:25,340 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:31:25,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-19 08:31:25,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:31:25,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 08:31:25,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:31:25,547 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:31:25,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:31:25,657 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:31:25,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4783956] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:31:25,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [131674118] [2022-11-19 08:31:25,665 INFO L159 IcfgInterpreter]: Started Sifa with 38 locations of interest [2022-11-19 08:31:25,666 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 08:31:25,667 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 08:31:25,669 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 08:31:25,669 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 08:31:25,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:25,764 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-19 08:31:25,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 49 [2022-11-19 08:31:25,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:25,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2022-11-19 08:31:25,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:25,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 32 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 113 [2022-11-19 08:31:26,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:26,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 33 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 128 [2022-11-19 08:31:26,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:26,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 33 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 128 [2022-11-19 08:31:26,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:26,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 33 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 128 [2022-11-19 08:31:27,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:27,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:27,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:27,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:27,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:27,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:27,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:27,066 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:31:27,116 INFO L321 Elim1Store]: treesize reduction 94, result has 23.0 percent of original size [2022-11-19 08:31:27,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 35 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 13 case distinctions, treesize of input 555 treesize of output 550 [2022-11-19 08:31:27,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:27,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:27,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:27,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:27,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:27,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:27,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:27,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:27,665 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:31:27,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:27,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:27,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:27,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:27,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:27,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:27,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:27,709 INFO L321 Elim1Store]: treesize reduction 107, result has 6.1 percent of original size [2022-11-19 08:31:27,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 44 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 32 case distinctions, treesize of input 582 treesize of output 565 [2022-11-19 08:31:28,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:28,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:28,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:28,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:28,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:28,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:28,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:28,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:28,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:28,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:28,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:28,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:28,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:28,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:28,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:28,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:28,200 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:31:28,212 INFO L321 Elim1Store]: treesize reduction 58, result has 1.7 percent of original size [2022-11-19 08:31:28,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 45 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 31 case distinctions, treesize of input 582 treesize of output 565 [2022-11-19 08:31:28,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:28,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:28,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:28,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:28,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:28,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:28,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:28,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:28,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:28,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:28,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:28,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:28,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:28,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:28,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:28,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:28,644 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:31:28,658 INFO L321 Elim1Store]: treesize reduction 58, result has 1.7 percent of original size [2022-11-19 08:31:28,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 45 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 31 case distinctions, treesize of input 582 treesize of output 565 [2022-11-19 08:31:28,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:31:29,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:31:29,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:31:29,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:31:29,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:31:29,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:31:29,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:31:29,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:31:29,438 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 08:31:31,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [131674118] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:31:31,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:31:31,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 4, 4] total 16 [2022-11-19 08:31:31,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087779603] [2022-11-19 08:31:31,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:31:31,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-19 08:31:31,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:31:31,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-19 08:31:31,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-11-19 08:31:31,152 INFO L87 Difference]: Start difference. First operand 401 states and 408 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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-19 08:31:36,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:31:36,050 INFO L93 Difference]: Finished difference Result 608 states and 619 transitions. [2022-11-19 08:31:36,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-19 08:31:36,051 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-11-19 08:31:36,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:31:36,052 INFO L225 Difference]: With dead ends: 608 [2022-11-19 08:31:36,053 INFO L226 Difference]: Without dead ends: 375 [2022-11-19 08:31:36,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 104 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2022-11-19 08:31:36,054 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 648 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-19 08:31:36,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 188 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-19 08:31:36,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-11-19 08:31:36,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 340. [2022-11-19 08:31:36,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 248 states have (on average 1.3951612903225807) internal successors, (346), 339 states have internal predecessors, (346), 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-19 08:31:36,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 346 transitions. [2022-11-19 08:31:36,071 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 346 transitions. Word has length 42 [2022-11-19 08:31:36,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:31:36,071 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 346 transitions. [2022-11-19 08:31:36,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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-19 08:31:36,071 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 346 transitions. [2022-11-19 08:31:36,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-19 08:31:36,073 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:31:36,073 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:31:36,094 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-19 08:31:36,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:31:36,279 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2022-11-19 08:31:36,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:31:36,280 INFO L85 PathProgramCache]: Analyzing trace with hash 947001044, now seen corresponding path program 1 times [2022-11-19 08:31:36,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:31:36,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125470632] [2022-11-19 08:31:36,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:31:36,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:31:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:31:36,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 08:31:36,457 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:31:36,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125470632] [2022-11-19 08:31:36,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125470632] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:31:36,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:31:36,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:31:36,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379855563] [2022-11-19 08:31:36,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:31:36,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:31:36,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:31:36,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:31:36,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:31:36,459 INFO L87 Difference]: Start difference. First operand 340 states and 346 transitions. Second operand has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 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-19 08:31:36,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:31:36,901 INFO L93 Difference]: Finished difference Result 385 states and 391 transitions. [2022-11-19 08:31:36,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:31:36,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-11-19 08:31:36,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:31:36,903 INFO L225 Difference]: With dead ends: 385 [2022-11-19 08:31:36,903 INFO L226 Difference]: Without dead ends: 383 [2022-11-19 08:31:36,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:31:36,904 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 108 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 08:31:36,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 261 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 08:31:36,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-11-19 08:31:36,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 342. [2022-11-19 08:31:36,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 250 states have (on average 1.392) internal successors, (348), 341 states have internal predecessors, (348), 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-19 08:31:36,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 348 transitions. [2022-11-19 08:31:36,923 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 348 transitions. Word has length 74 [2022-11-19 08:31:36,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:31:36,924 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 348 transitions. [2022-11-19 08:31:36,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 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-19 08:31:36,924 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 348 transitions. [2022-11-19 08:31:36,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-19 08:31:36,927 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:31:36,927 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:31:36,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-19 08:31:36,928 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2022-11-19 08:31:36,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:31:36,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1103061592, now seen corresponding path program 1 times [2022-11-19 08:31:36,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:31:36,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474229006] [2022-11-19 08:31:36,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:31:36,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:31:36,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:31:37,076 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 08:31:37,076 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:31:37,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474229006] [2022-11-19 08:31:37,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474229006] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:31:37,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144761457] [2022-11-19 08:31:37,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:31:37,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:31:37,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:31:37,078 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:31:37,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-19 08:31:37,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:31:37,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 08:31:37,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:31:37,239 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 08:31:37,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:31:37,327 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 08:31:37,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144761457] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:31:37,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [149704459] [2022-11-19 08:31:37,331 INFO L159 IcfgInterpreter]: Started Sifa with 73 locations of interest [2022-11-19 08:31:37,331 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 08:31:37,331 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 08:31:37,332 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 08:31:37,332 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 08:31:37,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:37,431 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-19 08:31:37,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 49 [2022-11-19 08:31:37,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:37,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2022-11-19 08:31:37,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:37,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 32 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 113 [2022-11-19 08:31:37,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:37,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 33 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 128 [2022-11-19 08:31:37,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:37,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 33 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 128 [2022-11-19 08:31:37,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:37,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 33 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 128 [2022-11-19 08:31:38,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:38,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:38,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:38,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:38,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:38,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:38,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:38,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:38,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:38,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:38,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:38,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:38,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:38,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:38,433 INFO L321 Elim1Store]: treesize reduction 96, result has 13.5 percent of original size [2022-11-19 08:31:38,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 43 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 12 case distinctions, treesize of input 481 treesize of output 470 [2022-11-19 08:31:38,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:38,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:38,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:38,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:38,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:38,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:38,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:38,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:38,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:38,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:38,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:38,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:38,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:38,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:38,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:38,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:38,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:38,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:38,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:38,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:38,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:38,953 INFO L321 Elim1Store]: treesize reduction 113, result has 5.8 percent of original size [2022-11-19 08:31:38,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 52 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 31 case distinctions, treesize of input 502 treesize of output 485 [2022-11-19 08:31:39,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,355 INFO L321 Elim1Store]: treesize reduction 64, result has 1.5 percent of original size [2022-11-19 08:31:39,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 53 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 30 case distinctions, treesize of input 502 treesize of output 485 [2022-11-19 08:31:39,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:39,780 INFO L321 Elim1Store]: treesize reduction 64, result has 1.5 percent of original size [2022-11-19 08:31:39,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 53 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 30 case distinctions, treesize of input 502 treesize of output 485 [2022-11-19 08:31:40,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:31:40,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:31:40,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:31:40,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:31:40,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:31:40,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:31:40,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:31:40,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:31:40,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:31:40,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:31:41,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:31:41,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:31:41,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:31:41,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:31:41,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:31:41,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:31:41,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:31:41,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:31:41,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:31:41,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:31:41,483 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 08:31:44,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [149704459] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:31:44,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:31:44,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4, 4, 4] total 20 [2022-11-19 08:31:44,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952092263] [2022-11-19 08:31:44,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:31:44,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-19 08:31:44,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:31:44,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-19 08:31:44,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2022-11-19 08:31:44,853 INFO L87 Difference]: Start difference. First operand 342 states and 348 transitions. Second operand has 13 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 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-19 08:31:49,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:31:49,895 INFO L93 Difference]: Finished difference Result 384 states and 391 transitions. [2022-11-19 08:31:49,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-19 08:31:49,895 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2022-11-19 08:31:49,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:31:49,897 INFO L225 Difference]: With dead ends: 384 [2022-11-19 08:31:49,897 INFO L226 Difference]: Without dead ends: 354 [2022-11-19 08:31:49,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 181 SyntacticMatches, 42 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2022-11-19 08:31:49,899 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 695 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:31:49,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 132 Invalid, 1338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-19 08:31:49,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-11-19 08:31:49,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 281. [2022-11-19 08:31:49,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 219 states have (on average 1.3105022831050228) internal successors, (287), 280 states have internal predecessors, (287), 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-19 08:31:49,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 287 transitions. [2022-11-19 08:31:49,914 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 287 transitions. Word has length 80 [2022-11-19 08:31:49,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:31:49,915 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 287 transitions. [2022-11-19 08:31:49,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 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-19 08:31:49,915 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 287 transitions. [2022-11-19 08:31:49,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-11-19 08:31:49,917 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:31:49,917 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, 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, 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, 1, 1, 1, 1, 1] [2022-11-19 08:31:49,932 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-19 08:31:50,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:31:50,123 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr144ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2022-11-19 08:31:50,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:31:50,124 INFO L85 PathProgramCache]: Analyzing trace with hash 500565746, now seen corresponding path program 1 times [2022-11-19 08:31:50,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:31:50,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474471332] [2022-11-19 08:31:50,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:31:50,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:31:50,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:31:50,339 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 08:31:50,340 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:31:50,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474471332] [2022-11-19 08:31:50,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474471332] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:31:50,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665241183] [2022-11-19 08:31:50,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:31:50,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:31:50,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:31:50,342 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:31:50,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-19 08:31:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:31:50,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 08:31:50,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:31:50,696 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-19 08:31:50,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:31:51,013 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-19 08:31:51,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665241183] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:31:51,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [683977374] [2022-11-19 08:31:51,017 INFO L159 IcfgInterpreter]: Started Sifa with 85 locations of interest [2022-11-19 08:31:51,018 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 08:31:51,018 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 08:31:51,019 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 08:31:51,019 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 08:31:51,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:51,121 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-19 08:31:51,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 49 [2022-11-19 08:31:51,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:51,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2022-11-19 08:31:51,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:51,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 32 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 113 [2022-11-19 08:31:51,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:51,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 33 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 128 [2022-11-19 08:31:51,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:51,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 33 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 128 [2022-11-19 08:31:51,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:51,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 33 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 128 [2022-11-19 08:31:51,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:51,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:51,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:51,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:51,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:51,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:51,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:51,990 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:31:52,027 INFO L321 Elim1Store]: treesize reduction 94, result has 23.0 percent of original size [2022-11-19 08:31:52,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 35 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 13 case distinctions, treesize of input 490 treesize of output 485 [2022-11-19 08:31:52,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:52,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:52,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:52,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:52,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:52,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:52,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:52,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:52,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:52,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:52,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:52,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:52,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:52,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:52,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:52,654 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:31:52,676 INFO L321 Elim1Store]: treesize reduction 107, result has 6.1 percent of original size [2022-11-19 08:31:52,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 44 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 32 case distinctions, treesize of input 983 treesize of output 886 [2022-11-19 08:31:53,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:53,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:53,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:53,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:53,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:53,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:53,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:53,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:53,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:53,266 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:31:53,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:53,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:53,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:53,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:53,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:53,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:53,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:53,288 INFO L321 Elim1Store]: treesize reduction 58, result has 1.7 percent of original size [2022-11-19 08:31:53,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 45 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 31 case distinctions, treesize of input 983 treesize of output 886 [2022-11-19 08:31:54,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:54,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:54,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:54,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:54,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:54,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:54,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:54,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:54,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:54,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:54,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:54,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:54,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:54,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:54,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:54,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:54,029 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:31:54,040 INFO L321 Elim1Store]: treesize reduction 58, result has 1.7 percent of original size [2022-11-19 08:31:54,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 45 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 31 case distinctions, treesize of input 983 treesize of output 886 [2022-11-19 08:31:54,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:31:54,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:31:54,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:31:54,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:31:54,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:31:54,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:31:54,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:31:54,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:31:54,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:31:54,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:31:54,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:31:54,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:31:55,000 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-19 08:31:55,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 227 treesize of output 232 [2022-11-19 08:31:55,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:55,160 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-19 08:31:55,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 435 treesize of output 428 [2022-11-19 08:31:55,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:55,323 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-19 08:31:55,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 435 treesize of output 428 [2022-11-19 08:31:55,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:55,483 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-19 08:31:55,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 435 treesize of output 428 [2022-11-19 08:31:55,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:31:55,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:31:55,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:31:55,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:31:55,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:31:55,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:31:55,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:31:55,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:31:56,368 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 08:32:01,695 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9176#(and (= |ULTIMATE.start_main_~CCCELVOL3~0#1| 7) (< 2147483646 |ULTIMATE.start_main_#t~post21#1|) (= |ULTIMATE.start_main_~CCCELVOL4~0#1| 5) (<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|) (= 2 |ULTIMATE.start_main_~MINVAL~0#1|) (<= ~CELLCOUNT~0 2147483647) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |ULTIMATE.start_main_~CCCELVOL1~0#1| 1) (<= 1 ~CELLCOUNT~0) (= |ULTIMATE.start_main_~#volArray~0#1.offset| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= |ULTIMATE.start___VERIFIER_assert_~cond#1| 1) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= |ULTIMATE.start_main_~CCCELVOL2~0#1| 3) (<= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 1) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#volArray~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-19 08:32:01,695 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 08:32:01,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:32:01,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-19 08:32:01,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430533980] [2022-11-19 08:32:01,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:32:01,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-19 08:32:01,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:32:01,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-19 08:32:01,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2022-11-19 08:32:01,698 INFO L87 Difference]: Start difference. First operand 281 states and 287 transitions. Second operand has 10 states, 10 states have (on average 17.9) internal successors, (179), 10 states have internal predecessors, (179), 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-19 08:32:02,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:32:02,575 INFO L93 Difference]: Finished difference Result 461 states and 470 transitions. [2022-11-19 08:32:02,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-19 08:32:02,576 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.9) internal successors, (179), 10 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2022-11-19 08:32:02,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:32:02,578 INFO L225 Difference]: With dead ends: 461 [2022-11-19 08:32:02,578 INFO L226 Difference]: Without dead ends: 355 [2022-11-19 08:32:02,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 209 SyntacticMatches, 44 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 803 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=210, Invalid=1272, Unknown=0, NotChecked=0, Total=1482 [2022-11-19 08:32:02,580 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 849 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-19 08:32:02,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 93 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-19 08:32:02,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-11-19 08:32:02,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 283. [2022-11-19 08:32:02,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 221 states have (on average 1.2986425339366516) internal successors, (287), 282 states have internal predecessors, (287), 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-19 08:32:02,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 287 transitions. [2022-11-19 08:32:02,599 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 287 transitions. Word has length 92 [2022-11-19 08:32:02,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:32:02,599 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 287 transitions. [2022-11-19 08:32:02,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.9) internal successors, (179), 10 states have internal predecessors, (179), 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-19 08:32:02,600 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 287 transitions. [2022-11-19 08:32:02,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-11-19 08:32:02,601 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:32:02,601 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, 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, 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, 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-19 08:32:02,611 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-19 08:32:02,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-19 08:32:02,807 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2022-11-19 08:32:02,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:32:02,808 INFO L85 PathProgramCache]: Analyzing trace with hash -887138007, now seen corresponding path program 1 times [2022-11-19 08:32:02,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:32:02,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181821783] [2022-11-19 08:32:02,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:32:02,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:32:02,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:32:02,939 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-19 08:32:02,939 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:32:02,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181821783] [2022-11-19 08:32:02,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181821783] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:32:02,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:32:02,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:32:02,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192521343] [2022-11-19 08:32:02,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:32:02,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:32:02,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:32:02,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:32:02,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:32:02,942 INFO L87 Difference]: Start difference. First operand 283 states and 287 transitions. Second operand has 4 states, 3 states have (on average 36.0) internal successors, (108), 4 states have internal predecessors, (108), 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-19 08:32:03,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:32:03,352 INFO L93 Difference]: Finished difference Result 353 states and 357 transitions. [2022-11-19 08:32:03,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:32:03,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 36.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2022-11-19 08:32:03,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:32:03,354 INFO L225 Difference]: With dead ends: 353 [2022-11-19 08:32:03,354 INFO L226 Difference]: Without dead ends: 351 [2022-11-19 08:32:03,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:32:03,355 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 104 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 08:32:03,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 203 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 08:32:03,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-11-19 08:32:03,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 285. [2022-11-19 08:32:03,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 223 states have (on average 1.295964125560538) internal successors, (289), 284 states have internal predecessors, (289), 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-19 08:32:03,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 289 transitions. [2022-11-19 08:32:03,374 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 289 transitions. Word has length 112 [2022-11-19 08:32:03,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:32:03,374 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 289 transitions. [2022-11-19 08:32:03,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 36.0) internal successors, (108), 4 states have internal predecessors, (108), 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-19 08:32:03,375 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 289 transitions. [2022-11-19 08:32:03,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-11-19 08:32:03,379 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:32:03,380 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, 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, 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, 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-19 08:32:03,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-19 08:32:03,380 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2022-11-19 08:32:03,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:32:03,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1763675837, now seen corresponding path program 1 times [2022-11-19 08:32:03,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:32:03,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104379795] [2022-11-19 08:32:03,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:32:03,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:32:03,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:32:03,565 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 08:32:03,565 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:32:03,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104379795] [2022-11-19 08:32:03,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104379795] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:32:03,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712194276] [2022-11-19 08:32:03,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:32:03,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:32:03,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:32:03,585 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:32:03,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-19 08:32:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:32:03,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 08:32:03,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:32:03,782 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 08:32:03,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:32:03,860 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 08:32:03,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712194276] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:32:03,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1411120331] [2022-11-19 08:32:03,869 INFO L159 IcfgInterpreter]: Started Sifa with 108 locations of interest [2022-11-19 08:32:03,869 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 08:32:03,870 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 08:32:03,870 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 08:32:03,871 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 08:32:03,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:04,023 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-19 08:32:04,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 49 [2022-11-19 08:32:04,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:04,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2022-11-19 08:32:04,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:04,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 32 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 113 [2022-11-19 08:32:04,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:04,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 33 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 128 [2022-11-19 08:32:04,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:04,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 33 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 128 [2022-11-19 08:32:04,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:04,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 33 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 128 [2022-11-19 08:32:04,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:04,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:04,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:04,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:04,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:04,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:04,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:04,896 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:32:04,940 INFO L321 Elim1Store]: treesize reduction 94, result has 23.0 percent of original size [2022-11-19 08:32:04,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 35 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 13 case distinctions, treesize of input 490 treesize of output 485 [2022-11-19 08:32:05,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:05,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:05,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:05,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:05,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:05,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:05,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:05,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:05,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:05,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:05,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:05,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:05,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:05,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:05,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:05,430 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:32:05,461 INFO L321 Elim1Store]: treesize reduction 107, result has 6.1 percent of original size [2022-11-19 08:32:05,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 44 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 32 case distinctions, treesize of input 517 treesize of output 500 [2022-11-19 08:32:05,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:05,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:05,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:05,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:05,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:05,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:05,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:05,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:05,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:05,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:05,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:05,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:05,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:05,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:05,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:05,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:05,835 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:32:05,848 INFO L321 Elim1Store]: treesize reduction 58, result has 1.7 percent of original size [2022-11-19 08:32:05,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 45 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 31 case distinctions, treesize of input 517 treesize of output 500 [2022-11-19 08:32:06,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:06,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:06,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:06,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:06,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:06,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:06,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:06,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:06,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:06,181 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:32:06,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:06,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:06,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:06,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:06,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:06,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:06,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:06,204 INFO L321 Elim1Store]: treesize reduction 58, result has 1.7 percent of original size [2022-11-19 08:32:06,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 45 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 31 case distinctions, treesize of input 517 treesize of output 500 [2022-11-19 08:32:06,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:32:06,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:06,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:06,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:06,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:32:06,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:06,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:06,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:06,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:32:06,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:06,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:06,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:06,948 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-19 08:32:06,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 227 treesize of output 232 [2022-11-19 08:32:07,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:07,109 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-19 08:32:07,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 435 treesize of output 428 [2022-11-19 08:32:07,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:07,278 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-19 08:32:07,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 435 treesize of output 428 [2022-11-19 08:32:07,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:07,425 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-19 08:32:07,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 435 treesize of output 428 [2022-11-19 08:32:07,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:32:07,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:07,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:07,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:07,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:32:07,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:07,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:07,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:08,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:32:08,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:08,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:08,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:08,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:08,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2022-11-19 08:32:08,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-19 08:32:08,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-19 08:32:08,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-19 08:32:08,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:32:08,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-19 08:32:08,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-19 08:32:09,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-19 08:32:09,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:32:09,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-19 08:32:09,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-19 08:32:09,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-19 08:32:09,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:32:09,680 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 08:32:15,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1411120331] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:32:15,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:32:15,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [4, 4, 4] total 26 [2022-11-19 08:32:15,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286668439] [2022-11-19 08:32:15,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:32:15,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-19 08:32:15,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:32:15,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-19 08:32:15,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2022-11-19 08:32:15,177 INFO L87 Difference]: Start difference. First operand 285 states and 289 transitions. Second operand has 19 states, 18 states have (on average 6.111111111111111) internal successors, (110), 18 states have internal predecessors, (110), 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-19 08:32:24,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:32:24,303 INFO L93 Difference]: Finished difference Result 320 states and 324 transitions. [2022-11-19 08:32:24,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-19 08:32:24,304 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 6.111111111111111) internal successors, (110), 18 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2022-11-19 08:32:24,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:32:24,306 INFO L225 Difference]: With dead ends: 320 [2022-11-19 08:32:24,306 INFO L226 Difference]: Without dead ends: 290 [2022-11-19 08:32:24,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 259 SyntacticMatches, 72 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=357, Invalid=1535, Unknown=0, NotChecked=0, Total=1892 [2022-11-19 08:32:24,307 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 1195 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1195 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 1538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-19 08:32:24,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1195 Valid, 79 Invalid, 1538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-19 08:32:24,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-11-19 08:32:24,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 224. [2022-11-19 08:32:24,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 192 states have (on average 1.1875) internal successors, (228), 223 states have internal predecessors, (228), 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-19 08:32:24,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 228 transitions. [2022-11-19 08:32:24,323 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 228 transitions. Word has length 118 [2022-11-19 08:32:24,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:32:24,324 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 228 transitions. [2022-11-19 08:32:24,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 6.111111111111111) internal successors, (110), 18 states have internal predecessors, (110), 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-19 08:32:24,324 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 228 transitions. [2022-11-19 08:32:24,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-11-19 08:32:24,326 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:32:24,326 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:32:24,341 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-19 08:32:24,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-19 08:32:24,531 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr142ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2022-11-19 08:32:24,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:32:24,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1827392149, now seen corresponding path program 1 times [2022-11-19 08:32:24,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:32:24,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698926814] [2022-11-19 08:32:24,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:32:24,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:32:24,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:32:24,741 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-19 08:32:24,741 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:32:24,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698926814] [2022-11-19 08:32:24,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698926814] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:32:24,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:32:24,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:32:24,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891967611] [2022-11-19 08:32:24,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:32:24,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:32:24,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:32:24,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:32:24,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:32:24,744 INFO L87 Difference]: Start difference. First operand 224 states and 228 transitions. Second operand has 4 states, 3 states have (on average 48.0) internal successors, (144), 4 states have internal predecessors, (144), 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-19 08:32:25,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:32:25,118 INFO L93 Difference]: Finished difference Result 321 states and 325 transitions. [2022-11-19 08:32:25,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:32:25,119 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 48.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2022-11-19 08:32:25,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:32:25,120 INFO L225 Difference]: With dead ends: 321 [2022-11-19 08:32:25,120 INFO L226 Difference]: Without dead ends: 319 [2022-11-19 08:32:25,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:32:25,121 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 102 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:32:25,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 141 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 08:32:25,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-11-19 08:32:25,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 226. [2022-11-19 08:32:25,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 194 states have (on average 1.1855670103092784) internal successors, (230), 225 states have internal predecessors, (230), 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-19 08:32:25,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 230 transitions. [2022-11-19 08:32:25,136 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 230 transitions. Word has length 150 [2022-11-19 08:32:25,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:32:25,137 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 230 transitions. [2022-11-19 08:32:25,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 48.0) internal successors, (144), 4 states have internal predecessors, (144), 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-19 08:32:25,137 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 230 transitions. [2022-11-19 08:32:25,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-11-19 08:32:25,139 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:32:25,139 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1] [2022-11-19 08:32:25,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-19 08:32:25,139 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2022-11-19 08:32:25,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:32:25,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1969998529, now seen corresponding path program 1 times [2022-11-19 08:32:25,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:32:25,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609823060] [2022-11-19 08:32:25,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:32:25,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:32:25,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:32:25,336 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-19 08:32:25,336 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:32:25,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609823060] [2022-11-19 08:32:25,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609823060] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:32:25,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951795984] [2022-11-19 08:32:25,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:32:25,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:32:25,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:32:25,339 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:32:25,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-19 08:32:25,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:32:25,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 08:32:25,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:32:25,531 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-19 08:32:25,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:32:25,615 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-19 08:32:25,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951795984] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:32:25,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1953611581] [2022-11-19 08:32:25,619 INFO L159 IcfgInterpreter]: Started Sifa with 143 locations of interest [2022-11-19 08:32:25,619 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 08:32:25,619 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 08:32:25,620 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 08:32:25,620 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 08:32:26,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:26,052 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-11-19 08:32:26,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 42 [2022-11-19 08:32:26,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:26,101 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-19 08:32:26,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 49 [2022-11-19 08:32:26,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:26,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 32 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 113 [2022-11-19 08:32:26,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:26,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 33 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 128 [2022-11-19 08:32:26,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:26,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 33 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 128 [2022-11-19 08:32:26,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:26,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 33 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 128 [2022-11-19 08:32:26,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:26,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:26,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:26,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:26,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:26,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:26,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:26,760 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:32:26,799 INFO L321 Elim1Store]: treesize reduction 94, result has 23.0 percent of original size [2022-11-19 08:32:26,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 35 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 13 case distinctions, treesize of input 490 treesize of output 485 [2022-11-19 08:32:27,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:27,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:27,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:27,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:27,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:27,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:27,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:27,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:27,424 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:32:27,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:27,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:27,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:27,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:27,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:27,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:27,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:27,460 INFO L321 Elim1Store]: treesize reduction 107, result has 6.1 percent of original size [2022-11-19 08:32:27,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 44 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 32 case distinctions, treesize of input 983 treesize of output 886 [2022-11-19 08:32:28,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:28,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:28,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:28,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:28,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:28,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:28,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:28,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:28,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:28,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:28,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:28,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:28,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:28,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:28,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:28,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:28,055 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:32:28,080 INFO L321 Elim1Store]: treesize reduction 58, result has 1.7 percent of original size [2022-11-19 08:32:28,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 45 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 31 case distinctions, treesize of input 983 treesize of output 886 [2022-11-19 08:32:28,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:28,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:28,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:28,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:28,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:28,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:28,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:28,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:28,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:28,726 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:32:28,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:28,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:28,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:28,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:28,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:28,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:28,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:28,750 INFO L321 Elim1Store]: treesize reduction 58, result has 1.7 percent of original size [2022-11-19 08:32:28,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 45 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 31 case distinctions, treesize of input 983 treesize of output 886 [2022-11-19 08:32:29,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:32:29,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:29,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:29,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:29,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:32:29,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:29,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:29,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:29,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:32:29,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:29,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:29,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:29,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 238 [2022-11-19 08:32:29,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 243 [2022-11-19 08:32:29,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 243 [2022-11-19 08:32:29,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 243 [2022-11-19 08:32:30,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:32:30,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:30,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:30,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:30,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:32:30,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:30,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:30,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:30,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:32:30,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:30,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:30,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:30,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-11-19 08:32:30,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-19 08:32:30,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-19 08:32:30,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-19 08:32:31,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:32:31,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-19 08:32:31,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-19 08:32:31,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-19 08:32:31,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:32:31,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-19 08:32:31,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-19 08:32:31,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-19 08:32:31,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:32:31,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:31,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:32,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:32,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-11-19 08:32:32,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2022-11-19 08:32:32,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2022-11-19 08:32:32,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-19 08:32:32,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:32:32,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:32,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:32,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-19 08:32:32,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:32:32,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:32,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:32,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-19 08:32:32,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:32:33,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:33,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:33,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:32:33,292 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 08:32:40,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1953611581] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:32:40,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:32:40,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [4, 4, 4] total 28 [2022-11-19 08:32:40,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092724590] [2022-11-19 08:32:40,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:32:40,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-19 08:32:40,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:32:40,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-19 08:32:40,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2022-11-19 08:32:40,753 INFO L87 Difference]: Start difference. First operand 226 states and 230 transitions. Second operand has 21 states, 20 states have (on average 7.3) internal successors, (146), 20 states have internal predecessors, (146), 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-19 08:32:51,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:32:51,549 INFO L93 Difference]: Finished difference Result 288 states and 292 transitions. [2022-11-19 08:32:51,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-19 08:32:51,550 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 7.3) internal successors, (146), 20 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156 [2022-11-19 08:32:51,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:32:51,552 INFO L225 Difference]: With dead ends: 288 [2022-11-19 08:32:51,552 INFO L226 Difference]: Without dead ends: 258 [2022-11-19 08:32:51,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 338 SyntacticMatches, 105 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2418 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=434, Invalid=2016, Unknown=0, NotChecked=0, Total=2450 [2022-11-19 08:32:51,554 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 1018 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 1319 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1018 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 1479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 1319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:32:51,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1018 Valid, 26 Invalid, 1479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 1319 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-19 08:32:51,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-11-19 08:32:51,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 165. [2022-11-19 08:32:51,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 163 states have (on average 1.0368098159509203) internal successors, (169), 164 states have internal predecessors, (169), 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-19 08:32:51,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 169 transitions. [2022-11-19 08:32:51,569 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 169 transitions. Word has length 156 [2022-11-19 08:32:51,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:32:51,570 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 169 transitions. [2022-11-19 08:32:51,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 7.3) internal successors, (146), 20 states have internal predecessors, (146), 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-19 08:32:51,570 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 169 transitions. [2022-11-19 08:32:51,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-11-19 08:32:51,572 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:32:51,572 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1] [2022-11-19 08:32:51,578 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-19 08:32:51,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-19 08:32:51,779 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr145ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2022-11-19 08:32:51,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:32:51,779 INFO L85 PathProgramCache]: Analyzing trace with hash -985183260, now seen corresponding path program 1 times [2022-11-19 08:32:51,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:32:51,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185972306] [2022-11-19 08:32:51,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:32:51,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:32:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:32:52,001 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-19 08:32:52,002 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:32:52,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185972306] [2022-11-19 08:32:52,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185972306] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:32:52,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099809182] [2022-11-19 08:32:52,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:32:52,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:32:52,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:32:52,007 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:32:52,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-19 08:32:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:32:52,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 08:32:52,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:32:52,175 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-19 08:32:52,175 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:32:52,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099809182] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:32:52,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 08:32:52,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-19 08:32:52,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028280327] [2022-11-19 08:32:52,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:32:52,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:32:52,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:32:52,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:32:52,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-19 08:32:52,178 INFO L87 Difference]: Start difference. First operand 165 states and 169 transitions. Second operand has 6 states, 5 states have (on average 30.6) internal successors, (153), 6 states have internal predecessors, (153), 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-19 08:32:52,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:32:52,491 INFO L93 Difference]: Finished difference Result 289 states and 293 transitions. [2022-11-19 08:32:52,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:32:52,491 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 30.6) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2022-11-19 08:32:52,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:32:52,493 INFO L225 Difference]: With dead ends: 289 [2022-11-19 08:32:52,493 INFO L226 Difference]: Without dead ends: 288 [2022-11-19 08:32:52,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-11-19 08:32:52,494 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 272 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:32:52,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 74 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 08:32:52,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-11-19 08:32:52,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 164. [2022-11-19 08:32:52,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 1.030674846625767) internal successors, (168), 163 states have internal predecessors, (168), 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-19 08:32:52,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 168 transitions. [2022-11-19 08:32:52,511 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 168 transitions. Word has length 161 [2022-11-19 08:32:52,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:32:52,512 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 168 transitions. [2022-11-19 08:32:52,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 30.6) internal successors, (153), 6 states have internal predecessors, (153), 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-19 08:32:52,512 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 168 transitions. [2022-11-19 08:32:52,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-11-19 08:32:52,514 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:32:52,514 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:32:52,522 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-19 08:32:52,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-19 08:32:52,720 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr144ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2022-11-19 08:32:52,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:32:52,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1868292572, now seen corresponding path program 1 times [2022-11-19 08:32:52,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:32:52,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236821384] [2022-11-19 08:32:52,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:32:52,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:32:52,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:32:53,022 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-19 08:32:53,023 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:32:53,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236821384] [2022-11-19 08:32:53,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236821384] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:32:53,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994773657] [2022-11-19 08:32:53,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:32:53,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:32:53,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:32:53,025 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:32:53,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-19 08:32:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:32:53,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-19 08:32:53,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:32:53,225 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-19 08:32:53,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:32:53,290 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-19 08:32:53,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994773657] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:32:53,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1747573502] [2022-11-19 08:32:53,294 INFO L159 IcfgInterpreter]: Started Sifa with 147 locations of interest [2022-11-19 08:32:53,294 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 08:32:53,295 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 08:32:53,295 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 08:32:53,295 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 08:32:53,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:53,704 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-19 08:32:53,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 49 [2022-11-19 08:32:53,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:53,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2022-11-19 08:32:53,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:53,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 32 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 113 [2022-11-19 08:32:53,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:53,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 33 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 128 [2022-11-19 08:32:53,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:53,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 33 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 128 [2022-11-19 08:32:54,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:54,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 33 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 128 [2022-11-19 08:32:54,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:54,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:54,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:54,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:54,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:54,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:54,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:54,331 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:32:54,370 INFO L321 Elim1Store]: treesize reduction 94, result has 23.0 percent of original size [2022-11-19 08:32:54,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 35 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 13 case distinctions, treesize of input 490 treesize of output 485 [2022-11-19 08:32:54,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:54,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:54,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:54,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:54,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:54,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:54,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:54,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:54,995 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:32:54,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:54,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:54,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:55,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:55,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:55,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:55,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:55,026 INFO L321 Elim1Store]: treesize reduction 107, result has 6.1 percent of original size [2022-11-19 08:32:55,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 44 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 32 case distinctions, treesize of input 983 treesize of output 886 [2022-11-19 08:32:55,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:55,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:55,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:55,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:55,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:55,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:55,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:55,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:55,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:55,590 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:32:55,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:55,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:55,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:55,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:55,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:55,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:55,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:55,610 INFO L321 Elim1Store]: treesize reduction 58, result has 1.7 percent of original size [2022-11-19 08:32:55,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 45 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 31 case distinctions, treesize of input 983 treesize of output 886 [2022-11-19 08:32:56,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:56,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:56,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:56,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:56,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:56,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:56,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:56,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:56,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:56,180 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:32:56,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:56,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:56,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:56,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:56,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:56,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:56,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:56,199 INFO L321 Elim1Store]: treesize reduction 58, result has 1.7 percent of original size [2022-11-19 08:32:56,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 45 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 31 case distinctions, treesize of input 983 treesize of output 886 [2022-11-19 08:32:56,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:32:56,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:56,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:56,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:56,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:32:56,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:56,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:56,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:56,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:32:56,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:56,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:56,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:56,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 238 [2022-11-19 08:32:57,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 243 [2022-11-19 08:32:57,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 243 [2022-11-19 08:32:57,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 243 [2022-11-19 08:32:57,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:32:57,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:57,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:57,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:57,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:32:57,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:57,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:57,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:57,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:32:57,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:57,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:57,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:57,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-11-19 08:32:58,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-19 08:32:58,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-19 08:32:58,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-19 08:32:58,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:32:58,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-19 08:32:58,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-19 08:32:58,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-19 08:32:58,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:32:58,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-19 08:32:58,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-19 08:32:58,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-19 08:32:58,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:32:58,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:58,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:59,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:59,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:59,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2022-11-19 08:32:59,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:59,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:59,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2022-11-19 08:32:59,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:59,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:59,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2022-11-19 08:32:59,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-19 08:32:59,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:32:59,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:59,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:59,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-19 08:32:59,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:32:59,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:32:59,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-19 08:33:00,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 08:33:00,168 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 08:33:08,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1747573502] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:33:08,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:33:08,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [7, 7, 7] total 36 [2022-11-19 08:33:08,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069678400] [2022-11-19 08:33:08,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:33:08,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-19 08:33:08,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:33:08,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-19 08:33:08,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1103, Unknown=0, NotChecked=0, Total=1332 [2022-11-19 08:33:08,739 INFO L87 Difference]: Start difference. First operand 164 states and 168 transitions. Second operand has 23 states, 22 states have (on average 6.863636363636363) internal successors, (151), 22 states have internal predecessors, (151), 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-19 08:33:21,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:33:21,311 INFO L93 Difference]: Finished difference Result 257 states and 261 transitions. [2022-11-19 08:33:21,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-19 08:33:21,312 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 6.863636363636363) internal successors, (151), 22 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 163 [2022-11-19 08:33:21,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:33:21,312 INFO L225 Difference]: With dead ends: 257 [2022-11-19 08:33:21,313 INFO L226 Difference]: Without dead ends: 0 [2022-11-19 08:33:21,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 352 SyntacticMatches, 107 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3949 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=675, Invalid=3107, Unknown=0, NotChecked=0, Total=3782 [2022-11-19 08:33:21,315 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 754 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1728 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 1816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-19 08:33:21,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 4 Invalid, 1816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1728 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-19 08:33:21,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-19 08:33:21,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-19 08:33:21,320 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-19 08:33:21,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-19 08:33:21,320 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 163 [2022-11-19 08:33:21,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:33:21,321 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-19 08:33:21,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 6.863636363636363) internal successors, (151), 22 states have internal predecessors, (151), 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-19 08:33:21,321 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-19 08:33:21,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-19 08:33:21,324 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (145 of 146 remaining) [2022-11-19 08:33:21,325 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (144 of 146 remaining) [2022-11-19 08:33:21,325 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (143 of 146 remaining) [2022-11-19 08:33:21,325 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (142 of 146 remaining) [2022-11-19 08:33:21,325 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (141 of 146 remaining) [2022-11-19 08:33:21,326 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (140 of 146 remaining) [2022-11-19 08:33:21,326 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (139 of 146 remaining) [2022-11-19 08:33:21,326 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (138 of 146 remaining) [2022-11-19 08:33:21,326 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (137 of 146 remaining) [2022-11-19 08:33:21,327 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (136 of 146 remaining) [2022-11-19 08:33:21,327 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (135 of 146 remaining) [2022-11-19 08:33:21,327 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (134 of 146 remaining) [2022-11-19 08:33:21,327 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (133 of 146 remaining) [2022-11-19 08:33:21,327 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (132 of 146 remaining) [2022-11-19 08:33:21,328 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (131 of 146 remaining) [2022-11-19 08:33:21,328 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (130 of 146 remaining) [2022-11-19 08:33:21,328 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (129 of 146 remaining) [2022-11-19 08:33:21,328 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (128 of 146 remaining) [2022-11-19 08:33:21,328 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (127 of 146 remaining) [2022-11-19 08:33:21,329 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (126 of 146 remaining) [2022-11-19 08:33:21,329 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (125 of 146 remaining) [2022-11-19 08:33:21,329 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (124 of 146 remaining) [2022-11-19 08:33:21,329 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (123 of 146 remaining) [2022-11-19 08:33:21,329 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (122 of 146 remaining) [2022-11-19 08:33:21,330 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (121 of 146 remaining) [2022-11-19 08:33:21,330 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (120 of 146 remaining) [2022-11-19 08:33:21,330 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (119 of 146 remaining) [2022-11-19 08:33:21,330 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (118 of 146 remaining) [2022-11-19 08:33:21,331 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (117 of 146 remaining) [2022-11-19 08:33:21,331 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (116 of 146 remaining) [2022-11-19 08:33:21,331 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (115 of 146 remaining) [2022-11-19 08:33:21,331 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (114 of 146 remaining) [2022-11-19 08:33:21,331 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (113 of 146 remaining) [2022-11-19 08:33:21,332 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (112 of 146 remaining) [2022-11-19 08:33:21,332 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (111 of 146 remaining) [2022-11-19 08:33:21,332 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (110 of 146 remaining) [2022-11-19 08:33:21,332 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (109 of 146 remaining) [2022-11-19 08:33:21,332 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (108 of 146 remaining) [2022-11-19 08:33:21,333 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (107 of 146 remaining) [2022-11-19 08:33:21,333 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (106 of 146 remaining) [2022-11-19 08:33:21,333 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (105 of 146 remaining) [2022-11-19 08:33:21,333 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (104 of 146 remaining) [2022-11-19 08:33:21,334 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (103 of 146 remaining) [2022-11-19 08:33:21,334 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (102 of 146 remaining) [2022-11-19 08:33:21,334 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (101 of 146 remaining) [2022-11-19 08:33:21,334 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (100 of 146 remaining) [2022-11-19 08:33:21,334 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (99 of 146 remaining) [2022-11-19 08:33:21,335 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (98 of 146 remaining) [2022-11-19 08:33:21,335 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 146 remaining) [2022-11-19 08:33:21,335 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 146 remaining) [2022-11-19 08:33:21,335 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 146 remaining) [2022-11-19 08:33:21,336 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 146 remaining) [2022-11-19 08:33:21,336 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 146 remaining) [2022-11-19 08:33:21,336 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 146 remaining) [2022-11-19 08:33:21,336 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 146 remaining) [2022-11-19 08:33:21,336 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 146 remaining) [2022-11-19 08:33:21,337 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 146 remaining) [2022-11-19 08:33:21,337 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 146 remaining) [2022-11-19 08:33:21,337 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 146 remaining) [2022-11-19 08:33:21,337 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 146 remaining) [2022-11-19 08:33:21,338 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 146 remaining) [2022-11-19 08:33:21,338 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 146 remaining) [2022-11-19 08:33:21,338 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 146 remaining) [2022-11-19 08:33:21,338 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 146 remaining) [2022-11-19 08:33:21,338 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 146 remaining) [2022-11-19 08:33:21,339 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 146 remaining) [2022-11-19 08:33:21,339 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 146 remaining) [2022-11-19 08:33:21,339 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 146 remaining) [2022-11-19 08:33:21,339 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 146 remaining) [2022-11-19 08:33:21,339 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 146 remaining) [2022-11-19 08:33:21,340 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 146 remaining) [2022-11-19 08:33:21,340 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 146 remaining) [2022-11-19 08:33:21,340 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 146 remaining) [2022-11-19 08:33:21,340 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 146 remaining) [2022-11-19 08:33:21,341 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 146 remaining) [2022-11-19 08:33:21,341 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 146 remaining) [2022-11-19 08:33:21,341 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 146 remaining) [2022-11-19 08:33:21,341 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 146 remaining) [2022-11-19 08:33:21,341 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 146 remaining) [2022-11-19 08:33:21,342 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 146 remaining) [2022-11-19 08:33:21,342 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 146 remaining) [2022-11-19 08:33:21,342 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 146 remaining) [2022-11-19 08:33:21,342 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 146 remaining) [2022-11-19 08:33:21,343 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 146 remaining) [2022-11-19 08:33:21,343 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 146 remaining) [2022-11-19 08:33:21,343 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 146 remaining) [2022-11-19 08:33:21,343 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 146 remaining) [2022-11-19 08:33:21,343 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr87ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 146 remaining) [2022-11-19 08:33:21,344 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr88ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 146 remaining) [2022-11-19 08:33:21,344 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr89ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 146 remaining) [2022-11-19 08:33:21,344 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 146 remaining) [2022-11-19 08:33:21,344 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 146 remaining) [2022-11-19 08:33:21,344 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 146 remaining) [2022-11-19 08:33:21,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr93ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 146 remaining) [2022-11-19 08:33:21,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr94ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 146 remaining) [2022-11-19 08:33:21,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr95ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 146 remaining) [2022-11-19 08:33:21,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 146 remaining) [2022-11-19 08:33:21,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 146 remaining) [2022-11-19 08:33:21,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr98ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 146 remaining) [2022-11-19 08:33:21,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr99ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 146 remaining) [2022-11-19 08:33:21,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr100ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 146 remaining) [2022-11-19 08:33:21,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 146 remaining) [2022-11-19 08:33:21,347 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr102ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 146 remaining) [2022-11-19 08:33:21,347 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr103ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 146 remaining) [2022-11-19 08:33:21,347 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr104ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 146 remaining) [2022-11-19 08:33:21,347 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr105ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 146 remaining) [2022-11-19 08:33:21,347 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 146 remaining) [2022-11-19 08:33:21,348 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr107ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 146 remaining) [2022-11-19 08:33:21,348 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr108ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 146 remaining) [2022-11-19 08:33:21,348 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr109ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 146 remaining) [2022-11-19 08:33:21,348 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr110ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 146 remaining) [2022-11-19 08:33:21,349 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr111ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 146 remaining) [2022-11-19 08:33:21,349 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr112ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 146 remaining) [2022-11-19 08:33:21,349 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr113ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 146 remaining) [2022-11-19 08:33:21,349 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 146 remaining) [2022-11-19 08:33:21,349 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 146 remaining) [2022-11-19 08:33:21,350 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr116ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 146 remaining) [2022-11-19 08:33:21,350 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr117ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 146 remaining) [2022-11-19 08:33:21,350 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr118ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 146 remaining) [2022-11-19 08:33:21,350 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr119ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 146 remaining) [2022-11-19 08:33:21,350 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr120ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 146 remaining) [2022-11-19 08:33:21,351 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr121ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 146 remaining) [2022-11-19 08:33:21,351 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr122ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 146 remaining) [2022-11-19 08:33:21,351 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr123ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 146 remaining) [2022-11-19 08:33:21,351 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr124ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 146 remaining) [2022-11-19 08:33:21,351 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr125ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 146 remaining) [2022-11-19 08:33:21,352 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr126ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 146 remaining) [2022-11-19 08:33:21,352 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr127ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 146 remaining) [2022-11-19 08:33:21,352 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr128ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 146 remaining) [2022-11-19 08:33:21,352 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr129ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 146 remaining) [2022-11-19 08:33:21,353 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr130ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 146 remaining) [2022-11-19 08:33:21,353 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr131ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 146 remaining) [2022-11-19 08:33:21,353 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr132ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 146 remaining) [2022-11-19 08:33:21,353 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr133ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 146 remaining) [2022-11-19 08:33:21,353 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr134ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 146 remaining) [2022-11-19 08:33:21,354 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr135ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 146 remaining) [2022-11-19 08:33:21,354 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr136ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 146 remaining) [2022-11-19 08:33:21,354 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 146 remaining) [2022-11-19 08:33:21,354 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr138ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 146 remaining) [2022-11-19 08:33:21,354 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr139ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 146 remaining) [2022-11-19 08:33:21,355 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr140ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 146 remaining) [2022-11-19 08:33:21,355 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr141ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 146 remaining) [2022-11-19 08:33:21,355 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr142ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 146 remaining) [2022-11-19 08:33:21,355 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr143ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 146 remaining) [2022-11-19 08:33:21,355 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr144ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 146 remaining) [2022-11-19 08:33:21,356 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr145ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 146 remaining) [2022-11-19 08:33:21,367 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-19 08:33:21,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:33:21,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-19 08:33:24,690 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr133ASSERT_VIOLATIONINTEGER_OVERFLOW(line 85) no Hoare annotation was computed. [2022-11-19 08:33:24,690 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2022-11-19 08:33:24,690 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2022-11-19 08:33:24,690 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr122ASSERT_VIOLATIONINTEGER_OVERFLOW(line 84) no Hoare annotation was computed. [2022-11-19 08:33:24,690 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2022-11-19 08:33:24,690 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW(line 67) no Hoare annotation was computed. [2022-11-19 08:33:24,691 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2022-11-19 08:33:24,691 INFO L899 garLoopResultBuilder]: For program point L69(line 69) no Hoare annotation was computed. [2022-11-19 08:33:24,691 INFO L899 garLoopResultBuilder]: For program point L69-1(line 69) no Hoare annotation was computed. [2022-11-19 08:33:24,691 INFO L899 garLoopResultBuilder]: For program point L69-2(line 69) no Hoare annotation was computed. [2022-11-19 08:33:24,691 INFO L899 garLoopResultBuilder]: For program point L69-3(line 69) no Hoare annotation was computed. [2022-11-19 08:33:24,691 INFO L899 garLoopResultBuilder]: For program point L69-4(line 69) no Hoare annotation was computed. [2022-11-19 08:33:24,692 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr111ASSERT_VIOLATIONINTEGER_OVERFLOW(line 78) no Hoare annotation was computed. [2022-11-19 08:33:24,692 INFO L899 garLoopResultBuilder]: For program point L69-5(line 69) no Hoare annotation was computed. [2022-11-19 08:33:24,692 INFO L899 garLoopResultBuilder]: For program point L69-6(line 69) no Hoare annotation was computed. [2022-11-19 08:33:24,692 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) no Hoare annotation was computed. [2022-11-19 08:33:24,692 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW(line 44) no Hoare annotation was computed. [2022-11-19 08:33:24,693 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2022-11-19 08:33:24,693 INFO L899 garLoopResultBuilder]: For program point L37(line 37) no Hoare annotation was computed. [2022-11-19 08:33:24,693 INFO L899 garLoopResultBuilder]: For program point L70-1(line 70) no Hoare annotation was computed. [2022-11-19 08:33:24,693 INFO L899 garLoopResultBuilder]: For program point L37-1(line 37) no Hoare annotation was computed. [2022-11-19 08:33:24,693 INFO L899 garLoopResultBuilder]: For program point L70-2(line 70) no Hoare annotation was computed. [2022-11-19 08:33:24,693 INFO L899 garLoopResultBuilder]: For program point L37-2(line 37) no Hoare annotation was computed. [2022-11-19 08:33:24,693 INFO L899 garLoopResultBuilder]: For program point L70-3(line 70) no Hoare annotation was computed. [2022-11-19 08:33:24,693 INFO L899 garLoopResultBuilder]: For program point L37-3(line 37) no Hoare annotation was computed. [2022-11-19 08:33:24,693 INFO L899 garLoopResultBuilder]: For program point L70-4(line 70) no Hoare annotation was computed. [2022-11-19 08:33:24,694 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr89ASSERT_VIOLATIONINTEGER_OVERFLOW(line 69) no Hoare annotation was computed. [2022-11-19 08:33:24,694 INFO L899 garLoopResultBuilder]: For program point L70-5(line 70) no Hoare annotation was computed. [2022-11-19 08:33:24,694 INFO L899 garLoopResultBuilder]: For program point L70-6(line 70) no Hoare annotation was computed. [2022-11-19 08:33:24,694 INFO L899 garLoopResultBuilder]: For program point L70-7(line 70) no Hoare annotation was computed. [2022-11-19 08:33:24,694 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr143ASSERT_VIOLATIONINTEGER_OVERFLOW(line 74) no Hoare annotation was computed. [2022-11-19 08:33:24,695 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) no Hoare annotation was computed. [2022-11-19 08:33:24,695 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr100ASSERT_VIOLATIONINTEGER_OVERFLOW(line 71) no Hoare annotation was computed. [2022-11-19 08:33:24,695 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2022-11-19 08:33:24,695 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2022-11-19 08:33:24,695 INFO L899 garLoopResultBuilder]: For program point L71-1(line 71) no Hoare annotation was computed. [2022-11-19 08:33:24,695 INFO L899 garLoopResultBuilder]: For program point L71-2(line 71) no Hoare annotation was computed. [2022-11-19 08:33:24,696 INFO L899 garLoopResultBuilder]: For program point L71-3(line 71) no Hoare annotation was computed. [2022-11-19 08:33:24,696 INFO L899 garLoopResultBuilder]: For program point L71-4(line 71) no Hoare annotation was computed. [2022-11-19 08:33:24,696 INFO L899 garLoopResultBuilder]: For program point L71-5(line 71) no Hoare annotation was computed. [2022-11-19 08:33:24,696 INFO L899 garLoopResultBuilder]: For program point L71-6(line 71) no Hoare annotation was computed. [2022-11-19 08:33:24,696 INFO L899 garLoopResultBuilder]: For program point L71-7(line 71) no Hoare annotation was computed. [2022-11-19 08:33:24,696 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr132ASSERT_VIOLATIONINTEGER_OVERFLOW(line 85) no Hoare annotation was computed. [2022-11-19 08:33:24,696 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW(line 54) no Hoare annotation was computed. [2022-11-19 08:33:24,696 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW(line 67) no Hoare annotation was computed. [2022-11-19 08:33:24,696 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr121ASSERT_VIOLATIONINTEGER_OVERFLOW(line 84) no Hoare annotation was computed. [2022-11-19 08:33:24,696 INFO L899 garLoopResultBuilder]: For program point L39(line 39) no Hoare annotation was computed. [2022-11-19 08:33:24,697 INFO L899 garLoopResultBuilder]: For program point L39-1(line 39) no Hoare annotation was computed. [2022-11-19 08:33:24,697 INFO L899 garLoopResultBuilder]: For program point L39-2(line 39) no Hoare annotation was computed. [2022-11-19 08:33:24,697 INFO L899 garLoopResultBuilder]: For program point L39-3(line 39) no Hoare annotation was computed. [2022-11-19 08:33:24,697 INFO L899 garLoopResultBuilder]: For program point L39-4(line 39) no Hoare annotation was computed. [2022-11-19 08:33:24,697 INFO L899 garLoopResultBuilder]: For program point L39-5(line 39) no Hoare annotation was computed. [2022-11-19 08:33:24,697 INFO L899 garLoopResultBuilder]: For program point L39-6(line 39) no Hoare annotation was computed. [2022-11-19 08:33:24,697 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW(line 52) no Hoare annotation was computed. [2022-11-19 08:33:24,697 INFO L899 garLoopResultBuilder]: For program point L40(line 40) no Hoare annotation was computed. [2022-11-19 08:33:24,697 INFO L899 garLoopResultBuilder]: For program point L40-1(line 40) no Hoare annotation was computed. [2022-11-19 08:33:24,697 INFO L899 garLoopResultBuilder]: For program point L40-2(line 40) no Hoare annotation was computed. [2022-11-19 08:33:24,698 INFO L899 garLoopResultBuilder]: For program point L40-3(line 40) no Hoare annotation was computed. [2022-11-19 08:33:24,698 INFO L899 garLoopResultBuilder]: For program point L40-4(line 40) no Hoare annotation was computed. [2022-11-19 08:33:24,698 INFO L899 garLoopResultBuilder]: For program point L40-5(line 40) no Hoare annotation was computed. [2022-11-19 08:33:24,698 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr110ASSERT_VIOLATIONINTEGER_OVERFLOW(line 78) no Hoare annotation was computed. [2022-11-19 08:33:24,698 INFO L899 garLoopResultBuilder]: For program point L40-6(line 40) no Hoare annotation was computed. [2022-11-19 08:33:24,698 INFO L899 garLoopResultBuilder]: For program point L40-7(line 40) no Hoare annotation was computed. [2022-11-19 08:33:24,699 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2022-11-19 08:33:24,699 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr88ASSERT_VIOLATIONINTEGER_OVERFLOW(line 69) no Hoare annotation was computed. [2022-11-19 08:33:24,699 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr142ASSERT_VIOLATIONINTEGER_OVERFLOW(line 74) no Hoare annotation was computed. [2022-11-19 08:33:24,699 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2022-11-19 08:33:24,699 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2022-11-19 08:33:24,699 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr99ASSERT_VIOLATIONINTEGER_OVERFLOW(line 71) no Hoare annotation was computed. [2022-11-19 08:33:24,700 INFO L899 garLoopResultBuilder]: For program point L41(line 41) no Hoare annotation was computed. [2022-11-19 08:33:24,700 INFO L899 garLoopResultBuilder]: For program point L74-1(line 74) no Hoare annotation was computed. [2022-11-19 08:33:24,700 INFO L899 garLoopResultBuilder]: For program point L41-1(line 41) no Hoare annotation was computed. [2022-11-19 08:33:24,700 INFO L899 garLoopResultBuilder]: For program point L74-2(lines 74 87) no Hoare annotation was computed. [2022-11-19 08:33:24,700 INFO L899 garLoopResultBuilder]: For program point L41-2(line 41) no Hoare annotation was computed. [2022-11-19 08:33:24,700 INFO L899 garLoopResultBuilder]: For program point L41-3(line 41) no Hoare annotation was computed. [2022-11-19 08:33:24,701 INFO L899 garLoopResultBuilder]: For program point L41-4(line 41) no Hoare annotation was computed. [2022-11-19 08:33:24,701 INFO L899 garLoopResultBuilder]: For program point L74-5(line 74) no Hoare annotation was computed. [2022-11-19 08:33:24,701 INFO L899 garLoopResultBuilder]: For program point L41-5(line 41) no Hoare annotation was computed. [2022-11-19 08:33:24,701 INFO L899 garLoopResultBuilder]: For program point L74-6(line 74) no Hoare annotation was computed. [2022-11-19 08:33:24,701 INFO L899 garLoopResultBuilder]: For program point L41-6(line 41) no Hoare annotation was computed. [2022-11-19 08:33:24,702 INFO L895 garLoopResultBuilder]: At program point L74-7(lines 74 87) the Hoare annotation is: (let ((.cse2 (select |#memory_int| 1)) (.cse1 (div ~CELLCOUNT~0 4)) (.cse0 (select |#memory_int| 2))) (and (= 98 (select .cse0 1)) (= (select .cse0 7) 0) (= (select .cse0 4) 52) (= (select |#length| 3) 12) (= |ULTIMATE.start_main_~CCCELVOL3~0#1| 7) (= (* (mod ~CELLCOUNT~0 1073741824) 4) (select |#length| |ULTIMATE.start_main_~#volArray~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#volArray~0#1.base|) 1) (<= (* |ULTIMATE.start_main_~i~0#1| 4) 2147483650) (<= 1 |ULTIMATE.start_main_~i~0#1|) (= (select .cse0 6) 99) (= |ULTIMATE.start_main_~CCCELVOL4~0#1| 5) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= 2 |ULTIMATE.start_main_~MINVAL~0#1|) (<= ~CELLCOUNT~0 2147483647) (= |ULTIMATE.start_main_~CCCELVOL1~0#1| 1) (= |ULTIMATE.start_main_~#volArray~0#1.offset| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (= 114 (select .cse0 3)) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_~CCCELVOL2~0#1| 3) (= ~CELLCOUNT~0 (* .cse1 4)) (= (select |#valid| 0) 0) (= (select .cse0 5) 46) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= 8 (select |#length| 2)) (= (select .cse2 0) 48) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= (select .cse0 0) 109) (= (select .cse2 1) 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#volArray~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= 1 .cse1) (< 0 |#StackHeapBarrier|) (= 112 (select .cse0 2)) (= |#NULL.base| 0))) [2022-11-19 08:33:24,702 INFO L899 garLoopResultBuilder]: For program point L41-7(line 41) no Hoare annotation was computed. [2022-11-19 08:33:24,703 INFO L899 garLoopResultBuilder]: For program point L74-8(lines 74 87) no Hoare annotation was computed. [2022-11-19 08:33:24,703 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr131ASSERT_VIOLATIONINTEGER_OVERFLOW(line 85) no Hoare annotation was computed. [2022-11-19 08:33:24,703 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2022-11-19 08:33:24,703 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2022-11-19 08:33:24,703 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW(line 63) no Hoare annotation was computed. [2022-11-19 08:33:24,703 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr120ASSERT_VIOLATIONINTEGER_OVERFLOW(line 84) no Hoare annotation was computed. [2022-11-19 08:33:24,704 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2022-11-19 08:33:24,704 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) no Hoare annotation was computed. [2022-11-19 08:33:24,704 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2022-11-19 08:33:24,704 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2022-11-19 08:33:24,704 INFO L899 garLoopResultBuilder]: For program point L76(lines 76 83) no Hoare annotation was computed. [2022-11-19 08:33:24,704 INFO L899 garLoopResultBuilder]: For program point L76-2(lines 76 83) no Hoare annotation was computed. [2022-11-19 08:33:24,705 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr109ASSERT_VIOLATIONINTEGER_OVERFLOW(line 74) no Hoare annotation was computed. [2022-11-19 08:33:24,705 INFO L899 garLoopResultBuilder]: For program point L44-1(line 44) no Hoare annotation was computed. [2022-11-19 08:33:24,705 INFO L899 garLoopResultBuilder]: For program point L44-2(lines 44 57) no Hoare annotation was computed. [2022-11-19 08:33:24,705 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) no Hoare annotation was computed. [2022-11-19 08:33:24,705 INFO L899 garLoopResultBuilder]: For program point L44-5(line 44) no Hoare annotation was computed. [2022-11-19 08:33:24,705 INFO L899 garLoopResultBuilder]: For program point L44-6(line 44) no Hoare annotation was computed. [2022-11-19 08:33:24,706 INFO L895 garLoopResultBuilder]: At program point L44-7(lines 44 57) the Hoare annotation is: (let ((.cse2 (select |#memory_int| 1)) (.cse1 (div ~CELLCOUNT~0 4)) (.cse0 (select |#memory_int| 2))) (and (= 98 (select .cse0 1)) (= (select .cse0 7) 0) (= (select .cse0 4) 52) (= (select |#length| 3) 12) (= (* (mod ~CELLCOUNT~0 1073741824) 4) (select |#length| |ULTIMATE.start_main_~#volArray~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#volArray~0#1.base|) 1) (= (select .cse0 6) 99) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= 2 |ULTIMATE.start_main_~MINVAL~0#1|) (<= ~CELLCOUNT~0 2147483647) (= |ULTIMATE.start_main_~CCCELVOL1~0#1| 1) (= |ULTIMATE.start_main_~#volArray~0#1.offset| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (= 114 (select .cse0 3)) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_~CCCELVOL2~0#1| 3) (= ~CELLCOUNT~0 (* .cse1 4)) (= (select |#valid| 0) 0) (= (select .cse0 5) 46) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= 8 (select |#length| 2)) (= (select .cse2 0) 48) (let ((.cse3 (= |ULTIMATE.start_main_~CCCELVOL3~0#1| 7)) (.cse4 (= |ULTIMATE.start_main_~CCCELVOL4~0#1| 5))) (or (and .cse3 (<= (* |ULTIMATE.start_main_~i~0#1| 4) 2147483651) .cse4 (<= 2 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~CCCELVOL3~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#volArray~0#1.base|) (+ |ULTIMATE.start_main_~#volArray~0#1.offset| (- 28) (* 16 |ULTIMATE.start_main_~i~0#1|))))) (and .cse3 .cse4 (= |ULTIMATE.start_main_~i~0#1| 1)))) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= (select .cse0 0) 109) (= (select .cse2 1) 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#volArray~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= 1 .cse1) (< 0 |#StackHeapBarrier|) (= 112 (select .cse0 2)) (= |#NULL.base| 0))) [2022-11-19 08:33:24,706 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW(line 82) no Hoare annotation was computed. [2022-11-19 08:33:24,706 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW(line 54) no Hoare annotation was computed. [2022-11-19 08:33:24,706 INFO L899 garLoopResultBuilder]: For program point L44-8(lines 44 57) no Hoare annotation was computed. [2022-11-19 08:33:24,707 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2022-11-19 08:33:24,707 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW(line 44) no Hoare annotation was computed. [2022-11-19 08:33:24,707 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2022-11-19 08:33:24,707 INFO L899 garLoopResultBuilder]: For program point L78(line 78) no Hoare annotation was computed. [2022-11-19 08:33:24,707 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr103ASSERT_VIOLATIONINTEGER_OVERFLOW(line 71) no Hoare annotation was computed. [2022-11-19 08:33:24,707 INFO L899 garLoopResultBuilder]: For program point L78-1(line 78) no Hoare annotation was computed. [2022-11-19 08:33:24,707 INFO L899 garLoopResultBuilder]: For program point L78-2(line 78) no Hoare annotation was computed. [2022-11-19 08:33:24,707 INFO L899 garLoopResultBuilder]: For program point L78-3(line 78) no Hoare annotation was computed. [2022-11-19 08:33:24,708 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2022-11-19 08:33:24,708 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr135ASSERT_VIOLATIONINTEGER_OVERFLOW(line 86) no Hoare annotation was computed. [2022-11-19 08:33:24,708 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW(line 44) no Hoare annotation was computed. [2022-11-19 08:33:24,708 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2022-11-19 08:33:24,708 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW(line 67) no Hoare annotation was computed. [2022-11-19 08:33:24,708 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 53) no Hoare annotation was computed. [2022-11-19 08:33:24,708 INFO L899 garLoopResultBuilder]: For program point L46-2(lines 46 53) no Hoare annotation was computed. [2022-11-19 08:33:24,708 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr124ASSERT_VIOLATIONINTEGER_OVERFLOW(line 84) no Hoare annotation was computed. [2022-11-19 08:33:24,708 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2022-11-19 08:33:24,709 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2022-11-19 08:33:24,709 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW(line 48) no Hoare annotation was computed. [2022-11-19 08:33:24,709 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr113ASSERT_VIOLATIONINTEGER_OVERFLOW(line 78) no Hoare annotation was computed. [2022-11-19 08:33:24,709 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2022-11-19 08:33:24,709 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2022-11-19 08:33:24,709 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2022-11-19 08:33:24,710 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr145ASSERT_VIOLATIONINTEGER_OVERFLOW(line 89) no Hoare annotation was computed. [2022-11-19 08:33:24,710 INFO L899 garLoopResultBuilder]: For program point L48-1(line 48) no Hoare annotation was computed. [2022-11-19 08:33:24,710 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr102ASSERT_VIOLATIONINTEGER_OVERFLOW(line 71) no Hoare annotation was computed. [2022-11-19 08:33:24,710 INFO L899 garLoopResultBuilder]: For program point L48-2(line 48) no Hoare annotation was computed. [2022-11-19 08:33:24,710 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW(line 44) no Hoare annotation was computed. [2022-11-19 08:33:24,711 INFO L899 garLoopResultBuilder]: For program point L48-3(line 48) no Hoare annotation was computed. [2022-11-19 08:33:24,711 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr134ASSERT_VIOLATIONINTEGER_OVERFLOW(line 86) no Hoare annotation was computed. [2022-11-19 08:33:24,711 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2022-11-19 08:33:24,711 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW(line 67) no Hoare annotation was computed. [2022-11-19 08:33:24,711 INFO L899 garLoopResultBuilder]: For program point L82(line 82) no Hoare annotation was computed. [2022-11-19 08:33:24,711 INFO L899 garLoopResultBuilder]: For program point L82-1(line 82) no Hoare annotation was computed. [2022-11-19 08:33:24,712 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 93) no Hoare annotation was computed. [2022-11-19 08:33:24,712 INFO L899 garLoopResultBuilder]: For program point L82-2(line 82) no Hoare annotation was computed. [2022-11-19 08:33:24,712 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr123ASSERT_VIOLATIONINTEGER_OVERFLOW(line 84) no Hoare annotation was computed. [2022-11-19 08:33:24,712 INFO L899 garLoopResultBuilder]: For program point L82-3(line 82) no Hoare annotation was computed. [2022-11-19 08:33:24,712 INFO L899 garLoopResultBuilder]: For program point L16-2(lines 16 93) no Hoare annotation was computed. [2022-11-19 08:33:24,712 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW(line 54) no Hoare annotation was computed. [2022-11-19 08:33:24,713 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW(line 54) no Hoare annotation was computed. [2022-11-19 08:33:24,713 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2022-11-19 08:33:24,713 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr112ASSERT_VIOLATIONINTEGER_OVERFLOW(line 78) no Hoare annotation was computed. [2022-11-19 08:33:24,713 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2022-11-19 08:33:24,713 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2022-11-19 08:33:24,713 INFO L899 garLoopResultBuilder]: For program point L84(line 84) no Hoare annotation was computed. [2022-11-19 08:33:24,714 INFO L899 garLoopResultBuilder]: For program point L84-1(line 84) no Hoare annotation was computed. [2022-11-19 08:33:24,714 INFO L899 garLoopResultBuilder]: For program point L84-2(line 84) no Hoare annotation was computed. [2022-11-19 08:33:24,714 INFO L899 garLoopResultBuilder]: For program point L84-3(line 84) no Hoare annotation was computed. [2022-11-19 08:33:24,714 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr144ASSERT_VIOLATIONINTEGER_OVERFLOW(line 89) no Hoare annotation was computed. [2022-11-19 08:33:24,714 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW(line 71) no Hoare annotation was computed. [2022-11-19 08:33:24,714 INFO L899 garLoopResultBuilder]: For program point L84-4(line 84) no Hoare annotation was computed. [2022-11-19 08:33:24,714 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2022-11-19 08:33:24,714 INFO L899 garLoopResultBuilder]: For program point L84-5(line 84) no Hoare annotation was computed. [2022-11-19 08:33:24,714 INFO L899 garLoopResultBuilder]: For program point L84-6(line 84) no Hoare annotation was computed. [2022-11-19 08:33:24,714 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2022-11-19 08:33:24,715 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW(line 48) no Hoare annotation was computed. [2022-11-19 08:33:24,715 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr95ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2022-11-19 08:33:24,715 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2022-11-19 08:33:24,715 INFO L899 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2022-11-19 08:33:24,715 INFO L899 garLoopResultBuilder]: For program point L52(line 52) no Hoare annotation was computed. [2022-11-19 08:33:24,716 INFO L899 garLoopResultBuilder]: For program point L85-1(line 85) no Hoare annotation was computed. [2022-11-19 08:33:24,716 INFO L899 garLoopResultBuilder]: For program point L52-1(line 52) no Hoare annotation was computed. [2022-11-19 08:33:24,716 INFO L899 garLoopResultBuilder]: For program point L85-2(line 85) no Hoare annotation was computed. [2022-11-19 08:33:24,716 INFO L899 garLoopResultBuilder]: For program point L52-2(line 52) no Hoare annotation was computed. [2022-11-19 08:33:24,716 INFO L899 garLoopResultBuilder]: For program point L85-3(line 85) no Hoare annotation was computed. [2022-11-19 08:33:24,716 INFO L899 garLoopResultBuilder]: For program point L52-3(line 52) no Hoare annotation was computed. [2022-11-19 08:33:24,717 INFO L899 garLoopResultBuilder]: For program point L85-4(line 85) no Hoare annotation was computed. [2022-11-19 08:33:24,717 INFO L899 garLoopResultBuilder]: For program point L85-5(line 85) no Hoare annotation was computed. [2022-11-19 08:33:24,717 INFO L899 garLoopResultBuilder]: For program point L85-6(line 85) no Hoare annotation was computed. [2022-11-19 08:33:24,717 INFO L899 garLoopResultBuilder]: For program point L85-7(line 85) no Hoare annotation was computed. [2022-11-19 08:33:24,717 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW(line 59) no Hoare annotation was computed. [2022-11-19 08:33:24,717 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-19 08:33:24,718 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW(line 69) no Hoare annotation was computed. [2022-11-19 08:33:24,718 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr138ASSERT_VIOLATIONINTEGER_OVERFLOW(line 86) no Hoare annotation was computed. [2022-11-19 08:33:24,718 INFO L899 garLoopResultBuilder]: For program point L86(line 86) no Hoare annotation was computed. [2022-11-19 08:33:24,718 INFO L899 garLoopResultBuilder]: For program point L86-1(line 86) no Hoare annotation was computed. [2022-11-19 08:33:24,718 INFO L899 garLoopResultBuilder]: For program point L86-2(line 86) no Hoare annotation was computed. [2022-11-19 08:33:24,718 INFO L899 garLoopResultBuilder]: For program point L86-3(line 86) no Hoare annotation was computed. [2022-11-19 08:33:24,719 INFO L899 garLoopResultBuilder]: For program point L86-4(line 86) no Hoare annotation was computed. [2022-11-19 08:33:24,719 INFO L899 garLoopResultBuilder]: For program point L86-5(line 86) no Hoare annotation was computed. [2022-11-19 08:33:24,719 INFO L899 garLoopResultBuilder]: For program point L86-6(line 86) no Hoare annotation was computed. [2022-11-19 08:33:24,719 INFO L899 garLoopResultBuilder]: For program point L86-7(line 86) no Hoare annotation was computed. [2022-11-19 08:33:24,719 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) no Hoare annotation was computed. [2022-11-19 08:33:24,719 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr127ASSERT_VIOLATIONINTEGER_OVERFLOW(line 85) no Hoare annotation was computed. [2022-11-19 08:33:24,720 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW(line 54) no Hoare annotation was computed. [2022-11-19 08:33:24,720 INFO L899 garLoopResultBuilder]: For program point L54(line 54) no Hoare annotation was computed. [2022-11-19 08:33:24,720 INFO L899 garLoopResultBuilder]: For program point L54-1(line 54) no Hoare annotation was computed. [2022-11-19 08:33:24,720 INFO L899 garLoopResultBuilder]: For program point L54-2(line 54) no Hoare annotation was computed. [2022-11-19 08:33:24,720 INFO L899 garLoopResultBuilder]: For program point L54-3(line 54) no Hoare annotation was computed. [2022-11-19 08:33:24,720 INFO L899 garLoopResultBuilder]: For program point L54-4(line 54) no Hoare annotation was computed. [2022-11-19 08:33:24,721 INFO L899 garLoopResultBuilder]: For program point L54-5(line 54) no Hoare annotation was computed. [2022-11-19 08:33:24,721 INFO L899 garLoopResultBuilder]: For program point L54-6(line 54) no Hoare annotation was computed. [2022-11-19 08:33:24,721 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) no Hoare annotation was computed. [2022-11-19 08:33:24,721 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW(line 54) no Hoare annotation was computed. [2022-11-19 08:33:24,721 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr116ASSERT_VIOLATIONINTEGER_OVERFLOW(line 82) no Hoare annotation was computed. [2022-11-19 08:33:24,721 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW(line 59) no Hoare annotation was computed. [2022-11-19 08:33:24,722 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr94ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2022-11-19 08:33:24,722 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) no Hoare annotation was computed. [2022-11-19 08:33:24,722 INFO L899 garLoopResultBuilder]: For program point L55(line 55) no Hoare annotation was computed. [2022-11-19 08:33:24,722 INFO L899 garLoopResultBuilder]: For program point L55-1(line 55) no Hoare annotation was computed. [2022-11-19 08:33:24,722 INFO L899 garLoopResultBuilder]: For program point L55-2(line 55) no Hoare annotation was computed. [2022-11-19 08:33:24,723 INFO L899 garLoopResultBuilder]: For program point L55-3(line 55) no Hoare annotation was computed. [2022-11-19 08:33:24,723 INFO L899 garLoopResultBuilder]: For program point L55-4(line 55) no Hoare annotation was computed. [2022-11-19 08:33:24,723 INFO L899 garLoopResultBuilder]: For program point L55-5(line 55) no Hoare annotation was computed. [2022-11-19 08:33:24,723 INFO L899 garLoopResultBuilder]: For program point L55-6(line 55) no Hoare annotation was computed. [2022-11-19 08:33:24,723 INFO L899 garLoopResultBuilder]: For program point L55-7(line 55) no Hoare annotation was computed. [2022-11-19 08:33:24,723 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2022-11-19 08:33:24,724 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr105ASSERT_VIOLATIONINTEGER_OVERFLOW(line 71) no Hoare annotation was computed. [2022-11-19 08:33:24,724 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) no Hoare annotation was computed. [2022-11-19 08:33:24,724 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2022-11-19 08:33:24,724 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW(line 59) no Hoare annotation was computed. [2022-11-19 08:33:24,724 INFO L899 garLoopResultBuilder]: For program point L56-1(line 56) no Hoare annotation was computed. [2022-11-19 08:33:24,724 INFO L899 garLoopResultBuilder]: For program point L56-2(line 56) no Hoare annotation was computed. [2022-11-19 08:33:24,725 INFO L899 garLoopResultBuilder]: For program point L89-3(line 89) no Hoare annotation was computed. [2022-11-19 08:33:24,725 INFO L899 garLoopResultBuilder]: For program point L56-3(line 56) no Hoare annotation was computed. [2022-11-19 08:33:24,725 INFO L899 garLoopResultBuilder]: For program point L89-4(line 89) no Hoare annotation was computed. [2022-11-19 08:33:24,725 INFO L899 garLoopResultBuilder]: For program point L56-4(line 56) no Hoare annotation was computed. [2022-11-19 08:33:24,725 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW(line 86) no Hoare annotation was computed. [2022-11-19 08:33:24,726 INFO L895 garLoopResultBuilder]: At program point L89-5(lines 89 92) the Hoare annotation is: (let ((.cse38 (select |#memory_int| 1)) (.cse37 (div ~CELLCOUNT~0 4)) (.cse36 (select |#memory_int| 2))) (let ((.cse0 (= 98 (select .cse36 1))) (.cse1 (= (select .cse36 7) 0)) (.cse2 (= (select .cse36 4) 52)) (.cse3 (= (select |#length| 3) 12)) (.cse4 (= |ULTIMATE.start_main_~CCCELVOL3~0#1| 7)) (.cse5 (= (* (mod ~CELLCOUNT~0 1073741824) 4) (select |#length| |ULTIMATE.start_main_~#volArray~0#1.base|))) (.cse6 (= (select |#valid| |ULTIMATE.start_main_~#volArray~0#1.base|) 1)) (.cse7 (= (select .cse36 6) 99)) (.cse8 (= |ULTIMATE.start_main_~CCCELVOL4~0#1| 5)) (.cse9 (= 2 (select |#length| 1))) (.cse10 (= (select |#valid| 3) 1)) (.cse11 (= 2 |ULTIMATE.start_main_~MINVAL~0#1|)) (.cse12 (<= ~CELLCOUNT~0 2147483647)) (.cse13 (= |ULTIMATE.start_main_~CCCELVOL1~0#1| 1)) (.cse14 (= |ULTIMATE.start_main_~#volArray~0#1.offset| 0)) (.cse15 (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)) (.cse16 (= 114 (select .cse36 3))) (.cse17 (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|)) (.cse18 (= (select |#valid| 1) 1)) (.cse19 (= |ULTIMATE.start_main_~CCCELVOL2~0#1| 3)) (.cse20 (= ~CELLCOUNT~0 (* .cse37 4))) (.cse21 (= (select |#valid| 0) 0)) (.cse22 (= (select .cse36 5) 46)) (.cse23 (= (select |#valid| 2) 1)) (.cse24 (= |#NULL.offset| 0)) (.cse25 (= 8 (select |#length| 2))) (.cse26 (= (select .cse38 0) 48)) (.cse27 (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1)) (.cse28 (= (select .cse36 0) 109)) (.cse29 (= (select .cse38 1) 0)) (.cse30 (< |#StackHeapBarrier| |ULTIMATE.start_main_~#volArray~0#1.base|)) (.cse31 (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse32 (<= 1 .cse37)) (.cse33 (< 0 |#StackHeapBarrier|)) (.cse34 (= 112 (select .cse36 2))) (.cse35 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_main_~i~0#1| 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 1 |ULTIMATE.start_main_~i~0#1|) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35)))) [2022-11-19 08:33:24,726 INFO L899 garLoopResultBuilder]: For program point L56-5(line 56) no Hoare annotation was computed. [2022-11-19 08:33:24,726 INFO L899 garLoopResultBuilder]: For program point L56-6(line 56) no Hoare annotation was computed. [2022-11-19 08:33:24,726 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW(line 69) no Hoare annotation was computed. [2022-11-19 08:33:24,726 INFO L899 garLoopResultBuilder]: For program point L56-7(line 56) no Hoare annotation was computed. [2022-11-19 08:33:24,727 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr126ASSERT_VIOLATIONINTEGER_OVERFLOW(line 85) no Hoare annotation was computed. [2022-11-19 08:33:24,727 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2022-11-19 08:33:24,727 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2022-11-19 08:33:24,727 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW(line 48) no Hoare annotation was computed. [2022-11-19 08:33:24,727 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW(line 82) no Hoare annotation was computed. [2022-11-19 08:33:24,727 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-19 08:33:24,728 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr93ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2022-11-19 08:33:24,728 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2022-11-19 08:33:24,728 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW(line 48) no Hoare annotation was computed. [2022-11-19 08:33:24,728 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr104ASSERT_VIOLATIONINTEGER_OVERFLOW(line 71) no Hoare annotation was computed. [2022-11-19 08:33:24,728 INFO L899 garLoopResultBuilder]: For program point L26(line 26) no Hoare annotation was computed. [2022-11-19 08:33:24,729 INFO L899 garLoopResultBuilder]: For program point L59-1(line 59) no Hoare annotation was computed. [2022-11-19 08:33:24,729 INFO L899 garLoopResultBuilder]: For program point L59-2(lines 59 72) no Hoare annotation was computed. [2022-11-19 08:33:24,729 INFO L899 garLoopResultBuilder]: For program point L59-5(line 59) no Hoare annotation was computed. [2022-11-19 08:33:24,729 INFO L899 garLoopResultBuilder]: For program point L59-6(line 59) no Hoare annotation was computed. [2022-11-19 08:33:24,729 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr136ASSERT_VIOLATIONINTEGER_OVERFLOW(line 86) no Hoare annotation was computed. [2022-11-19 08:33:24,730 INFO L895 garLoopResultBuilder]: At program point L59-7(lines 59 72) the Hoare annotation is: (let ((.cse2 (select |#memory_int| 1)) (.cse1 (div ~CELLCOUNT~0 4)) (.cse0 (select |#memory_int| 2))) (and (= 98 (select .cse0 1)) (= (select .cse0 7) 0) (= (select .cse0 4) 52) (= (select |#length| 3) 12) (= |ULTIMATE.start_main_~CCCELVOL3~0#1| 7) (= (* (mod ~CELLCOUNT~0 1073741824) 4) (select |#length| |ULTIMATE.start_main_~#volArray~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#volArray~0#1.base|) 1) (<= (* |ULTIMATE.start_main_~i~0#1| 4) 2147483650) (<= 1 |ULTIMATE.start_main_~i~0#1|) (= (select .cse0 6) 99) (= |ULTIMATE.start_main_~CCCELVOL4~0#1| 5) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= 2 |ULTIMATE.start_main_~MINVAL~0#1|) (<= ~CELLCOUNT~0 2147483647) (= |ULTIMATE.start_main_~CCCELVOL1~0#1| 1) (= |ULTIMATE.start_main_~#volArray~0#1.offset| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (= 114 (select .cse0 3)) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_~CCCELVOL2~0#1| 3) (= ~CELLCOUNT~0 (* .cse1 4)) (= (select |#valid| 0) 0) (= (select .cse0 5) 46) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= 8 (select |#length| 2)) (= (select .cse2 0) 48) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= (select .cse0 0) 109) (= (select .cse2 1) 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#volArray~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= 1 .cse1) (< 0 |#StackHeapBarrier|) (= 112 (select .cse0 2)) (= |#NULL.base| 0))) [2022-11-19 08:33:24,730 INFO L899 garLoopResultBuilder]: For program point L59-8(lines 59 72) no Hoare annotation was computed. [2022-11-19 08:33:24,730 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW(line 69) no Hoare annotation was computed. [2022-11-19 08:33:24,730 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr125ASSERT_VIOLATIONINTEGER_OVERFLOW(line 84) no Hoare annotation was computed. [2022-11-19 08:33:24,730 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) no Hoare annotation was computed. [2022-11-19 08:33:24,731 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW(line 54) no Hoare annotation was computed. [2022-11-19 08:33:24,731 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr87ASSERT_VIOLATIONINTEGER_OVERFLOW(line 69) no Hoare annotation was computed. [2022-11-19 08:33:24,731 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) no Hoare annotation was computed. [2022-11-19 08:33:24,731 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr141ASSERT_VIOLATIONINTEGER_OVERFLOW(line 86) no Hoare annotation was computed. [2022-11-19 08:33:24,731 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2022-11-19 08:33:24,732 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr98ASSERT_VIOLATIONINTEGER_OVERFLOW(line 71) no Hoare annotation was computed. [2022-11-19 08:33:24,732 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2022-11-19 08:33:24,732 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW(line 52) no Hoare annotation was computed. [2022-11-19 08:33:24,732 INFO L895 garLoopResultBuilder]: At program point L94(lines 13 95) the Hoare annotation is: (or (<= ~CELLCOUNT~0 2147483647) (not (= ~CELLCOUNT~0 (* (div ~CELLCOUNT~0 4) 4)))) [2022-11-19 08:33:24,732 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 68) no Hoare annotation was computed. [2022-11-19 08:33:24,732 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr130ASSERT_VIOLATIONINTEGER_OVERFLOW(line 85) no Hoare annotation was computed. [2022-11-19 08:33:24,733 INFO L899 garLoopResultBuilder]: For program point L61-2(lines 61 68) no Hoare annotation was computed. [2022-11-19 08:33:24,733 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW(line 63) no Hoare annotation was computed. [2022-11-19 08:33:24,733 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr119ASSERT_VIOLATIONINTEGER_OVERFLOW(line 84) no Hoare annotation was computed. [2022-11-19 08:33:24,733 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2022-11-19 08:33:24,733 INFO L899 garLoopResultBuilder]: For program point L29-1(line 29) no Hoare annotation was computed. [2022-11-19 08:33:24,734 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW(line 52) no Hoare annotation was computed. [2022-11-19 08:33:24,734 INFO L899 garLoopResultBuilder]: For program point L29-2(lines 29 42) no Hoare annotation was computed. [2022-11-19 08:33:24,734 INFO L899 garLoopResultBuilder]: For program point L29-5(line 29) no Hoare annotation was computed. [2022-11-19 08:33:24,734 INFO L899 garLoopResultBuilder]: For program point L29-6(line 29) no Hoare annotation was computed. [2022-11-19 08:33:24,735 INFO L895 garLoopResultBuilder]: At program point L29-7(lines 29 42) the Hoare annotation is: (let ((.cse37 (select |#memory_int| 1)) (.cse35 (div ~CELLCOUNT~0 4)) (.cse22 (mod ~CELLCOUNT~0 4)) (.cse36 (select |#memory_int| 2))) (let ((.cse0 (= 98 (select .cse36 1))) (.cse1 (= (select .cse36 7) 0)) (.cse2 (= (select .cse36 4) 52)) (.cse3 (= (select |#length| 3) 12)) (.cse4 (= |ULTIMATE.start_main_~CCCELVOL3~0#1| 7)) (.cse5 (= (* (mod ~CELLCOUNT~0 1073741824) 4) (select |#length| |ULTIMATE.start_main_~#volArray~0#1.base|))) (.cse6 (= (select |#valid| |ULTIMATE.start_main_~#volArray~0#1.base|) 1)) (.cse7 (= (select .cse36 6) 99)) (.cse8 (= |ULTIMATE.start_main_~CCCELVOL4~0#1| 5)) (.cse9 (= 2 (select |#length| 1))) (.cse10 (= (select |#valid| 3) 1)) (.cse11 (= 2 |ULTIMATE.start_main_~MINVAL~0#1|)) (.cse12 (<= ~CELLCOUNT~0 2147483647)) (.cse13 (= |ULTIMATE.start_main_~CCCELVOL1~0#1| 1)) (.cse14 (= |ULTIMATE.start_main_~#volArray~0#1.offset| 0)) (.cse15 (= 114 (select .cse36 3))) (.cse16 (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|)) (.cse21 (and (not (= .cse22 0)) (< ~CELLCOUNT~0 0))) (.cse17 (= (select |#valid| 1) 1)) (.cse18 (= |ULTIMATE.start_main_~CCCELVOL2~0#1| 3)) (.cse19 (= ~CELLCOUNT~0 (* .cse35 4))) (.cse20 (= (select |#valid| 0) 0)) (.cse23 (= (select .cse36 5) 46)) (.cse24 (= (select |#valid| 2) 1)) (.cse25 (= |#NULL.offset| 0)) (.cse26 (= 8 (select |#length| 2))) (.cse27 (= (select .cse37 0) 48)) (.cse28 (= (select .cse36 0) 109)) (.cse29 (= (select .cse37 1) 0)) (.cse30 (< |#StackHeapBarrier| |ULTIMATE.start_main_~#volArray~0#1.base|)) (.cse31 (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse32 (< 0 |#StackHeapBarrier|)) (.cse33 (= 112 (select .cse36 2))) (.cse34 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 2 ~CELLCOUNT~0) .cse7 .cse8 .cse9 (= |ULTIMATE.start_main_~i~0#1| 1) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (not (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= (ite (= (ite .cse21 (+ .cse22 (- 4)) .cse22) 0) 1 0) |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~CCCELVOL4~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#volArray~0#1.base|) (+ |ULTIMATE.start_main_~#volArray~0#1.offset| (* 16 |ULTIMATE.start_main_~i~0#1|) (- 32)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) .cse15 .cse16 (<= |ULTIMATE.start_main_~i~0#1| (+ (ite .cse21 (+ .cse35 1) .cse35) 1)) .cse17 .cse18 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse19 .cse20 .cse23 .cse24 .cse25 .cse26 .cse27 (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34)))) [2022-11-19 08:33:24,735 INFO L899 garLoopResultBuilder]: For program point L29-8(lines 29 42) no Hoare annotation was computed. [2022-11-19 08:33:24,735 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr108ASSERT_VIOLATIONINTEGER_OVERFLOW(line 74) no Hoare annotation was computed. [2022-11-19 08:33:24,735 INFO L899 garLoopResultBuilder]: For program point L63(line 63) no Hoare annotation was computed. [2022-11-19 08:33:24,735 INFO L899 garLoopResultBuilder]: For program point L63-1(line 63) no Hoare annotation was computed. [2022-11-19 08:33:24,736 INFO L899 garLoopResultBuilder]: For program point L63-2(line 63) no Hoare annotation was computed. [2022-11-19 08:33:24,736 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2022-11-19 08:33:24,736 INFO L899 garLoopResultBuilder]: For program point L63-3(line 63) no Hoare annotation was computed. [2022-11-19 08:33:24,736 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW(line 69) no Hoare annotation was computed. [2022-11-19 08:33:24,736 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr140ASSERT_VIOLATIONINTEGER_OVERFLOW(line 86) no Hoare annotation was computed. [2022-11-19 08:33:24,736 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2022-11-19 08:33:24,737 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2022-11-19 08:33:24,737 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2022-11-19 08:33:24,737 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 38) no Hoare annotation was computed. [2022-11-19 08:33:24,737 INFO L899 garLoopResultBuilder]: For program point L31-2(lines 31 38) no Hoare annotation was computed. [2022-11-19 08:33:24,737 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2022-11-19 08:33:24,737 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr129ASSERT_VIOLATIONINTEGER_OVERFLOW(line 85) no Hoare annotation was computed. [2022-11-19 08:33:24,738 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2022-11-19 08:33:24,738 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr118ASSERT_VIOLATIONINTEGER_OVERFLOW(line 84) no Hoare annotation was computed. [2022-11-19 08:33:24,738 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW(line 54) no Hoare annotation was computed. [2022-11-19 08:33:24,738 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW(line 63) no Hoare annotation was computed. [2022-11-19 08:33:24,738 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) no Hoare annotation was computed. [2022-11-19 08:33:24,739 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2022-11-19 08:33:24,739 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr107ASSERT_VIOLATIONINTEGER_OVERFLOW(line 59) no Hoare annotation was computed. [2022-11-19 08:33:24,739 INFO L899 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2022-11-19 08:33:24,739 INFO L899 garLoopResultBuilder]: For program point L33-1(line 33) no Hoare annotation was computed. [2022-11-19 08:33:24,739 INFO L899 garLoopResultBuilder]: For program point L33-2(line 33) no Hoare annotation was computed. [2022-11-19 08:33:24,740 INFO L899 garLoopResultBuilder]: For program point L33-3(line 33) no Hoare annotation was computed. [2022-11-19 08:33:24,740 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr139ASSERT_VIOLATIONINTEGER_OVERFLOW(line 86) no Hoare annotation was computed. [2022-11-19 08:33:24,740 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW(line 63) no Hoare annotation was computed. [2022-11-19 08:33:24,740 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) no Hoare annotation was computed. [2022-11-19 08:33:24,740 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW(line 69) no Hoare annotation was computed. [2022-11-19 08:33:24,740 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2022-11-19 08:33:24,741 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2022-11-19 08:33:24,741 INFO L899 garLoopResultBuilder]: For program point L67(line 67) no Hoare annotation was computed. [2022-11-19 08:33:24,741 INFO L899 garLoopResultBuilder]: For program point L67-1(line 67) no Hoare annotation was computed. [2022-11-19 08:33:24,741 INFO L899 garLoopResultBuilder]: For program point L67-2(line 67) no Hoare annotation was computed. [2022-11-19 08:33:24,741 INFO L899 garLoopResultBuilder]: For program point L67-3(line 67) no Hoare annotation was computed. [2022-11-19 08:33:24,742 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW(line 52) no Hoare annotation was computed. [2022-11-19 08:33:24,742 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr128ASSERT_VIOLATIONINTEGER_OVERFLOW(line 85) no Hoare annotation was computed. [2022-11-19 08:33:24,742 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2022-11-19 08:33:24,742 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr117ASSERT_VIOLATIONINTEGER_OVERFLOW(line 82) no Hoare annotation was computed. [2022-11-19 08:33:24,746 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:33:24,749 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 08:33:24,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:33:24 BoogieIcfgContainer [2022-11-19 08:33:24,793 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 08:33:24,794 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 08:33:24,794 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 08:33:24,794 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 08:33:24,795 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:31:18" (3/4) ... [2022-11-19 08:33:24,799 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-19 08:33:24,815 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2022-11-19 08:33:24,816 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-11-19 08:33:24,816 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-19 08:33:24,817 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-19 08:33:24,818 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-19 08:33:24,857 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((98 == unknown-#memory_int-unknown[2][1] && unknown-#memory_int-unknown[2][7] == 0) && unknown-#memory_int-unknown[2][4] == 52) && unknown-#length-unknown[3] == 12) && CCCELVOL3 == 7) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && 2 <= CELLCOUNT) && unknown-#memory_int-unknown[2][6] == 99) && CCCELVOL4 == 5) && 2 == unknown-#length-unknown[1]) && i == 1) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && CCCELVOL1 == 1) && volArray == 0) && 114 == unknown-#memory_int-unknown[2][3]) && 0 <= cond) && \valid[1] == 1) && CCCELVOL2 == 3) && CELLCOUNT == CELLCOUNT / 4 * 4) && \valid[0] == 0) && !(cond == 0)) && (if (if !(CELLCOUNT % 4 == 0) && CELLCOUNT < 0 then CELLCOUNT % 4 + -4 else CELLCOUNT % 4) == 0 then 1 else 0) == \old(cond)) && unknown-#memory_int-unknown[2][5] == 46) && \valid[2] == 1) && #NULL == 0) && 8 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[2][0] == 109) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 0 < unknown-#StackHeapBarrier-unknown) && 112 == unknown-#memory_int-unknown[2][2]) && #NULL == 0) || (((((((((((((((((((((((((((((((((((((98 == unknown-#memory_int-unknown[2][1] && unknown-#memory_int-unknown[2][7] == 0) && unknown-#memory_int-unknown[2][4] == 52) && CCCELVOL4 == unknown-#memory_int-unknown[volArray][volArray + 16 * i + -32]) && unknown-#length-unknown[3] == 12) && CCCELVOL3 == 7) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && unknown-#memory_int-unknown[2][6] == 99) && CCCELVOL4 == 5) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && CCCELVOL1 == 1) && volArray == 0) && 0 <= \old(cond)) && 114 == unknown-#memory_int-unknown[2][3]) && 0 <= cond) && i <= (if !(CELLCOUNT % 4 == 0) && CELLCOUNT < 0 then CELLCOUNT / 4 + 1 else CELLCOUNT / 4) + 1) && \valid[1] == 1) && CCCELVOL2 == 3) && 2 <= i) && CELLCOUNT == CELLCOUNT / 4 * 4) && \valid[0] == 0) && unknown-#memory_int-unknown[2][5] == 46) && \valid[2] == 1) && #NULL == 0) && 8 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && unknown-#memory_int-unknown[2][0] == 109) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 0 < unknown-#StackHeapBarrier-unknown) && 112 == unknown-#memory_int-unknown[2][2]) && #NULL == 0) [2022-11-19 08:33:24,858 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((98 == unknown-#memory_int-unknown[2][1] && unknown-#memory_int-unknown[2][7] == 0) && unknown-#memory_int-unknown[2][4] == 52) && unknown-#length-unknown[3] == 12) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && unknown-#memory_int-unknown[2][6] == 99) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && CCCELVOL1 == 1) && volArray == 0) && 0 <= \old(cond)) && 114 == unknown-#memory_int-unknown[2][3]) && 0 <= cond) && \valid[1] == 1) && CCCELVOL2 == 3) && CELLCOUNT == CELLCOUNT / 4 * 4) && \valid[0] == 0) && unknown-#memory_int-unknown[2][5] == 46) && \valid[2] == 1) && #NULL == 0) && 8 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][0] == 48) && (((((CCCELVOL3 == 7 && i * 4 <= 2147483651) && CCCELVOL4 == 5) && 2 <= i) && CCCELVOL3 == unknown-#memory_int-unknown[volArray][volArray + -28 + 16 * i]) || ((CCCELVOL3 == 7 && CCCELVOL4 == 5) && i == 1))) && \old(cond) <= 1) && unknown-#memory_int-unknown[2][0] == 109) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 1 <= CELLCOUNT / 4) && 0 < unknown-#StackHeapBarrier-unknown) && 112 == unknown-#memory_int-unknown[2][2]) && #NULL == 0 [2022-11-19 08:33:24,860 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((98 == unknown-#memory_int-unknown[2][1] && unknown-#memory_int-unknown[2][7] == 0) && unknown-#memory_int-unknown[2][4] == 52) && unknown-#length-unknown[3] == 12) && CCCELVOL3 == 7) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && i * 4 <= 2147483650) && 1 <= i) && unknown-#memory_int-unknown[2][6] == 99) && CCCELVOL4 == 5) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && CCCELVOL1 == 1) && volArray == 0) && 0 <= \old(cond)) && 114 == unknown-#memory_int-unknown[2][3]) && 0 <= cond) && \valid[1] == 1) && CCCELVOL2 == 3) && CELLCOUNT == CELLCOUNT / 4 * 4) && \valid[0] == 0) && unknown-#memory_int-unknown[2][5] == 46) && \valid[2] == 1) && #NULL == 0) && 8 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && unknown-#memory_int-unknown[2][0] == 109) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 1 <= CELLCOUNT / 4) && 0 < unknown-#StackHeapBarrier-unknown) && 112 == unknown-#memory_int-unknown[2][2]) && #NULL == 0 [2022-11-19 08:33:24,861 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((98 == unknown-#memory_int-unknown[2][1] && unknown-#memory_int-unknown[2][7] == 0) && unknown-#memory_int-unknown[2][4] == 52) && unknown-#length-unknown[3] == 12) && CCCELVOL3 == 7) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && i * 4 <= 2147483650) && 1 <= i) && unknown-#memory_int-unknown[2][6] == 99) && CCCELVOL4 == 5) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && CCCELVOL1 == 1) && volArray == 0) && 0 <= \old(cond)) && 114 == unknown-#memory_int-unknown[2][3]) && 0 <= cond) && \valid[1] == 1) && CCCELVOL2 == 3) && CELLCOUNT == CELLCOUNT / 4 * 4) && \valid[0] == 0) && unknown-#memory_int-unknown[2][5] == 46) && \valid[2] == 1) && #NULL == 0) && 8 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && unknown-#memory_int-unknown[2][0] == 109) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 1 <= CELLCOUNT / 4) && 0 < unknown-#StackHeapBarrier-unknown) && 112 == unknown-#memory_int-unknown[2][2]) && #NULL == 0 [2022-11-19 08:33:24,863 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((98 == unknown-#memory_int-unknown[2][1] && unknown-#memory_int-unknown[2][7] == 0) && unknown-#memory_int-unknown[2][4] == 52) && unknown-#length-unknown[3] == 12) && CCCELVOL3 == 7) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && i == 0) && unknown-#memory_int-unknown[2][6] == 99) && CCCELVOL4 == 5) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && CCCELVOL1 == 1) && volArray == 0) && 0 <= \old(cond)) && 114 == unknown-#memory_int-unknown[2][3]) && 0 <= cond) && \valid[1] == 1) && CCCELVOL2 == 3) && CELLCOUNT == CELLCOUNT / 4 * 4) && \valid[0] == 0) && unknown-#memory_int-unknown[2][5] == 46) && \valid[2] == 1) && #NULL == 0) && 8 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && unknown-#memory_int-unknown[2][0] == 109) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 1 <= CELLCOUNT / 4) && 0 < unknown-#StackHeapBarrier-unknown) && 112 == unknown-#memory_int-unknown[2][2]) && #NULL == 0) || ((((((((((((((((((((((((((((((((((((98 == unknown-#memory_int-unknown[2][1] && unknown-#memory_int-unknown[2][7] == 0) && unknown-#memory_int-unknown[2][4] == 52) && unknown-#length-unknown[3] == 12) && CCCELVOL3 == 7) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && 1 <= i) && unknown-#memory_int-unknown[2][6] == 99) && CCCELVOL4 == 5) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && CCCELVOL1 == 1) && volArray == 0) && 0 <= \old(cond)) && 114 == unknown-#memory_int-unknown[2][3]) && 0 <= cond) && \valid[1] == 1) && CCCELVOL2 == 3) && CELLCOUNT == CELLCOUNT / 4 * 4) && \valid[0] == 0) && unknown-#memory_int-unknown[2][5] == 46) && \valid[2] == 1) && #NULL == 0) && 8 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && unknown-#memory_int-unknown[2][0] == 109) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 1 <= CELLCOUNT / 4) && 0 < unknown-#StackHeapBarrier-unknown) && 112 == unknown-#memory_int-unknown[2][2]) && #NULL == 0) [2022-11-19 08:33:24,924 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/witness.graphml [2022-11-19 08:33:24,928 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 08:33:24,928 INFO L158 Benchmark]: Toolchain (without parser) took 127705.25ms. Allocated memory was 134.2MB in the beginning and 664.8MB in the end (delta: 530.6MB). Free memory was 98.7MB in the beginning and 255.9MB in the end (delta: -157.2MB). Peak memory consumption was 373.0MB. Max. memory is 16.1GB. [2022-11-19 08:33:24,929 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 81.8MB. Free memory was 36.0MB in the beginning and 35.9MB in the end (delta: 45.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 08:33:24,929 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.06ms. Allocated memory is still 134.2MB. Free memory was 98.5MB in the beginning and 105.2MB in the end (delta: -6.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-19 08:33:24,929 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.76ms. Allocated memory is still 134.2MB. Free memory was 105.2MB in the beginning and 102.3MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-19 08:33:24,934 INFO L158 Benchmark]: Boogie Preprocessor took 53.23ms. Allocated memory is still 134.2MB. Free memory was 102.3MB in the beginning and 100.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 08:33:24,934 INFO L158 Benchmark]: RCFGBuilder took 1239.61ms. Allocated memory is still 134.2MB. Free memory was 100.3MB in the beginning and 62.5MB in the end (delta: 37.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-11-19 08:33:24,935 INFO L158 Benchmark]: TraceAbstraction took 125825.27ms. Allocated memory was 134.2MB in the beginning and 664.8MB in the end (delta: 530.6MB). Free memory was 61.8MB in the beginning and 263.2MB in the end (delta: -201.5MB). Peak memory consumption was 331.6MB. Max. memory is 16.1GB. [2022-11-19 08:33:24,935 INFO L158 Benchmark]: Witness Printer took 133.89ms. Allocated memory is still 664.8MB. Free memory was 263.2MB in the beginning and 255.9MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-19 08:33:24,937 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.26ms. Allocated memory is still 81.8MB. Free memory was 36.0MB in the beginning and 35.9MB in the end (delta: 45.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 381.06ms. Allocated memory is still 134.2MB. Free memory was 98.5MB in the beginning and 105.2MB in the end (delta: -6.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.76ms. Allocated memory is still 134.2MB. Free memory was 105.2MB in the beginning and 102.3MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.23ms. Allocated memory is still 134.2MB. Free memory was 102.3MB in the beginning and 100.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1239.61ms. Allocated memory is still 134.2MB. Free memory was 100.3MB in the beginning and 62.5MB in the end (delta: 37.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 125825.27ms. Allocated memory was 134.2MB in the beginning and 664.8MB in the end (delta: 530.6MB). Free memory was 61.8MB in the beginning and 263.2MB in the end (delta: -201.5MB). Peak memory consumption was 331.6MB. Max. memory is 16.1GB. * Witness Printer took 133.89ms. Allocated memory is still 664.8MB. Free memory was 263.2MB in the beginning and 255.9MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. 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: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 63]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 63]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 63]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 63]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 67]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 67]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 67]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 67]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 82]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 82]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 82]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 82]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 311 locations, 146 error locations. Started 1 CEGAR loops. OverallTime: 125.7s, OverallIterations: 15, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 48.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7184 SdHoareTripleChecker+Valid, 16.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7184 mSDsluCounter, 2859 SdHoareTripleChecker+Invalid, 14.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1149 mSDsCounter, 905 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10504 IncrementalHoareTripleChecker+Invalid, 11409 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 905 mSolverCounterUnsat, 1710 mSDtfsCounter, 10504 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2322 GetRequests, 1668 SyntacticMatches, 381 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9681 ImplicationChecksByTransitivity, 63.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=447occurred in iteration=3, InterpolantAutomatonStates: 147, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 702 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 20 NumberOfFragments, 1365 HoareAnnotationTreeSize, 6 FomulaSimplifications, 151 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 1709 FormulaSimplificationTreeSizeReductionInter, 3.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 2077 NumberOfCodeBlocks, 2077 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2722 ConstructedInterpolants, 0 QuantifiedInterpolants, 4813 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1925 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 30 InterpolantComputations, 8 PerfectInterpolantSequences, 151/249 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: 28.6s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 6, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 522, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 1995, TOOLS_POST_TIME: 25.8s, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 1995, TOOLS_QUANTIFIERELIM_TIME: 25.0s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.3s, FLUID_QUERY_TIME: 0.1s, FLUID_QUERIES: 2615, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 46, DOMAIN_JOIN_TIME: 0.5s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 27, DOMAIN_WIDEN_TIME: 0.4s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 42, DOMAIN_ISSUBSETEQ_TIME: 0.1s, DOMAIN_ISBOTTOM_APPLICATIONS: 522, DOMAIN_ISBOTTOM_TIME: 0.7s, LOOP_SUMMARIZER_APPLICATIONS: 15, LOOP_SUMMARIZER_CACHE_MISSES: 15, LOOP_SUMMARIZER_OVERALL_TIME: 21.6s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 21.6s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 42, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.8s, DAG_COMPRESSION_PROCESSED_NODES: 55894, DAG_COMPRESSION_RETAINED_NODES: 1712, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 146 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: CELLCOUNT <= 2147483647 || !(CELLCOUNT == CELLCOUNT / 4 * 4) - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((98 == unknown-#memory_int-unknown[2][1] && unknown-#memory_int-unknown[2][7] == 0) && unknown-#memory_int-unknown[2][4] == 52) && unknown-#length-unknown[3] == 12) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && unknown-#memory_int-unknown[2][6] == 99) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && CCCELVOL1 == 1) && volArray == 0) && 0 <= \old(cond)) && 114 == unknown-#memory_int-unknown[2][3]) && 0 <= cond) && \valid[1] == 1) && CCCELVOL2 == 3) && CELLCOUNT == CELLCOUNT / 4 * 4) && \valid[0] == 0) && unknown-#memory_int-unknown[2][5] == 46) && \valid[2] == 1) && #NULL == 0) && 8 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][0] == 48) && (((((CCCELVOL3 == 7 && i * 4 <= 2147483651) && CCCELVOL4 == 5) && 2 <= i) && CCCELVOL3 == unknown-#memory_int-unknown[volArray][volArray + -28 + 16 * i]) || ((CCCELVOL3 == 7 && CCCELVOL4 == 5) && i == 1))) && \old(cond) <= 1) && unknown-#memory_int-unknown[2][0] == 109) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 1 <= CELLCOUNT / 4) && 0 < unknown-#StackHeapBarrier-unknown) && 112 == unknown-#memory_int-unknown[2][2]) && #NULL == 0 - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((98 == unknown-#memory_int-unknown[2][1] && unknown-#memory_int-unknown[2][7] == 0) && unknown-#memory_int-unknown[2][4] == 52) && unknown-#length-unknown[3] == 12) && CCCELVOL3 == 7) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && i * 4 <= 2147483650) && 1 <= i) && unknown-#memory_int-unknown[2][6] == 99) && CCCELVOL4 == 5) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && CCCELVOL1 == 1) && volArray == 0) && 0 <= \old(cond)) && 114 == unknown-#memory_int-unknown[2][3]) && 0 <= cond) && \valid[1] == 1) && CCCELVOL2 == 3) && CELLCOUNT == CELLCOUNT / 4 * 4) && \valid[0] == 0) && unknown-#memory_int-unknown[2][5] == 46) && \valid[2] == 1) && #NULL == 0) && 8 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && unknown-#memory_int-unknown[2][0] == 109) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 1 <= CELLCOUNT / 4) && 0 < unknown-#StackHeapBarrier-unknown) && 112 == unknown-#memory_int-unknown[2][2]) && #NULL == 0 - InvariantResult [Line: 89]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((98 == unknown-#memory_int-unknown[2][1] && unknown-#memory_int-unknown[2][7] == 0) && unknown-#memory_int-unknown[2][4] == 52) && unknown-#length-unknown[3] == 12) && CCCELVOL3 == 7) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && i == 0) && unknown-#memory_int-unknown[2][6] == 99) && CCCELVOL4 == 5) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && CCCELVOL1 == 1) && volArray == 0) && 0 <= \old(cond)) && 114 == unknown-#memory_int-unknown[2][3]) && 0 <= cond) && \valid[1] == 1) && CCCELVOL2 == 3) && CELLCOUNT == CELLCOUNT / 4 * 4) && \valid[0] == 0) && unknown-#memory_int-unknown[2][5] == 46) && \valid[2] == 1) && #NULL == 0) && 8 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && unknown-#memory_int-unknown[2][0] == 109) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 1 <= CELLCOUNT / 4) && 0 < unknown-#StackHeapBarrier-unknown) && 112 == unknown-#memory_int-unknown[2][2]) && #NULL == 0) || ((((((((((((((((((((((((((((((((((((98 == unknown-#memory_int-unknown[2][1] && unknown-#memory_int-unknown[2][7] == 0) && unknown-#memory_int-unknown[2][4] == 52) && unknown-#length-unknown[3] == 12) && CCCELVOL3 == 7) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && 1 <= i) && unknown-#memory_int-unknown[2][6] == 99) && CCCELVOL4 == 5) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && CCCELVOL1 == 1) && volArray == 0) && 0 <= \old(cond)) && 114 == unknown-#memory_int-unknown[2][3]) && 0 <= cond) && \valid[1] == 1) && CCCELVOL2 == 3) && CELLCOUNT == CELLCOUNT / 4 * 4) && \valid[0] == 0) && unknown-#memory_int-unknown[2][5] == 46) && \valid[2] == 1) && #NULL == 0) && 8 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && unknown-#memory_int-unknown[2][0] == 109) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 1 <= CELLCOUNT / 4) && 0 < unknown-#StackHeapBarrier-unknown) && 112 == unknown-#memory_int-unknown[2][2]) && #NULL == 0) - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((98 == unknown-#memory_int-unknown[2][1] && unknown-#memory_int-unknown[2][7] == 0) && unknown-#memory_int-unknown[2][4] == 52) && unknown-#length-unknown[3] == 12) && CCCELVOL3 == 7) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && i * 4 <= 2147483650) && 1 <= i) && unknown-#memory_int-unknown[2][6] == 99) && CCCELVOL4 == 5) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && CCCELVOL1 == 1) && volArray == 0) && 0 <= \old(cond)) && 114 == unknown-#memory_int-unknown[2][3]) && 0 <= cond) && \valid[1] == 1) && CCCELVOL2 == 3) && CELLCOUNT == CELLCOUNT / 4 * 4) && \valid[0] == 0) && unknown-#memory_int-unknown[2][5] == 46) && \valid[2] == 1) && #NULL == 0) && 8 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && unknown-#memory_int-unknown[2][0] == 109) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 1 <= CELLCOUNT / 4) && 0 < unknown-#StackHeapBarrier-unknown) && 112 == unknown-#memory_int-unknown[2][2]) && #NULL == 0 - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((98 == unknown-#memory_int-unknown[2][1] && unknown-#memory_int-unknown[2][7] == 0) && unknown-#memory_int-unknown[2][4] == 52) && unknown-#length-unknown[3] == 12) && CCCELVOL3 == 7) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && 2 <= CELLCOUNT) && unknown-#memory_int-unknown[2][6] == 99) && CCCELVOL4 == 5) && 2 == unknown-#length-unknown[1]) && i == 1) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && CCCELVOL1 == 1) && volArray == 0) && 114 == unknown-#memory_int-unknown[2][3]) && 0 <= cond) && \valid[1] == 1) && CCCELVOL2 == 3) && CELLCOUNT == CELLCOUNT / 4 * 4) && \valid[0] == 0) && !(cond == 0)) && (if (if !(CELLCOUNT % 4 == 0) && CELLCOUNT < 0 then CELLCOUNT % 4 + -4 else CELLCOUNT % 4) == 0 then 1 else 0) == \old(cond)) && unknown-#memory_int-unknown[2][5] == 46) && \valid[2] == 1) && #NULL == 0) && 8 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[2][0] == 109) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 0 < unknown-#StackHeapBarrier-unknown) && 112 == unknown-#memory_int-unknown[2][2]) && #NULL == 0) || (((((((((((((((((((((((((((((((((((((98 == unknown-#memory_int-unknown[2][1] && unknown-#memory_int-unknown[2][7] == 0) && unknown-#memory_int-unknown[2][4] == 52) && CCCELVOL4 == unknown-#memory_int-unknown[volArray][volArray + 16 * i + -32]) && unknown-#length-unknown[3] == 12) && CCCELVOL3 == 7) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && unknown-#memory_int-unknown[2][6] == 99) && CCCELVOL4 == 5) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && CCCELVOL1 == 1) && volArray == 0) && 0 <= \old(cond)) && 114 == unknown-#memory_int-unknown[2][3]) && 0 <= cond) && i <= (if !(CELLCOUNT % 4 == 0) && CELLCOUNT < 0 then CELLCOUNT / 4 + 1 else CELLCOUNT / 4) + 1) && \valid[1] == 1) && CCCELVOL2 == 3) && 2 <= i) && CELLCOUNT == CELLCOUNT / 4 * 4) && \valid[0] == 0) && unknown-#memory_int-unknown[2][5] == 46) && \valid[2] == 1) && #NULL == 0) && 8 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && unknown-#memory_int-unknown[2][0] == 109) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 0 < unknown-#StackHeapBarrier-unknown) && 112 == unknown-#memory_int-unknown[2][2]) && #NULL == 0) RESULT: Ultimate proved your program to be correct! [2022-11-19 08:33:25,038 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c5490cf-7b55-4fd3-8d85-200671431281/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE